A measure-theoretic approach to the theory of dense hypergraphs
From MaRDI portal
Publication:456779
DOI10.1016/J.AIM.2012.06.022zbMATH Open1251.05115OpenAlexW2061886541MaRDI QIDQ456779FDOQ456779
Abstract: In this paper we develop a measure-theoretic method to treat problems in hypergraph theory. Our central theorem is a correspondence principle between three objects: An increasing hypergraph sequence, a measurable set in an ultraproduct space and a measurable set in a finite dimensional Lebesgue space. Using this correspondence principle we build up the theory of dense hypergraphs from scratch. Along these lines we give new proofs for the Hypergraph Removal Lemma, the Hypergraph Regularity Lemma, the Counting Lemma and the Testability of Hereditary Hypergraph Properties. We prove various new results including a strengthening of the Regularity Lemma and an Inverse Counting Lemma. We also prove the equivalence of various notions for convergence of hypergraphs and we construct limit objects for such sequences. We prove that the limit objects are unique up to a certain family of measure preserving transformations. As our main tool we study the integral and measure theory on the ultraproduct of finite measure spaces which is interesting on its own right.
Recommendations
- Hypergraph limits: A regularity approach
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Limits of dense graph sequences
- An analytic approach to sparse hypergraphs: hypergraph removal
- Hypergraph regularity and the multidimensional Szemerédi theorem
Cites work
- scientific article; zbMATH DE number 3190627 (Why is no real title available?)
- A Note on a Question of Erdős and Graham
- A variant of the hypergraph removal lemma
- Conversion from Nonstandard to Standard Measure Spaces and Applications in Probability Theory
- Generalizations of the removal lemma
- Graph limits and parameter testing
- Limits of dense graph sequences
- Model theory.
- Moments of two-variable functions and the uniqueness of graph limits
- On Homogeneous Measure Algebras
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regularity Lemma for k-uniform hypergraphs
- Symmetries on random arrays and set-indexed processes
- Testability and repair of hereditary hypergraph properties
- The counting lemma for regular k‐uniform hypergraphs
Cited in
(50)- Uniqueness of Banach space valued graphons
- Correcting continuous hypergraphs
- Cut distance identifying graphon parameters over weak* limits
- Quasi-random graphs and graph limits
- An analytic approach to stability
- Triforce and corners
- On the maximum density of fixed strongly connected subtournaments
- Limits of kernel operators and the spectral regularity lemma
- Concentration function for pyramid and quantum metric measure space
- Density and regularity theorems for semi-algebraic hypergraphs
- Semantic limits of dense combinatorial objects
- Concentration estimates for functions of finite high‐dimensional random arrays
- scientific article; zbMATH DE number 7415089 (Why is no real title available?)
- Hypergraph limits: A regularity approach
- Arithmetic progressions, different regularity lemmas and removal lemmas
- Structural Properties of Sparse Graphs
- On possible Turán densities
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- An approximate logic for measures
- On replica symmetry of large deviations in random graphs
- Hypergraphon mean field games
- Graph limits and hereditary properties
- Two equivalent measures on weighted hypergraphs
- Random Simplicial Complexes: Models and Phenomena
- Poset limits can be totally ordered
- Limits of functions on groups
- An analytic approach to sparse hypergraphs: hypergraph removal
- Restricted problems in extremal combinatorics
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- On the limit of the positive \(\ell\)-degree Turán problem
- Relating the cut distance and the weak* topology for graphons
- Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
- Finite function spaces and measures on hypergraphs
- Differential calculus on graphon space
- First order convergence of matroids
- A tight bound for hypergraph regularity
- Weighted quasi-arithmetic mean on two-dimensional regions and their applications
- Natural quasirandomness properties
- Hyperfinite graph limits
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- An uncountable ergodic Roth theorem and applications
- On pattern-avoiding permutons
- Examples in the entropy theory of countable group actions
- Convergence and limits of finite trees
- Continuous stable regularity
- Multiple recurrence in quasirandom groups
- Limits of locally-globally convergent graph sequences
- σ-algebras for quasirandom hypergraphs
- Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds
- The inducibility of blow-up graphs
This page was built for publication: A measure-theoretic approach to the theory of dense hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456779)
