Quantifying randomness in real networks

C. Orsini, M.M. Dankulov, P. Colomer - de-Simon, A. Jamakovic, P. Mahadevan, A. Vahdat, K.E. Bassler, Z. Toroczkai, M. Boguna, G. Caldarelli, Santo Fortunato, D. Krioukov

Research output: Contribution to journalArticleScientificpeer-review

82 Citations (Scopus)
448 Downloads (Pure)

Abstract

Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks—the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain—and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.
Original languageEnglish
Article number8627
Pages (from-to)1-10
JournalNature Communications
Volume6
DOIs
Publication statusPublished - 2015
MoE publication typeA1 Journal article-refereed

Fingerprint Dive into the research topics of 'Quantifying randomness in real networks'. Together they form a unique fingerprint.

Cite this