Limits of locally-globally convergent graph sequences
From MaRDI portal
Publication:2453451
DOI10.1007/s00039-014-0258-7zbMath1294.05109OpenAlexW2163712938MaRDI QIDQ2453451
László Lovász, Hamed Hatami, Balázs Szegedy
Publication date: 6 June 2014
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00039-014-0258-7
Related Items
Subgraph densities in a surface, Ramanujan graphings and correlation decay in local algorithms, Factor of IID Percolation on Trees, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, First order convergence of matroids, Graph limits: An alternative approach to s‐graphons, Finding one community in a sparse graph, Suboptimality of local algorithms for a class of max-cut problems, On the almost eigenvectors of random regular graphs, On a curious problem and what it lead to, Algorithmic obstructions in the random number partitioning problem, Large Deviation Principle for the Greedy Exploration Algorithm over Erd\"os-R\'enyi Graphs, A short proof of the equivalence of left and right convergence for sparse graphs, Spectral measures of factor of i.i.d. processes on vertex-transitive graphs, Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem, First-Order Convergence and Roots, KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS, Pointwise ergodic theorem for locally countable quasi-pmp graphs, Hyperfinite graphings and combinatorial optimization, Compact graphings, Convergence theorems for graph sequences, A determinacy approach to Borel combinatorics, Local approximation of the maximum cut in regular graphs, Flows on measurable spaces, Uniform rank gradient, cost, and local-global convergence, Examples in the entropy theory of countable group actions, Weak containment of measure-preserving group actions, Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem, First order limits of sparse graphs: Plane trees and path-width, Local-global convergence, an analytic and structural approach, Measures on the square as sparse graph limits, Non-standard limits of graphs and some orbit equivalence invariants, Invariant Schreier decorations of unimodular random networks, Multiplication of weak equivalence classes may be discontinuous, Typicality and entropy of processes on infinite trees, Unimodular measures on the space of all Riemannian manifolds, Optimal low-degree hardness of maximum independent set, Action convergence of operators and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- A measure-theoretic approach to the theory of dense hypergraphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Hyperfinite graph limits
- On limits of finite graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Every minor-closed property of sparse graphs is testable
- Eigenvalues and expanders
- Borel chromatic numbers
- Finite graphs and amenability
- Recurrence of distributional limits of finite planar graphs
- Topics in orbit equivalence
- Moments of two-variable functions and the uniqueness of graph limits
- The combinatoral cost
- Processes on unimodular random networks
- Borel oracles. An analytical approach to constant-time algorithms
- Left and right convergence of graphs with bounded degree
- Bernoulli actions are weakly contained in any free action
- Local Graph Partitions for Approximation and Testing
- Sparse graphs: Metrics and random models
- Non-Deterministic Graph Property Testing
- Limits of local algorithms over sparse random graphs
