Limits of sparse configuration models and beyond: graphexes and multigraphexes
From MaRDI portal
Publication:2072083
DOI10.1214/21-AOP1508zbMath1481.05138arXiv1907.01605OpenAlexW2955730327MaRDI QIDQ2072083
Subhabrata Sen, Souvik Dhara, Christian Borgs, Jennifer T. Chayes
Publication date: 1 February 2022
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01605
preferential attachmentconfiguration modelsparse random graphsCaron-Fox modelgeneralized random graphgraphexes
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Random measures (60G57) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Exchangeability for stochastic processes (60G09) Density (toughness, etc.) (05C42)
Related Items
A large-deviations principle for all the components in a sparse inhomogeneous random graph, On sparsity, power-law, and clustering properties of graphex processes, Global lower mass-bound for critical configuration models in the heavy-tailed regime
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Multigraph limit of the dense configuration model and the preferential attachment graph
- Random graphs with a given degree sequence
- Limits of randomly grown graph sequences
- Generating simple random graphs with prescribed degree distribution
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Exchangeable random measures in the plane
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- On a random graph evolving by degrees
- Extremes and related properties of random sequences and processes
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Representations for partially exchangeable arrays of random variables
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Sampling perspectives on sparse exchangeable graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Completely random measures
- Random Graphs and Complex Networks
- Identifiability for Graphexes and the Weak Kernel Metric
- Concentration Inequalities and Martingale Inequalities: A Survey
- Graph limits and exchangeable random graphs
- Metrics for sparse graphs
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse Graphs Using Exchangeable Random Measures
- A critical point for random graphs with a given degree sequence
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- The phase transition in inhomogeneous random graphs
- Distances in random graphs with finite variance degrees
- Probabilistic Symmetries and Invariance Principles
- An Introduction to the Theory of Point Processes
- Networks
