Combinatorial study of degree assortativity in networks

Tools

Estrada, Ernesto (2011) Combinatorial study of degree assortativity in networks. Physical Review E, 84. 047101. ISSN 2470-0053 (https://doi.org/10.1103/PhysRevE.84.047101)

Full text not available in this repository.Request a copy

Abstract

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.

ORCID iDs

Estrada, Ernesto ORCID logoORCID: https://orcid.org/0000-0002-3066-7418;
CORE (COnnecting REpositories)