Quantifying randomness in real networks

Citations Over TimeTop 10% of 2015 papers

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.

Related Papers

• → Space P-Based Empirical Research on Public Transport Complex Networks in 330 Cities of China(2013)34 cited
• → Recent Progress in Complex Network Analysis: Models of Random Intersection Graphs(2015)23 cited
• → SNAM: A heterogeneous complex networks generation model(2014)4 cited
• → Un-weighted Network Study of Pakistani Airports(2019)3 cited
• → WHAT ARE NETWORKS?(2003)