Link-space formalism for network analysis
arXiv:0708.2176 · doi:10.1103/PhysRevE.77.036112
Abstract
We introduce the link-space formalism for analyzing network models with degree-degree correlations. The formalism is based on a statistical description of the fraction of links l_{i,j} connecting nodes of degrees i and j. To demonstrate its use, we apply the framework to some pedagogical network models, namely, random-attachment, Barabasi-Albert preferential attachment and the classical Erdos and Renyi random graph. For these three models the link-space matrix can be solved analytically. We apply the formalism to a simple one-parameter growing network model whose numerical solution exemplifies the effect of degree-degree correlations for the resulting degree distribution. We also employ the formalism to derive the degree distributions of two very simple network decay models, more specifically, that of random link deletion and random node deletion. The formalism allows detailed analysis of the correlations within networks and we also employ it to derive the form of a perfectly non-assortative network for arbitrary degree distribution.
This updated version has been expanded to include a number of new results. 19 pages, 11 figures. Minor Typos corrected
References in corpus (31)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Assortative mixing in networks
- Evolution of networks
- Specificity and stability in topology of protein networks
- Characterization of complex networks: A survey of measurements
- Mean-field theory for scale-free random 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
- Growing Scale-Free Networks with Tunable Clustering
- Organization of Growing Random Networks
- Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
- Epidemic spreading in correlated complex networks
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- Class of correlated random networks with hidden variables
- Are randomly grown graphs really random?
- Epidemic threshold in structured scale-free networks
- Growing Scale-Free Networks with Small World Behavior
- The origin of degree correlations in the Internet and other networks
- A Model for Social Networks
- Assortative model for social networks
- Structural transitions in scale-free networks
- Scale-Free Networks Generated By Random Walkers
- Mean-field theory for clustering coefficients in Barabasi-Albert networks
- Rate equation approach for correlations in growing network models
- Scale Free Networks from Self-Organisation
- Evolving networks through deletion and duplication
- Experimental ancilla-assisted qubit transmission against correlated noise using quantum parity checking
- Thermodynamics of osp(1|2) Integrable Spin Chain: Finite Size Correction