Multigraph limits, unbounded kernels, and Banach space decorated graphs
From MaRDI portal
Publication:2056409
DOI10.1016/j.jfa.2021.109284zbMath1479.05342arXiv1406.7846OpenAlexW3211038498MaRDI QIDQ2056409
Balázs Szegedy, László Lovász, Dávid Kunszenti-Kovács
Publication date: 2 December 2021
Published in: Journal of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.7846
Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99) Density (toughness, etc.) (05C42)
Related Items
Preferential attachment processes approaching the Rado multigraph, Uniqueness of Banach space valued graphons, Subgraph densities in Markov spaces, Relating the cut distance and the weak* topology for graphons, On the dense preferential attachment graph models and their graphon induced counterpart, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Action convergence of operators and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Multigraph limits and exchangeability
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quick approximation to matrices and applications
- Uniqueness of Banach space valued graphons
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Graphons, cut norm and distance, couplings and rearrangements