Limits of kernel operators and the spectral regularity lemma

DOI10.1016/j.ejc.2011.03.005zbMath1230.05177arXiv1003.5588OpenAlexW1980573399WikidataQ124812586 ScholiaQ124812586MaRDI QIDQ648972

Balázs Szegedy

Publication date: 29 November 2011

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

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

zbMATH Keywords

graph limit theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Symmetric functions and generalizations (05E05) Ordered topological linear spaces, vector lattices (46A40)

Related Items

The mean field analysis of the Kuramoto model on graphs. I: The mean field equation and transition point formulas ⋮ A noncommutative approach to the graphon Fourier transform ⋮ On the spectrum of dense random geometric graphs ⋮ From quasirandom graphs to graph limits and graphlets ⋮ A unified view of graph regularity via matrix decompositions ⋮ Large deviations of subgraph counts for sparse Erdős-Rényi graphs ⋮ QUASIRANDOM GROUP ACTIONS ⋮ The automorphism group of a graphon ⋮ Generalized quasirandom properties of expanding graph sequences ⋮ Characteristic power series of graph limits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A measure-theoretic approach to the theory of dense hypergraphs
• Testing properties of graphs and functions
• Limits of dense graph sequences
• Szemerédi's lemma for the analyst
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quick approximation to matrices and applications
• Finitely forcible graphons
• Moments of two-variable functions and the uniqueness of graph limits
• Graph limits and parameter testing
• Regularity partitions and the topology of graphons
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Quasirandom Groups
• The symmetry preserving removal lemma
• Efficient testing of large graphs