本文介绍了网络的关键属性，包括度分布、路径长度、聚类系数和连通性。深入探讨了Erdos-Renyi随机图模型（Gnp和Gnm），其度分布随着节点数量增加趋于狭窄。此外，讨论了小世界网络的高聚类和低路径长度特征，并提及Kronecker图模型作为生成复杂网络结构的方法。
Propertities of Networks and Random Graphs
1. Key network propertities
1. degree distribution p ( k ) p(k) p(k)
probability that a randomly chosen node has degree k:
p ( k ) = N k / N p(k)=N_k/N p(k)=Nk/N
i n w h i c h , N k = n u m b e r o f n o d e s w i t h d e g r e e k in\ which, N_k=number\ of\ nodes\ with\ degree\ k in which,Nk=number of nodes with degree k.
2. path length h h h
- distance: the shortest path between two nodes
- diameter: the maximum distance between any pair of nodes in a graph
- average path length
h ‾ = 1 2 E m a x ⋅ ∑ i , j ≠ i h i j \overline h=\frac 1{2E_{max}}\cdot \sum_{i,j\neq i}h_{ij} h=2Emax1⋅i,j=i∑hij
E m a x = n ( n − 1 ) 2 E_{max}=\frac{n(n-1)}{2} Emax=2n(n−1)
3. clustering coefficient (for undirected graph) C C
最低0.47元/天 解锁文章
654
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
