A measure-theoretic approach to the theory of dense hypergraphs

被引:43
作者
Elek, Gabor [1 ]
Szegedy, Balazs [2 ]
机构
[1] Hungarian Acad Sci, Alfred Renyi Inst, H-1364 Budapest, Hungary
[2] Univ Toronto, Dept Math, Toronto, ON M5R 2E4, Canada
关键词
Hypergraphs; Regularity lemma; Limit objects; Property testing; LEMMA;
D O I
10.1016/j.aim.2012.06.022
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 hypereraphs 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 utraproduct of finite measure spaces which is interesting on its own right. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:1731 / 1772
页数:42
相关论文
共 18 条
[1]  
[Anonymous], 1990, STUDIES LOGIC FDN MA
[2]  
Austin T., 2010, RANDOM STRUCT ALGOR, V36
[3]   On exchangeable random variables and the statistics of large graphs and hypergraphs [J].
Austin, Tim .
PROBABILITY SURVEYS, 2008, 5 :80-145
[4]  
Borgs C., 2006, STOC'06. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, P261, DOI 10.1145/1132516.1132556
[5]   MOMENTS OF TWO-VARIABLE FUNCTIONS AND THE UNIQUENESS OF GRAPH LIMITS [J].
Borgs, Christian ;
Chayes, Jennifer ;
Lovasz, Laszlo .
GEOMETRIC AND FUNCTIONAL ANALYSIS, 2010, 19 (06) :1597-1619
[6]   Quasirandomness, counting and regularity for 3-uniform hypergraphs [J].
Gowers, WT .
COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (1-2) :143-184
[7]  
Halmos P. R., 1950, Measure Theory
[8]  
Ishigami Y., SIMPLE REGULAR UNPUB
[9]  
Kallenberg O, 1992, J. Theoret. Probab., V5, P727, DOI DOI 10.1007/BF01058727
[10]   CONVERSION FROM NONSTANDARD TO STANDARD MEASURE SPACES AND APPLICATIONS IN PROBABILITY THEORY [J].
LOEB, PA .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 211 (OCT) :113-122