Combinatorial study of degree assortativity in networks

Ernesto Estrada

Research output: Contribution to journalArticle

21 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)047101
Number of pages4
JournalPhysical Review E
Volume84
DOIs
Publication statusPublished - 17 Oct 2011

    Fingerprint

Keywords

  • networks
  • degree assortativity
  • disassortive
  • combinatorial

Cite this