On edge exchangeable random graphs

DOI10.1007/s10955-017-1832-9zbMath1405.05161arXiv1702.06396OpenAlexW2590631470WikidataQ59611122 ScholiaQ59611122MaRDI QIDQ1633959

Svante Janson

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

graphonsdense and sparse graph limitsedge exchangeable random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Exchangeability for stochastic processes (60G09)

Related Items

Model-Based Edge Clustering, Local exchangeability, Renewal theory for asymmetric \(U\)-statistics, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Preferential attachment without vertex growth: emergence of the giant component, Nonexchangeable random partition models for microclustering, Truncated simulation and inference in edge-exchangeable networks, Universality for random surfaces in unconstrained genus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Limit theorems for triangular urn schemes
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On a random graph evolving by degrees
• Exchangeable trait allocations
• The ubiquitous Ewens sampling formula
• Central limit theorems for infinite urn models
• Moments of two-variable functions and the uniqueness of graph limits
• Local limit theorems for finite and infinite urn models
• Strong laws of large numbers for \(r\)-dimensional arrays of random variables
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Random Graphs and Complex Networks
• Graph limits and exchangeable random graphs
• Sparse exchangeable graphs and their limits via graphon processes
• Edge Exchangeable Models for Interaction Networks
• Sparse Graphs Using Exchangeable Random Measures
• The birth of the giant component
• Graphons, cut norm and distance, couplings and rearrangements
• The phase transition in inhomogeneous random graphs
• Stochastic branching processes with continuous state space