The Probability That a Random Multigraph is Simple
From MaRDI portal
Publication:3557510
DOI10.1017/S0963548308009644zbMath1216.05145arXivmath/0609802OpenAlexW2148896022WikidataQ105585011 ScholiaQ105585011MaRDI QIDQ3557510
Publication date: 23 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0609802
Related Items
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, Mixing times of random walks on dynamic configuration models, Epidemic spreading and equilibrium social distancing in heterogeneous networks, SIR epidemics on random graphs with a fixed degree sequence, SIR dynamics with vaccination in a large configuration model, Rare event asymptotics for exploration processes for random graphs, The tail does not determine the size of the giant, The scaling window for a random graph with a given degree sequence, Chase-escape on the configuration model, Analyzing local and global properties of multigraphs, Critical value asymptotics for the contact process on random graphs, A Dynamic Contagion Risk Model with Recovery Features, How Clustering Affects Epidemics in Random Networks, Bootstrap percolation in living neural networks, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, The giant component of the directed configuration model revisited, Universality for critical heavy-tailed network models: metric structure of maximal components, The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees, Push is Fast on Sparse Random Graphs, Epidemics on networks with preventive rewiring, Enumeration of graphs with a heavy-tailed degree sequence, Contagion risks and security investment in directed networks, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, The diameter of the directed configuration model, Largest component of subcritical random graphs with given degree sequence, Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics, Rankings in directed configuration models with heavy tailed in-degrees, Diffusion and cascading behavior in random networks, A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, The configuration model for partially directed graphs, The Construction and Properties of Assortative Configuration Graphs, The Interpolation Method for Random Graphs with Prescribed Degrees, Optimal connectivity for a large financial network, Critical Window for Connectivity in the Configuration Model, Random graphs with given vertex degrees and switchings, First passage percolation on random graphs with finite mean degrees, Asymptotic normality in random graphs with given vertex degrees, Unnamed Item, Limit distributions of the number of loops in a random configuration graph, Diameter in ultra‐small scale‐free random graphs, The component sizes of a critical random graph with given degree sequence, Heavy-tailed configuration models at criticality, Survival and extinction of epidemics on random graphs with general degree, The largest component in a subcritical random graph with a power law degree distribution, Optimal subgraph structures in scale-free configuration models, Central limit theorems for SIR epidemics and percolation on configuration model random graphs, Size biased couplings and the spectral gap for random regular graphs, Characterizing optimal sampling of binary contingency tables via the configuration model, Near-critical SIR epidemic on a random graph with given degrees, Replica bounds by combinatorial interpolation for diluted spin systems, Asymptotic equivalence and contiguity of some random graphs, Random graphs with forbidden vertex degrees, Graphs with specified degree distributions, simple epidemics, and local vaccination strategies, RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS, Applications of the variance of final outbreak size for disease spreading in networks, Geometry of the minimal spanning tree of a random 3-regular graph, Exponential Random Graphs as Models of Overlay Networks, Managing Default Contagion in Inhomogeneous Financial Networks, Threshold behaviour and final outcome of an epidemic on a random network with household structure, Multiplexity analysis of networks using multigraph representations, Bootstrap percolation in directed inhomogeneous random graphs, Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees, Estimating graph parameters with random walks, Component structure of the configuration model: Barely supercritical case, Global lower mass-bound for critical configuration models in the heavy-tailed regime, The front of the epidemic spread and first passage percolation, The probability that a random multigraph is simple. II, A simple solution to the k‐core problem, Counting triangles in power-law uniform random graphs, Limit theorems for assortativity and clustering in null models for scale-free networks, Joint Distribution of Distances in Large Random Regular Networks, Limit laws for self-loops and multiple edges in the configuration model, Law of large numbers for the SIR epidemic on a random graph with given degrees, Degree distribution dynamics for disease spreading with individual awareness, DISTRIBUTION DYNAMICS FOR SIS MODEL ON RANDOM NETWORKS, Degree distribution of shortest path trees and bias of network sampling algorithms, Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs, The densest subgraph problem in sparse random graphs
Cites Work
- 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
- Asymptotic enumeration by degree sequence of graphs of high degree
- A simple solution to the k‐core problem
- Uniform generation of random regular graphs of moderate degree
- Probability: A Graduate Course
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
