Nodal domain partition and the number of communities in networks

Details Nodal domain partition and the number of communities in networks Nodal domain partition and the number of communities in networks

2012-01-27

arxiv.org/abs/1201.5767v1

Physics

Physics and Society

18 pages, 8 figures, 48 references

Scientific paper

It is difficult to detect and evaluate the number of communities in complex networks, especially when the situation involves with an ambiguous boundary between the inner- and inter-community densities. In this paper, Discrete Nodal Domain Theory could be used to provide a criterion to determine how many communities a network would have and how to partition these communities by means of the topological structure and geometric characterization. By capturing the signs of certain Laplacian eigenvectors we can separate the network into several reasonable clusters. The method leads to a fast and effective algorithm with application to a variety of real networks data sets.

Affiliated with

Also associated with

No associations

Rating

Nodal domain partition and the number of communities in networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nodal domain partition and the number of communities in networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nodal domain partition and the number of communities in networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-344903