pith. the verified trust layer for science. sign in

arxiv: 1505.07503 · v2 · pith:BPVDI5G6new · submitted 2015-05-27 · ⚛️ physics.soc-ph · cond-mat.stat-mech· cs.NI

Quantifying randomness in real networks

classification ⚛️ physics.soc-ph cond-mat.stat-mechcs.NI
keywords networkrealnetworkspropertiesgraphsrandomnessdegreehuman
0
0 comments X p. Extension
Add this Pith Number to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{BPVDI5G6}

Prints a linked pith:BPVDI5G6 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.