The probability that a random multigraph is simple. II
From MaRDI portal
Publication:5245618
DOI10.1239/jap/1417528471zbMath1309.05162arXiv1307.6344MaRDI QIDQ5245618
Publication date: 14 April 2015
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6344
05C80: Random graphs (graph-theoretic aspects)
05C30: Enumeration in graph theory
60C05: Combinatorial probability
Related Items
Limit theorems for assortativity and clustering in null models for scale-free networks, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, Random graphs with given vertex degrees and switchings, Asymptotic normality in random graphs with given vertex degrees, Component structure of the configuration model: Barely supercritical case, The Interpolation Method for Random Graphs with Prescribed Degrees, Critical Window for Connectivity in the Configuration Model, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Near-critical SIR epidemic on a random graph with given degrees, Counting triangles in power-law uniform random graphs, Enumeration of graphs with a heavy-tailed degree sequence, Mixing times of random walks on dynamic configuration models, Replica bounds by combinatorial interpolation for diluted spin systems, Multiplexity analysis of networks using multigraph representations, Central limit theorems for SIR epidemics and percolation on configuration model random graphs, Graphs with prescribed local neighborhoods of their universal coverings, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Limit laws for self-loops and multiple edges in the configuration model, The jamming constant of uniform random graphs, Fast mixing via polymers for random graphs with unbounded degree
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Asymptotic normality of the \(k\)-core in random graphs
- The asymptotic distribution of short cycles in random regular graphs
- 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
- An old approach to the giant component problem
- The Probability That a Random Multigraph is Simple
- Characterizing optimal sampling of binary contingency tables via the configuration model
- Law of large numbers for the SIR epidemic on a random graph with given degrees
- Probability: A Graduate Course
