参考的网址
科学网 周涛 2012年关于复杂网络的入门书籍和review 介绍
周涛 2017年关于复杂网络的review 推荐
CSDN 博客 复杂网络入门笔记
网络参数的解读
- Degree distributions:node连接的edges的数量。
- Neighborhood connectivity: neighbors 的数量
Stress centrality:构建最短路径经过的数量
Betweenness centrality:
degree centrality is the most straightforward measure, reporting how many edges are connected to a node (in this case, how many genes a given TF connects to)
betweenness centrality and eigenvector centrality; genes with high betweenness are essential for the transfer of information within a network, whereas genes with high eigenvector centrality scores have the most substantial influence in terms of their connections to other well-connected genes