对The structure and function of complex networks的梳理

这篇文章是对The structure and function of complex networks (Newman, 2003)的一个阅读梳理，仅作个人理解使用。在阅读时大量收集了来自互联网的各种资料，但当时并没有做好相关记录，如果涉及侵权请联系我删除。

---

1 The mind map of reading >>

This mind map is the structure of The structure and Function of Complex Networks.

2 The Goal of Learning The Network >>

Our ultimate goal in this field: to understand the behavior and function of the networked systems we see around us. If we can gain such understanding, it will give us new insight into a vast array of complex and previously poorly understood phenomena. >>

3 The structure and Function of Complex Networks >>

3.1 INTRODUCTION >>

3.1.1 >>

Types of networks

HyperGraph :One can also have hyperedges-edges that join more than two vertices together.

3.1.2 >>

Three aims of network theory: 1. To find properties 2. To understand properties 3. To predict behavior

3.2 NETWORKS IN THE REAL WORLD >>

3.2.1 Information networks >>

3.2.2 Technological networks >>

3.2.3 Social networks >>

3.2.4 Biological networks >>

3.3 PROPERTIES OF NETWORKS >>

3.3.1 The small-world effect 小世界效应>>

3.3.1.1 Average shortest path length >>

3.3.1.2 More than one component >>

3.3.1.3 >>

Small-word network:

Random network:

A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other and most nodes can be reached from every other node by a small number of hops or steps.(Wiki )
大的簇系数和小的平均距离两个统计特征合在一起称为小世界效应。具有这种效应的网络就是小世界网络。 （真实网络几乎都具有小世界效应）

33.3.2 Transitivity or clustering 簇/聚类>>

3.3.2.1 >>

全局 针对整个网络:

局部 针对一个节点:

其实都是三元闭回路/三元开路
Local Average Clustering Coefficient 平均局部聚类系数:

3.3.2.1.1 如何找三元闭回路/三元开路>>

closed triplet ={1，(2,3)}，{2，(1,3)}，{3，(1,2)} all triplet = {1,(2,3)}，{2,(1,3)}，{3,(1,2)}，{3,(2,4)}，{3,(4,5)}，{3,(1,5)}，{3,(2,5)}，{3,(1,4)}
按照节点来找

3.3.3 Degree distributions >>

We define $p_k$ to be the fraction of vertices in the network that have degree $k$.

3.3.3.1 Measuring this tail >>

3.3.3.1.1 >>

One is to constructed a histogram in which the bin sizes increase exponentially with degree. 即对数坐标系。

3.3.3.1.2 >>

An alternative way of presenting degree data is to make a plot of the cumulative distribution function

3.3.3.2 Scale-free networks 度分布呈现指数分布的网络>>

3.3.3.3 Maximum degree >>

一个网络中的最大度与节点数有以下关系，并附上证明：

3.3.4 Network resilience >>

网络抗破坏能力，鲁棒性

3.3.5 Mixing patterns >>

网络中各类顶点的连接度

3.3.5.1 >>

3.3.6 Degree correlations >>

连接度不同的顶点之间的联系

3.3.7 Community structure >>

社群结构

3.3.7.1 如何划分社群 >>

3.3.8 Network navigation >>

3.4 RANDOM GRAPHS >>

随机网络具有小的簇系数和小的平均距离（ER随机图的许多重要特性都是突然涌现的，也就是说给定边相连的概率P，要么几乎所有图都有某个性质，要么几乎所有图都不具有该性质）

3.4.1 Poisson random graphs >>

3.4.1.1 Take some number n of vertices and connect each pair (or not) with probability $p$ (or$1−p</script$