161 likes | 463 Views
Modularity and community structure in networks. The Proceedings of the National Academy of Sciences of the United States of America, June 2006 Author:M.E.J.Newman. O utline. The definition of community The arguments of modularity and graph Modularity
E N D
Modularity and community structure in networks The Proceedings of the National Academy of Sciences of the United States of America, June 2006 Author:M.E.J.Newman
Outline • The definition of community • The arguments of modularity and graph • Modularity • Dividing network into two communities • Dividing network into more than two communities • Experiment
The definition of community • Community: the densely connected groups of vertices, with only sparser connections between groups.
The arguments of modularity and graph • A:adjacency matrix • ki: the degrees of vertex i. • si= • m: total edges of the graph • n: total vertices in the graph
Modularity • Q=(number of edges within communities)-(expected number of such edges) • = • = • = • = • = (1)
The example of modularity Modularity Q1=0.3479 Modularity Q2=0.2043
Dividing network into two communities • (2) • S= • B:nn matrix , called modularity matrix
Ex. • =(+++) • = • =
Example • m=14 A= • k1=3,k2=2,k3=3,k4=4,k5=4,k6=4,k7=4,k8=3,k9=1
B11= A11 – = 0 - = -0.3214 B12= A12 – = 1 - = 0.7857
Let • Ex • = • = • = • = • : the ith eigenvector of B
= • = • = • = • = (3) • : the eigenvalue of B,>