Combinatorial study of degree assortativity in networks

Ernesto Estrada

Research output: Contribution to journalArticle

17 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.
LanguageEnglish
Pages047101
Number of pages4
JournalPhysical Review E
Volume84
DOIs
Publication statusPublished - 17 Oct 2011

Fingerprint

Clustering Coefficient
Transitivity
Branching
Connectivity
Likely
coefficients

Keywords

  • networks
  • degree assortativity
  • disassortive
  • combinatorial

Cite this

Estrada, Ernesto. / Combinatorial study of degree assortativity in networks. In: Physical Review E. 2011 ; Vol. 84. pp. 047101.
@article{7c724e87fbc646fe9566accdf3b53962,
title = "Combinatorial study of degree assortativity in networks",
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.",
keywords = "networks, degree assortativity , disassortive, combinatorial",
author = "Ernesto Estrada",
year = "2011",
month = "10",
day = "17",
doi = "10.1103/PhysRevE.84.047101",
language = "English",
volume = "84",
pages = "047101",
journal = "Physical Review E",
issn = "1539-3755",
publisher = "American Physical Society",

}

Combinatorial study of degree assortativity in networks. / Estrada, Ernesto.

In: Physical Review E, Vol. 84, 17.10.2011, p. 047101.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Combinatorial study of degree assortativity in networks

AU - Estrada, Ernesto

PY - 2011/10/17

Y1 - 2011/10/17

N2 - 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.

AB - 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.

KW - networks

KW - degree assortativity

KW - disassortive

KW - combinatorial

UR - http://www.scopus.com/inward/record.url?scp=80054952081&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.84.047101

DO - 10.1103/PhysRevE.84.047101

M3 - Article

VL - 84

SP - 047101

JO - Physical Review E

T2 - Physical Review E

JF - Physical Review E

SN - 1539-3755

ER -