Efficient procedures for community detection in network studies, especially for sparse networks with not very obvious community structure. The algorithms impose penalties on the differences of the coordinates which represent the community labels of the nodes.
