Asymptotic equivalence and contiguity of some random graphs
From MaRDI portal
Publication:3055876
DOI10.1002/RSA.20297zbMATH Open1209.05225arXiv0802.1637OpenAlexW2949935167MaRDI QIDQ3055876FDOQ3055876
Authors: Svante Janson 
Publication date: 10 November 2010
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Abstract: We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than what might naively be expected. One application is a simple proof of a recent result by van den Esker, van der Hofstad and Hooghiemstra on the equivalence between graph distances for some random graph models.
Full work available at URL: https://arxiv.org/abs/0802.1637
Recommendations
Cites Work
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- The phase transition in inhomogeneous random graphs
- Random graph dynamics
- The probability that a random multigraph is simple
- Generating simple random graphs with prescribed degree distribution
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Universality for the distance in finite variance random graphs
- Permutation Pseudographs and Contiguity
- The Small Giant Component in Scale-Free Random Graphs
- When are random graphs connected
Cited In (42)
- Sparse random graphs with clustering
- Generalized random dot product graph
- Equivalence of a random intersection graph and G (n ,p )
- Survey of scalings for the largest connected component in inhomogeneous random graphs
- Limit laws in the generalized random graphs with random vertex weights
- Asymptotic equivalence of probability measures and stochastic processes
- Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
- Novel scaling limits for critical inhomogeneous random graphs
- Component structure of the configuration model: barely supercritical case
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
- Random Simplicial Complexes: Models and Phenomena
- Central limit theorems for SIR epidemics and percolation on configuration model random graphs
- Large deviations for power-law thinned Lévy processes
- Upper bounds for the largest component in critical inhomogeneous random graphs
- Asymptotic uncertainty quantification for communities in sparse planted bi-section models
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Cluster tails for critical power-law inhomogeneous random graphs
- Permutation Pseudographs and Contiguity
- Equivalence of zero entropy and the Liouville property for stationary random graphs
- Title not available (Why is that?)
- An elementary approach to component sizes in critical random graphs
- Evolution of a modified binomial random graph by agglomeration
- Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
- Phase transitions for detecting latent geometry in random graphs
- Critical behavior in 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
- The cut metric, random graphs, and branching processes
- Reconstruction and estimation in the planted partition model
- The first-order contiguity of sparse random graphs with prescribed degrees
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- Random graphs with given vertex degrees and switchings
- Scale-free percolation
- Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs
- The largest component in a subcritical random graph with a power law degree distribution
- Central limit theorems in the configuration model
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
- A note on asymptotic distributions in maximum entropy models for networks
- A note on undirected random graph models parameterized by the strengths of vertices
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Continuum limit of critical inhomogeneous random graphs
This page was built for publication: Asymptotic equivalence and contiguity of some random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055876)
