Efficient procedures for community detection in network studies, especially for sparse networks. The algorithms impose penalties on the differences of the coordinates which represent the community labels of the nodes.
|Author||Yang Feng, Richard J. Samworth and Yi Yu|
|Maintainer||Yi Yu <firstname.lastname@example.org>|
|License||GPL (>= 2.0)|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.