Multigraph limits and exchangeability
From MaRDI portal
Abstract: The theory of limits of dense graph sequences was initiated by Lovasz and Szegedy. We give a possible generalization of this theory to multigraphs. Our proofs are based on the correspondence between dense graph limits and countable, exchangeable arrays of random variables observed by Diaconis and Janson. The main ingredient in the construction of the limit object is Aldous' representation theorem for exchangeable arrays.
Recommendations
Cites work
- Graph limits and exchangeable random graphs
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 3237398 (Why is no real title available?)
- Limits of dense graph sequences
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Probabilistic Symmetries and Invariance Principles
- Probability with Martingales
- Representations for partially exchangeable arrays of random variables
Cited in
(11)- Multigraph limits, unbounded kernels, and Banach space decorated graphs
- Exchangeability and continuum limits of discrete random structures
- Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics
- Graph limits and exchangeable random graphs
- Multigraph limit of the dense configuration model and the preferential attachment graph
- Harmonic analysis of symmetric random graphs.
- Limits of multi-relational graphs
- Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model
- Probability-graphons: limits of large dense weighted graphs
- Exchangeable interval hypergraphs and limits of ordered discrete structures
- On exchangeable random variables and the statistics of large graphs and hypergraphs
This page was built for publication: Multigraph limits and exchangeability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626051)