Limits of locally-globally convergent graph sequences
From MaRDI portal
Publication:2453451
Recommendations
- Measures on the square as sparse graph limits
- On limits of sparse random graphs
- Convergence of graphs with intermediate density
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
Cites work
- scientific article; zbMATH DE number 1889829 (Why is no real title available?)
- A measure-theoretic approach to the theory of dense hypergraphs
- Bernoulli actions are weakly contained in any free action
- Borel chromatic numbers
- Borel oracles. An analytical approach to constant-time algorithms
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Eigenvalues and expanders
- Every minor-closed property of sparse graphs is testable
- Finite graphs and amenability
- Global aspects of ergodic group actions
- Hyperfinite graph limits
- Large networks and graph limits
- Left and right convergence of graphs with bounded degree
- Limits of dense graph sequences
- Limits of local algorithms over sparse random graphs
- Local Graph Partitions for Approximation and Testing
- Moments of two-variable functions and the uniqueness of graph limits
- Non-deterministic graph property testing
- On limits of finite graphs
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- Sparse graphs: metrics and random models
- Szemerédi's lemma for the analyst
- The combinatoral cost
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Topics in orbit equivalence
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(39)- Finding one community in a sparse graph
- Weak containment of measure-preserving group actions
- Unimodular measures on the space of all Riemannian manifolds
- Algorithmic obstructions in the random number partitioning problem
- Optimal low-degree hardness of maximum independent set
- Kőnig's line coloring and Vizing's theorems for graphings
- Compact graphings
- First-Order Convergence and Roots
- Multiplication of weak equivalence classes may be discontinuous
- Suboptimality of local algorithms for a class of max-cut problems
- Convergence theorems for graph sequences
- Local approximation of the maximum cut in regular graphs
- Ramanujan graphings and correlation decay in local algorithms
- Factor of iid percolation on trees
- Flows on measurable spaces
- Action convergence of operators and graphs
- Subgraph densities in a surface
- Uniform rank gradient, cost, and local-global convergence
- First order convergence of matroids
- Local-global convergence, an analytic and structural approach
- Measures on the square as sparse graph limits
- Graph limits: An alternative approach to s‐graphons
- A short proof of the equivalence of left and right convergence for sparse graphs
- Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem
- Performance of sequential local algorithms for the random NAE-\(K\)-SAT problem
- Examples in the entropy theory of countable group actions
- Invariant Schreier decorations of unimodular random networks
- Non-standard limits of graphs and some orbit equivalence invariants
- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Greedy maximal independent sets via local limits
- Pointwise ergodic theorem for locally countable quasi-pmp graphs
- Typicality and entropy of processes on infinite trees
- A determinacy approach to Borel combinatorics
- On the almost eigenvectors of random regular graphs
- First order limits of sparse graphs: plane trees and path-width
- On a curious problem and what it lead to
- Hyperfinite graphings and combinatorial optimization
- Large deviation principle for the greedy exploration algorithm over Erdős-Rényi graphs
This page was built for publication: Limits of locally-globally convergent graph sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453451)
