Szemerédi's lemma for the analyst
From MaRDI portal
Publication:879618
Recommendations
Cited in
(99)- Poset limits and exchangeable random posets
- Identifiability for graphexes and the weak kernel metric
- Limits of locally-globally convergent graph sequences
- The regularity method for graphs with few 4‐cycles
- Triforce and corners
- Regular partitions of gentle graphs
- On the lower tail variational problem for random graphs
- On replica symmetry of large deviations in random graphs
- Limits of kernel operators and the spectral regularity lemma
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the continuum limit of epidemiological models on graphs: convergence and approximation results
- Hypergraph limits: A regularity approach
- Weighted exponential random graph models: scope and large network limits
- Beyond the expanders
- An Abstract Szemerédi Regularity Lemma
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Compact graphings
- Regularity lemmas and combinatorial algorithms
- The automorphism group of a graphon
- Ramsey properties of algebraic graphs and hypergraphs
- The cut metric for probability distributions
- Cut distance identifying graphon parameters over weak* limits
- Uniqueness of Banach space valued graphons
- Estimating parameters associated with monotone properties
- The role of topology in large deviations
- Sampling perspectives on sparse exchangeable graphs
- Typical large graphs with given edge and triangle densities
- Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
- Differential calculus on graphon space
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- A sample-path large deviation principle for dynamic Erdős-Rényi random graphs
- \(\Gamma\)-limit of the cut functional on dense graph sequences
- Graphons arising from graphs definable over finite fields
- Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
- An analytic approach to stability
- Grothendieck-type inequalities in combinatorial optimization
- Popular differences for corners in abelian groups
- Action convergence of operators and graphs
- On a question of Vera T. Sós about size forcing of graphons
- σ-algebras for quasirandom hypergraphs
- Limits of multi-relational graphs
- Weak regularity and finitely forcible graph limits
- Maximum spread of graphs and bipartite graphs
- Cut norm discontinuity of triangular truncation of graphons
- Limit theorems for exponential random graphs
- Moments of two-variable functions and the uniqueness of graph limits
- Testing versus estimation of graph properties, revisited
- Mean-field and graph limits for collective dynamics models with time-varying weights
- On the Query Complexity of Estimating the Distance to Hereditary Graph Properties
- Poset limits can be totally ordered
- Estimating and understanding exponential random graph models
- On the variational problem for upper tails in sparse random graphs
- Breaking of ensemble equivalence for dense random graphs under a single constraint
- Upper tail of the spectral radius of sparse Erdös-Rényi graphs
- Existence of a symmetric bipodal phase in the edge-triangle model
- The large deviation principle for interacting dynamical systems on random graphs
- A relative Szemerédi theorem
- A sparse regular approximation lemma
- Compact orbit spaces in Hilbert spaces and limits of edge-colouring models
- Testing properties of graphs and functions
- Densities in large permutations and parameter testing
- Relating the cut distance and the weak* topology for graphons
- Proof of a conjecture of V. Nikiforov
- Hereditary quasirandomness without regularity
- Local-vs-global combinatorics
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- More on quasi-random graphs, subgraph counts and graph limits
- Prominent examples of flip processes
- Szemerédi's regularity lemma via martingales
- The large deviation principle for the Erdős-Rényi random graph
- A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
- A unified view of graph regularity via matrix decompositions
- Emergent structures in large networks
- Quasi-random graphs and graph limits
- Forcing quasirandomness with triangles
- An analytic approach to sparse hypergraphs: hypergraph removal
- The quasi-randomness of hypergraph cut properties
- Linear embeddings of graphs and graph limits
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Limits of functions on groups
- A fast new algorithm for weak graph regularity
- On regularity lemmas and their algorithmic applications
- Covariance loss, Szemeredi regularity, and differential privacy
- A hypergraph blow-up lemma
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Bounds for graph regularity and removal lemmas
- On the chromatic number in the stochastic block model
- On derivatives of graphon parameters
- Singularities in the entropy of asymptotically large simple graphs
- Sparse exchangeable graphs and their limits via graphon processes
- Non-deterministic graph property testing
- Multipodal structure and phase transitions in large constrained graphs
- Finitely forcible graphons
- Phase transitions in finite random networks
- Continuous stable regularity
- Approximate real symmetric tensor rank
- Compactness and finite forcibility of graphons
- Random graphons and a weak positivstellensatz for graphs
- Faster combinatorial \(k\)-clique algorithms
This page was built for publication: Szemerédi's lemma for the analyst
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879618)
