Asymptotic equivalence and contiguity of some random graphs
From MaRDI portal
Publication:3055876
DOI10.1002/rsa.20297zbMath1209.05225arXiv0802.1637OpenAlexW2949935167MaRDI QIDQ3055876
Publication date: 10 November 2010
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.1637
Related Items
Large deviations for power-law thinned Lévy processes, An elementary approach to component sizes in critical random graphs, Random Simplicial Complexes: Models and Phenomena, A note on undirected random graph models parameterized by the strengths of vertices, Scale-free percolation, Asymptotic uncertainty quantification for communities in sparse planted bi-section models, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Random graphs with given vertex degrees and switchings, Phase transitions for detecting latent geometry in random graphs, Unnamed Item, Generalized random dot product graph, Limit laws in the generalized random graphs with random vertex weights, Sparse random graphs with clustering, The largest component in a subcritical random graph with a power law degree distribution, Central limit theorems in the configuration model, Reconstruction and estimation in the planted partition model, Central limit theorems for SIR epidemics and percolation on configuration model random graphs, Evolution of a modified binomial random graph by agglomeration, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Continuum limit of critical inhomogeneous random graphs, Asymptotic equivalence of probability measures and stochastic processes, Cluster tails for critical power-law inhomogeneous random graphs, Universality for the distance in finite variance random graphs, Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees, Novel scaling limits for critical inhomogeneous random graphs, A note on asymptotic distributions in maximum entropy models for networks, Graphs with specified degree distributions, simple epidemics, and local vaccination strategies, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, The cut metric, random graphs, and branching processes, Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Component structure of the configuration model: Barely supercritical case, Critical behavior in inhomogeneous random graphs, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
Cites Work
- Unnamed Item
- Unnamed Item
- Generating simple random graphs with prescribed degree distribution
- Universality for the distance in finite variance random graphs
- When are random graphs connected
- Emergence of Scaling in Random Networks
- Permutation Pseudographs and Contiguity
- The Probability That a Random Multigraph is Simple
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- The phase transition in inhomogeneous random graphs
- The Small Giant Component in Scale-Free Random Graphs
