Subgraph densities in Markov spaces

DOI10.1016/j.aim.2023.109414arXiv2206.04493MaRDI QIDQ6184559

Balázs Szegedy, Dávid Kunszenti-Kovács, László Lovász

Publication date: 25 January 2024

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph limitsubgraph densityMarkov space

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• A generalization of Hölder's inequality and some probability inequalities
• The step Sidorenko property and non-norming edge-transitive graphs
• Multigraph limits, unbounded kernels, and Banach space decorated graphs
• Cut distance identifying graphon parameters over weak* limits
• Finitely forcible graphons
• Measures on the square as sparse graph limits
• Identifiability for Graphexes and the Weak Kernel Metric
• Conditioning as disintegration
• Sparse exchangeable graphs and their limits via graphon processes
• Convergence of graphs with intermediate density
• Action convergence of operators and graphs
• An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
• Functional Analysis, Spectral Theory, and Applications
• Graph norms and Sidorenko's conjecture