machine learning with graph
1、Networks and applications
embedding node
components of a network
节点的度
图的全连接可以有最多的边,称为完全图
邻接矩阵
更多图的类型
2、How to Measure a Network
Network Diameter
Clustering coefficient
Connectivity
3、simpleast model of graph
Random graphs with arbitrary degree distributions and their applications
二项分布方差推导
方差和期望的比值说明:当网络规模逐渐变大,平均值会越来越集中
对应了大数定理
path
在本节中,首先要定义一个东西: e x p e n s i o n α expension\ \alpha expension α。
- 定义: e x p e n s i o n α expension\ \alpha expension α是指,若图 G G G拥有 V V V个顶点和 E E E条边,且 S S