Multigraph limit of the dense configuration model and the preferential attachment graph
From MaRDI portal
Publication:452852
DOI10.1007/S10474-012-0217-4zbMATH Open1265.05560arXiv1106.2058OpenAlexW3104642801MaRDI QIDQ452852FDOQ452852
Publication date: 18 September 2012
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Abstract: The configuration model is the most natural model to generate a random multigraph with a given degree sequence. We use the notion of dense graph limits to characterize the special form of limit objects of convergent sequences of configuration models. We apply these results to calculate the limit object corresponding to the dense preferential attachment graph and the edge reconnecting model. Our main tools in doing so are (1) the relation between the theory of graph limits and that of partially exchangeable random arrays (2) an explicit construction of our random graphs that uses urn models.
Full work available at URL: https://arxiv.org/abs/1106.2058
Recommendations
- Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Multigraph limits and exchangeability
- Asymptotic behavior and distributional limits of preferential attachment graphs
- On the dense preferential attachment graph models and their graphon induced counterpart
Cites Work
- Limits of dense graph sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representations for partially exchangeable arrays of random variables
- Graph limits and exchangeable random graphs
- Moments of two-variable functions and the uniqueness of graph limits
- Probability with Martingales
- Random graphs with a given degree sequence
- Random graphons and a weak positivstellensatz for graphs
- Multigraph limits and exchangeability
- Limits of randomly grown graph sequences
Cited In (9)
- Preferential attachment without vertex growth: emergence of the giant component
- Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs
- Uniqueness of Banach space valued graphons
- Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model
- Multigraph limits and exchangeability
- Large deviations for the degree structure in preferential attachment schemes
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Higher-order fluctuations in dense random graph models
- On the dense preferential attachment graph models and their graphon induced counterpart
This page was built for publication: Multigraph limit of the dense configuration model and the preferential attachment graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452852)
