Finding community structure in networks using the eigenvectors of matrices
Citations
18,940 citations
13,519 citations
11,078 citations
9,057 citations
Cites background or methods from "Finding community structure in netw..."
...Such refinement procedures are similar to the technique proposed by Newman to improve the results of his spectral optimization of modularity ((Newman, 2006b) and Section VI.A.4)....
[...]
...The 26 edge clustering coefficient is defined as C̃ (g) i,j = z (g) i,j + 1 s (g) i,j , (27) where i and j are the extremes of the edge, z (g) i,j the number of cycles of length g built upon edge ij and s (g) i,j the possible number of cycles of length g that one could build based on the existing…...
[...]
...On the contrary, the existence of partitions with large negative modularity values may hint to the existence of subgroups with very few internal edges and many edges lying between them (multipartite structure) (Newman, 2006a)....
[...]
...…methods, which are computationally demanding (Guimerà et al., 2004; Massen and Doye, 2005; Medus et al., 2005); algorithms giving a good tradeoff between high accuracy and low complexity (Duch and Arenas, 2005; Lehmann and Hansen, 2007; Newman, 2006b; Ruan and Zhang, 2007; White and Smyth, 2005)....
[...]
8,850 citations
Cites methods from "Finding community structure in netw..."
...As an example, take a look at the code which implements Newman’s community detection algorithm based on the leading eigenvector of the graph’s adjacency matrix [5]:...
[...]
References
39,297 citations
37,560 citations
33,771 citations
"Finding community structure in netw..." refers background in this paper
...Perhaps more surprising is the most right-wing book: A National Party No More by Zell Miller.4...
[...]
18,940 citations
17,647 citations
"Finding community structure in netw..." refers methods in this paper
...ar X iv :p hy si cs /0 60 50 87 v2 [ ph ys ic s. da ta -a n] 1 9 M ay 2 00 6 Finding community structure in networks using the eigenvectors of matrices M. E. J. Newman Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, MI 48109–1040 We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them....
[...]
...…using the eigenvectors of matrices M. E. J. Newman Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, MI 48109–1040 We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density…...
[...]