Limit laws for self-loops and multiple edges in the configuration model

DOI10.1214/18-AIHP926zbMath1466.60194arXiv1603.07172MaRDI QIDQ2337833

Omer Angel, Cecilia Holmgren, Remco van der Hofstad

Publication date: 20 November 2019

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07172

zbMATH Keywords

self-loopsconfiguration modelmultiple edgesChen-Stein Poisson approximation

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Processes in random environments (60K37)

Related Items

Moments of Uniform Random Multigraphs with Fixed Degree Sequences, I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, Threshold functions for small subgraphs in simple graphs and multigraphs, Phase transition in random intersection graphs with communities, Asymptotic normality in random graphs with given vertex degrees, Unnamed Item, Central limit theorems in the configuration model, Central limit theorem for statistics of subcritical configuration models, Limit theorems for assortativity and clustering in null models for scale-free networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• Enumeration of graphs with a heavy-tailed degree sequence
• 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
• When is a scale-free graph ultra-small?
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Random Graphs and Complex Networks
• Statistical mechanics of complex networks
• Upper Bounds for Number of Removed Edges in the Erased Configuration Model
• The Probability That a Random Multigraph is Simple
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• Characterizing optimal sampling of binary contingency tables via the configuration model
• The probability that a random multigraph is simple. II
• Law of large numbers for the SIR epidemic on a random graph with given degrees