Small World Networks

Neighborhood
¡
¡
¡
¡
The neighborhood Г(v) of a vertex v
l Is the subgraph S consisting of all the vertices adjacent to
v, v excluded
l Let us indicate a |Г(v)| the number of vertices of Г(v)
The neighborhood Г(S) of a subgraph S
Is the subgraph that consists of all the vertices
adjacent to any of the vertices of S, S excluded
l S=Г(v), Г(S)= Г(Г(v))= Г 2 (v)
l Г i (v) is the ith neighborhood of v
Distribution sequence Λ
l Λi(v)=∑0ài|Г(v)|
l This counts all the nodes that can be reached from v at a
specific distance
l In a small world, the distribution sequence grows very
fast
19
Clustering (1)
¡ The clustering γv of a
vertex v
l Measures to extent
to which the vertices
adjacent to j are also
adjacent to each
other
l i.e., measure the
amount of edges in
Г(v)
NOT CLUSTERED
v
Г(v)
CLUSTERED
v
Г(v)
20
10