Mechanism for linear preferential attachment in growing networks
arXiv:0708.2598 · doi:10.1016/j.physa.2005.04.005
Abstract
The network properties of a graph ensemble subject to the constraints imposed by the expected degree sequence are studied. It is found that the linear preferential attachment is a fundamental rule, as it keeps the maximal entropy in sparse growing networks. This provides theoretical evidence in support of the linear preferential attachment widely exists in real networks and adopted as a crucial assumption in growing network models. Besides, in the sparse limit, we develop a method to calculate the degree correlation and clustering coefficient in our ensemble model, which is suitable for all kinds of sparse networks including the BA model, proposed by Barabasi and Albert.
10 pages, 1 figure
References in corpus (21)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Assortative mixing in networks
- The structure of scientific collaboration networks
- The diameter of the world wide web
- The large-scale organization of metabolic networks
- Specificity and stability in topology of protein networks
- Dynamical and correlation properties of the Internet
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Organization of Growing Random Networks
- Large-scale topological and dynamical properties of Internet
- The statistical mechanics of networks
- Measuring preferential attachment for evolving networks
- Weighted evolving networks: coupling topology and weights dynamics
- Preferential attachment in the protein network evolution
- The origin of degree correlations in the Internet and other networks
- Effect of the accelerating growth of communications networks on their structure
- Clustering of correlated networks
- Principles of statistical mechanics of random networks
- Scale free networks from a Hamiltonian dynamics