3/10/2021

Chương 3:

CÁC ĐẶC TRƯNG MẠNG

(NETWORK CHARACTERISTICS)

Thời lượng: 3 tiết

NỘI DUNG
Các đặc trưng mạng (network characteristics)
▪ Degree Distribution
▪ Path distance Distribution
▪ Clustering coecient distribution
▪ Community structure

1
 3/10/2021

Network characteristics

How to Measure a Network ?

▪ Degree distribution: P(k)
▪ Path length: h
▪ Clustering coefficient: C

Degree distribution
❖Degree distribution P(k): Probabilitythat randomly
chosen node has degree k
Nk = # nodes with degree k
❖Normalized histogram: P(k)
0.6

P(k) = Nk / N ➔ plot 0.5

0.4
0.3
0.2
0.1

1 2 3 4 k

Nk

2
 3/10/2021

Degree distribution for undirected graph

Degree distribution for undirected graph

3
 3/10/2021

Degree distribution for directed graph

Degree distribution for directed graph

4
 3/10/2021

Path in a Graph (Review)

❖A path is a sequence of nodes in which each node is
linked to the next one
Pn = {i0,i1,i2,...,in} Pn = {(i0 ,i1),(i1,i2 ),(i2 ,i3 ),...,(in−1,in )}

❖Path can intersect itself and

pass through the same
edge multiple times B
F
§ E.g.: ACBDCDEG A
D E
§ In a directed graph a path C
G

can only followthe H

direction of the “arrow”

11

Clustering coefficient

❖Clustering coefficient:
▪ What portion of i’s neighbors are connected?
▪ Node i with degree ki
▪ Ci  [0,1]
where ei is the number of edges
between the neighbors of node i

i i i

Ci=0 Ci=1/3 Ci=1 N

1
❖ Average clustering coefficient: C =
N
C
i
i

12

5
 3/10/2021

Clustering coefficient
❖Ví dụ:
where ei is the number of edges
between the neighbors of node i

kB=2, eB=1, CB=2/2 = 1

B kD=4, eD=2, CD=4/12 = 1/3
A F
D E
G
C
H

13

Community structure

• Network nodes are joined together in tightly

knit groups, between which there are only
looser connections.
• Refs: (Girvan and Newman, 2002)

14

14

6
 3/10/2021

Tài liệu tham khảo

1. Kenneth H.Rosen, Toán rời rạc - Ứng dụng trong
tin học, NXB Khoa học kỹ thuật. Hà nội-1997.
(Phạm Văn Thiều và Đặng Hữu Thịnh dịch).
2. Stanley Wasserman & Katherine Faust. Social
Network Analysis: Methods and Applications.
Cambridge University Press, 2009.
3. Matthew O. Jackson, Professor: Social and
Economic Networks: Models and Analysis, Stanford
University (Coursera)
https://www.coursera.org/learn/social-economic-
networks

15