Hypergraph limits: A regularity approach

A sequence of k-uniform hypergraphs H1,H2,' is convergent if the sequence of homomorphism densities tF,H1,tF,H2,' converges for every k-uniform hypergraph F. For graphs, Lovasz and Szegedy showed that every convergent sequence has a limit in the form of a symmetric measurable function W:[0,1]2i¾?[0,1]. For hypergraphs, analogous limits W:[0,1]2k-2i¾?[0,1] were constructed by Elek and Szegedy using ultraproducts. These limits had also been studied earlier by Hoover, Aldous, and Kallenberg in the setting of exchangeable random arrays. In this paper, we give a new proof and construction of hypergraph limits. Our approach is inspired by the original approach of Lovasz and Szegedy, with the key ingredient being a weak Frieze-Kannan type regularity lemma. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 205-226, 2015

[1]  David Aldous,et al.  Exchangeability and Continuum Limits of Discrete Random Structures , 2011 .

[2]  G'abor Elek,et al.  A measure-theoretic approach to the theory of dense hypergraphs , 2008, 0810.4062.

[3]  V. Sós,et al.  GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS , 2008 .

[4]  Olav Kallenberg,et al.  Symmetries on random arrays and set-indexed processes , 1992 .

[5]  D. Aldous.  Representations for partially exchangeable arrays of random variables , 1981 .

[6]  Bal'azs Szegedy,et al.  Limits of compact decorated graphs , 2010, 1010.5155.

[7]  Terence Tao.  A variant of the hypergraph removal lemma , 2006, J. Comb. Theory, Ser. A.

[8]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[9]  B. Szegedy,et al.  Szemerédi’s Lemma for the Analyst , 2007 .

[10]  M. Bálek,et al.  Large Networks and Graph Limits , 2022 .

[11]  Terence Tao,et al.  A Correspondence Principle between (hyper)graph Theory and Probability Theory, and the (hyper)graph Removal Lemma , 2006 .

[12]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[13]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[14]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[15]  V. Sós,et al.  Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics , 2012 .

[16]  W. T. Gowers,et al.  Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.

[17]  Vojtech Rödl,et al.  The counting lemma for regular k‐uniform hypergraphs , 2006, Random Struct. Algorithms.

[18]  Fan Chung,et al.  Regularity lemmas for hypergraphs and quasi-randomness , 1991 .

[19]  Tim Austin.  On exchangeable random variables and the statistics of large graphs and hypergraphs , 2008, 0801.1698.