Estrada, Ernesto (2011) Combinatorial study of degree assortativity in networks. Physical Review E, 84. 047101. ISSN 1539-3755Full text not available in this repository. (Request a copy from the Strathclyde author)
Why are some networks degree-degree correlated (assortative), while most of the real-world ones are anticorrelated (disassortative)? Here, we prove, by combinatorial methods, that the assortativity of a network depends only on three structural factors: transitivity (clustering coefficient), intermodular connectivity, and branching. Then, a network is assortative if the contributions of the first two factors are larger than that of the third. Highly branched networks are likely to be disassortative.
|Keywords:||networks, degree assortativity , disassortive, combinatorial, Probabilities. Mathematical statistics, Statistical and Nonlinear Physics, Statistics and Probability, Condensed Matter Physics|
|Subjects:||Science > Mathematics > Probabilities. Mathematical statistics|
|Department:||Faculty of Science > Mathematics and Statistics|
|Depositing user:||Pure Administrator|
|Date Deposited:||22 Oct 2011 04:20|
|Last modified:||06 Jan 2017 10:16|