The probability that a random multigraph is simple. II

DOI10.1239/jap/1417528471zbMath1309.05162arXiv1307.6344OpenAlexW2963821492MaRDI QIDQ5245618

Svante Janson

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

zbMATH Keywords

random bipartite graphconfiguration modelrandom multigraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Related Items

The jamming constant of uniform random graphs, Mixing times of random walks on dynamic configuration models, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, Fast mixing via polymers for random graphs with unbounded degree, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Enumeration of graphs with a heavy-tailed degree sequence, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, The Interpolation Method for Random Graphs with Prescribed Degrees, Critical Window for Connectivity in the Configuration Model, Random graphs with given vertex degrees and switchings, Asymptotic normality in random graphs with given vertex degrees, Central limit theorems for SIR epidemics and percolation on configuration model random graphs, Near-critical SIR epidemic on a random graph with given degrees, Replica bounds by combinatorial interpolation for diluted spin systems, Graphs with prescribed local neighborhoods of their universal coverings, Multiplexity analysis of networks using multigraph representations, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Component structure of the configuration model: Barely supercritical case, Counting triangles in power-law uniform random graphs, Limit theorems for assortativity and clustering in null models for scale-free networks, Limit laws for self-loops and multiple edges in the configuration model

Uses Software

• DLMF

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