Modularity and community structure in networks
description
Transcript of Modularity and community structure in networks
1
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
2
The definition of community The arguments of modularity
and graph Modularity Dividing network into two communities Dividing network into more than two
communities Experiment
Outline
3
Community: the densely connected groups of vertices, with only sparser connections between groups.
The definition of community
4
A:adjacency matrix ki: the degrees of vertex i. si= m: total edges of the graph n: total vertices in the graph
The arguments of modularity and graph
5
Q=(number of edges within communities)-(expected number of such edges)
= = = = = (1)
Modularity
6
Modularity Q1=0.3479
Modularity Q2=0.2043
The example of modularity
7
(2) S= B:nn matrix , called modularity matrix
Dividing network into two communities
8
Ex.
=(+++) = =
9
m=14
A=
k1=3,k2=2,k3=3,k4=4,k5=4,k6=4,k7=4,k8=3,k9=1
Example
10
B11= A11 – = 0 - = -0.3214
B12= A12 – = 1 - = 0.7857
mkk
211
289
mkk
221
286
11
Let Ex = = = = : the ith eigenvector of B
12
= = = = = (3) : the eigenvalue of B, >
13
=
14
Dividing network into more than two communities
∆𝑄=1
2𝑚 ¿
g
15
= = =
=
Dividing network into more than two communities
333231232221131211
333332313,3222322212,2111312111,1 )()()(
BBBBBBBBB
ssBBBssBBBssBBB
ba if,0ba if,1
,ba
16
Experiment