Unbiased sampling of network ensembles

@article{Squartini2014UnbiasedSO,
  title={Unbiased sampling of network ensembles},
  author={T. Squartini and R. Mastrandrea and D. Garlaschelli},
  journal={ArXiv},
  year={2014},
  volume={abs/1406.1197}
}
Sampling random graphs with given properties is a key step in the analysis of networks, as random ensembles represent basic null models required to identify patterns such as communities and motifs. An important requirement is that the sampling process is unbiased and efficient. The main approaches are microcanonical, i.e. they sample graphs that match the enforced constraints exactly. Unfortunately, when applied to strongly heterogeneous networks (like most real-world examples), the majority of… Expand
Random walk patterns to identify weighted motifs
TLDR
This work proposed a novel methodology based on a random walker and a fixed maximum number of steps to study weighted motifs of limited size and found that identified similarities enable the classifications of systems according to functioning mechanisms associated with specific configurations. Expand
On metrics and models for multiplex networks
TLDR
It turns out that this methodology, applicable to a specific class of multi-layer networks, can be successfully employed to reconstruct the World Trade Multiplex and is illustrated that the maximum-entropy models also allow us to find the so-called backbone of a real network, i.e. the information which is irreducible to the single-node properties and is therefore peculiar to the network itself. Expand
Randomized reference models for temporal networks
TLDR
Focusing on temporal networks, a unified framework for classifying and understanding microcanonical RRMs (MRRMs) is proposed that sample networks with uniform probability and a taxonomy of MRRMs is built that proposes a canonical naming convention, classifies them, and deduces their effects on a range of important network features. Expand
Irreducible network backbones: unbiased graph filtering via maximum entropy
TLDR
This work introduces a rigorous method that outputs the network backbone that is irreducible to the local properties of nodes, i.e. their degrees and strengths and employs an exact maximum-entropy formulation guaranteeing that the filtered network encodes only the links that cannot be inferred from local information. Expand
How random are complex networks
TLDR
This work considers six real networks and finds 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. Expand
Quantifying randomness in real networks
TLDR
This work considers six real networks and finds 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. Expand
Exact sampling of graphs with prescribed degree correlations
TLDR
This work develops an efficient and exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself. Expand
The statistical physics of real-world networks
TLDR
This Review describes advances in the statistical physics of complex networks and provides a reference for the state of the art in theoretical network modelling and applications to real-world systems for pattern detection and network reconstruction. Expand
Maximum entropy approaches for the study of triadic motifs in the Mergers & Acquisitions network
TLDR
This work considers the configuration models with different constraints for the network of mergers and acquisitions (M&As), and comparing triadic and dyadic motifs, for both the binary and weighted M&A network, with the randomized counterparts can shed light on its organization at higher order level. Expand
Covariance Structure Behind Breaking of Ensemble Equivalence in Random Graphs
For a random graph subject to a topological constraint, the microcanonical ensemble requires the constraint to be met by every realisation of the graph (‘hard constraint’), while the canonicalExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 103 REFERENCES
Analytical maximum-likelihood method to detect patterns in real networks
TLDR
The method reveals that the null behavior of various correlation properties is different from what previously believed, and highly sensitive to the particular network considered, and shows that important structural properties are currently based on incorrect expressions and provides the exact quantities that should replace them. Expand
Constructing and sampling directed graphs with given degree sequences
TLDR
This work presents an algorithm that can directly construct all possible realizations of a given bi-degree sequence by simple digraphs and provides their weight, which can then be used to compute statistical averages of network observables as if they were obtained from uniformly distributed sampling or from any other chosen distribution. Expand
The entropy of randomized network ensembles
Randomized network ensembles are the null models of real networks and are extensively used to compare a real system to a null hypothesis. In this paper we study network ensembles with the same degreeExpand
Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence
TLDR
This work proposes an efficient, polynomial time algorithm that generates statistically independent graph samples with a given, arbitrary, degree sequence, and argues that for large, and for degree sequences admitting many realizations, the sample weights are expected to have a lognormal distribution. Expand
Statistical mechanics of networks.
  • Juyong Park, M. Newman
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy ofExpand
Constrained Markovian Dynamics of Random Graphs
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basicExpand
Enhanced reconstruction of weighted networks from strengths and degrees
TLDR
This work introduces an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples, and shows that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Expand
Null models of economic networks: the case of the world trade web
In all empirical-network studies, the observed properties of economic networks are informative only if compared with a well-defined null model that can quantitatively predict the behavior of suchExpand
Unbiased degree-preserving randomization of directed binary networks.
  • E. Roberts, A. Coolen
  • Mathematics, Biology
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2012
TLDR
An ergodic detailed balance Markov chain with nontrivial acceptance probabilities for directed graphs is constructed, which converges to a strictly uniform measure and is based on edge swaps that conserve all in and out degrees. Expand
Random graphs with arbitrary degree distributions and their applications.
TLDR
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph. Expand
...
1
2
3
4
5
...