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