Zero Pearson Coefficient for Strongly Correlated Growing Trees
arXiv:0911.4285 · doi:10.1103/PhysRevE.81.031135
Abstract
We obtained Pearson's coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the recursive trees (). If the number of connections of new vertices exceeds one (), then the Pearson coefficient in the infinite networks equals zero only when the degree distribution exponent does not exceed 4. We calculated the Pearson coefficient for finite networks and observed a slow, power-law like approach to an infinite network limit. Our findings indicate that Pearson's coefficient strongly depends on size and details of networks, which makes this characteristic virtually useless for quantitative comparison of different networks.
arXiv comment6 pages, 4 figures
References in corpus (15)
- The structure and function of complex networks
- Assortative mixing in networks
- Specificity and stability in topology of protein networks
- Critical phenomena in complex 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
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- Scaling properties of scale-free evolving networks: Continuous approach
- Percolation on correlated networks
- Rate equation approach for correlations in growing network models
- Generation of arbitrarily two-point correlated random networks
- Correlations in connected random graphs
Cited by in corpus (21)
- Localization and Spreading of Diseases in Complex Networks
- Factors determining nestedness in complex networks
- Uncovering disassortativity in large scale-free networks
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Enhancing neural-network performance via assortativity
- Network constraints on the mixing patterns of binary node metadata
- Measuring degree-degree association in networks
- Lower bound of assortativity coefficient in scale-free networks
- Analysis and perturbation of degree correlation in complex networks
- Fractality and degree correlations in scale-free networks
- Effect of degree correlations above the first shell on the percolation transition
- Observability transitions in correlated networks
- Jamming in complex networks with degree correlation
- Bounds of memory strength for power-law series
- Phase transitions for scaling of structural correlations in directed networks
- Unexpected enhancement in secondary cosmic ray flux during the total lunar eclipse of December 10, 2011
- Mechanisms for tuning clustering and degree-correlations in directed networks
- Random degree-degree correlated networks
- Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks
- Nonmonotonic percolation threshold in correlated networks and hypergraphs
- Interplay between Network Topology and Dynamics in Neural Systems