Assortativity in Generalized Preferential Attachment Models
arXiv:1610.02819
Abstract
In this paper, we analyze assortativity of preferential attachment models. We deal with a wide class of preferential attachment models (PA-class). It was previously shown that the degree distribution in all models of the PA-class follows a power law. Also, the global and the average local clustering coefficients were analyzed. We expand these results by analyzing the assortativity property of the PA-class of models. Namely, we analyze the behavior of which is the average degree of a neighbor of a vertex of degree .
References in corpus (12)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Power laws, Pareto distributions and Zipf's law
- Assortative mixing in networks
- Dynamical and correlation properties of the Internet
- Growing Scale-Free Networks with Tunable Clustering
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Evolving Clustered Random Networks
- Distance-d covering problems in scale-free networks with degree correlations
- Average nearest neighbor degrees in scale-free networks