Unbiased sampling of network ensembles
From MaRDI portal
Publication:3387646
DOI10.1088/1367-2630/17/2/023052zbMath1452.05174arXiv1406.1197OpenAlexW3100007618MaRDI QIDQ3387646
Rossana Mastrandrea, Diego Garlaschelli, Tiziano Squartini
Publication date: 13 January 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.1197
maximum entropy principlecomplex networksensemble nonequivalencenull models of graphssampling network ensembles
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sampling theory, sample surveys (62D05)
Related Items (11)
Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model ⋮ Randomized Reference Models for Temporal Networks ⋮ Is breaking of ensemble equivalence monotone in the number of constraints? ⋮ Covariance structure behind breaking of ensemble equivalence in random graphs ⋮ Reconstructing production networks using machine learning ⋮ Ensemble nonequivalence in random graphs with modular structure ⋮ Multilayer overlaps and correlations in the bank-firm credit network of Spain ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ Asymptotic equivalence of probability measures and stochastic processes ⋮ Graph sampling for Internet topologies using normalized Laplacian spectral features ⋮ Phases of small worlds: a mean field formulation
Cites Work
- Constrained Markovian dynamics of random graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Connected components in random graphs with given expected degree sequences
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Dynamical Processes on Complex Networks
- A critical point for random graphs with a given degree sequence
- Analytical maximum-likelihood method to detect patterns in real networks
- Constructing and sampling directed graphs with given degree sequences
- The average distances in random graphs with given expected degrees
- Networks
This page was built for publication: Unbiased sampling of network ensembles