Szemerédi's lemma for the analyst
From MaRDI portal
Publication:879618
DOI10.1007/s00039-007-0599-6zbMath1123.46020OpenAlexW2068571612WikidataQ105583448 ScholiaQ105583448MaRDI QIDQ879618
Publication date: 14 May 2007
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00039-007-0599-6
Random graphs (graph-theoretic aspects) (05C80) Inner product spaces and their generalizations, Hilbert spaces (46C99)
Related Items
Cut distance identifying graphon parameters over weak* limits, Random graphons and a weak Positivstellensatz for graphs, Grothendieck-Type Inequalities in Combinatorial Optimization, Ramsey properties of algebraic graphs and hypergraphs, Weighted exponential random graph models: scope and large network limits, Szemerédi's regularity lemma via martingales, Moments of two-variable functions and the uniqueness of graph limits, Weak regularity and finitely forcible graph limits, Cut norm discontinuity of triangular truncation of graphons, Densities in large permutations and parameter testing, On replica symmetry of large deviations in random graphs, Hypergraph limits: A regularity approach, Hereditary quasirandomness without regularity, Graphons arising from graphs definable over finite fields, Multipodal structure and phase transitions in large constrained graphs, Testing properties of graphs and functions, Uniqueness of Banach space valued graphons, Limits of functions on groups, Bounds for graph regularity and removal lemmas, Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers], σ-algebras for quasirandom hypergraphs, Maximum spread of graphs and bipartite graphs, On a question of Vera T. Sós about size forcing of graphons, Upper tail of the spectral radius of sparse Erdös-Rényi graphs, A unified view of graph regularity via matrix decompositions, Limits of multi-relational graphs, Compact orbit spaces in Hilbert spaces and limits of edge-colouring models, On the chromatic number in the stochastic block model, Continuous stable regularity, Approximate real symmetric tensor rank, Γ-limit of the cut functional on dense graph sequences, Typical large graphs with given edge and triangle densities, A sample-path large deviation principle for dynamic Erdős-Rényi random graphs, Poset limits and exchangeable random posets, Proof of a conjecture of V. Nikiforov, Breaking of ensemble equivalence for dense random graphs under a single constraint, Existence of a symmetric bipodal phase in the edge-triangle model, Local-vs-global combinatorics, Prominent examples of flip processes, Phase transitions in finite random networks, On the Lower Tail Variational Problem for Random Graphs, On Regularity Lemmas and their Algorithmic Applications, Estimating and understanding exponential random graph models, Convergent sequences of dense graphs. II. Multiway cuts and statistical physics, The large deviation principle for the Erdős-Rényi random graph, Quasi-random graphs and graph limits, Limits of kernel operators and the spectral regularity lemma, Regularity lemmas in a Banach space setting, Regular partitions of gentle graphs, A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds, The automorphism group of a graphon, Relating the cut distance and the weak* topology for graphons, Limits of locally-globally convergent graph sequences, Identifiability for Graphexes and the Weak Kernel Metric, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, FORCING QUASIRANDOMNESS WITH TRIANGLES, A sparse regular approximation lemma, Beyond the expanders, Non-Deterministic Graph Property Testing, On derivatives of graphon parameters, An analytic approach to sparse hypergraphs: hypergraph removal, An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence, Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing, Sparse exchangeable graphs and their limits via graphon processes, The role of topology in large deviations, More on quasi-random graphs, subgraph counts and graph limits, Compact graphings, On the variational problem for upper tails in sparse random graphs, An analytic approach to stability, Finitely forcible graphons, Sampling perspectives on sparse exchangeable graphs, Popular differences for corners in Abelian groups, Triforce and corners, Mean-field and graph limits for collective dynamics models with time-varying weights, A fast new algorithm for weak graph regularity, A hypergraph blow-up lemma, Unnamed Item, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, Limits of sparse configuration models and beyond: graphexes and multigraphexes, The Cut Metric for Probability Distributions, On the Query Complexity of Estimating the Distance to Hereditary Graph Properties, Estimating parameters associated with monotone properties, Compactness and finite forcibility of graphons, Poset limits can be totally ordered, The quasi-randomness of hypergraph cut properties, Emergent Structures in Large Networks, Singularities in the entropy of asymptotically large simple graphs, Linear embeddings of graphs and graph limits, Differential calculus on graphon space, The large deviation principle for interacting dynamical systems on random graphs, The regularity method for graphs with few 4‐cycles, A relative Szemerédi theorem, Action convergence of operators and graphs
