Enumeration of graphs with a heavy-tailed degree sequence
From MaRDI portal
Publication:895547
DOI10.1016/j.aim.2015.09.002zbMath1327.05155arXiv1404.1250OpenAlexW2963217502MaRDI QIDQ895547
Publication date: 3 December 2015
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.1250
Related Items
Mixing time of the switch Markov chain and stable degree sequences, When is a scale-free graph ultra-small?, Threshold functions for small subgraphs in simple graphs and multigraphs, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, The switch Markov chain for sampling irregular graphs and digraphs, Random graphs with given vertex degrees and switchings, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), The mixing time of switch Markov chains: a unified approach, Limit laws for self-loops and multiple edges in the configuration model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- The asymptotic number of labeled graphs with given degree sequences
- On a conjecture related to geometric routing
- The degree sequence of a scale-free random graph process
- A Random Graph Model for Power Law Graphs
- Statistical mechanics of complex networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- The Probability That a Random Multigraph is Simple
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- A general model of web graphs
- The probability that a random multigraph is simple. II
