On convergence for graphexes

DOI10.1016/j.ejc.2022.103549zbMath1495.60040arXiv1702.06389OpenAlexW4224916983MaRDI QIDQ2143415

Svante Janson

Publication date: 31 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.06389

zbMATH Keywords

graph convergencegraphonsexchangeable graph modelsmodelling of sparse networkssparse graph convergence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random measures (60G57) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Density (toughness, etc.) (05C42)

Related Items

On sparsity, power-law, and clustering properties of graphex processes, Sampling perspectives on sparse exchangeable graphs, Sampling and estimation for (sparse) exchangeable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• 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
• Sampling and estimation for (sparse) exchangeable graphs
• Graph limits and exchangeable random graphs
• Sparse exchangeable graphs and their limits via graphon processes
• Sparse Graphs Using Exchangeable Random Measures
• Graphons, cut norm and distance, couplings and rearrangements
• Probabilistic Symmetries and Invariance Principles