{"title":"On exchangeable random variables and the statistics of large graphs and hypergraphs","authors":"Tim Austin","doi":"10.1214/08-PS124","DOIUrl":null,"url":null,"abstract":"De Finetti’s classical result of [18] identifying the law of an \nexchangeable family of random variables as a mixture of i.i.d. laws was \nextended to structure theorems for more complex notions of exchangeability \nby Aldous [1, 2, 3], Hoover [41, 42], Kallenberg [44] and Kingman [47]. On \nthe other hand, such exchangeable laws were first related to questions from \ncombinatorics in an independent analysis by Fremlin and Talagrand [29], \nand again more recently in Tao [62], where they appear as a natural proxy \nfor the ‘leading order statistics’ of colourings of large graphs or hypergraphs. Moreover, this relation appears implicitly in the study of various \nmore bespoke formalisms for handling ‘limit objects’ of sequences of dense \ngraphs or hypergraphs in a number of recent works, including Lovasz and \nSzegedy [52], Borgs, Chayes, Lovasz, Sos, Szegedy and Vesztergombi [17], \nElek and Szegedy [24] and Razborov [54, 55]. However, the connection between these works and the earlier probabilistic structural results seems to \nhave gone largely unappreciated. \n \nIn this survey we recall the basic results of the theory of exchangeable \nlaws, and then explain the probabilistic versions of various interesting questions from graph and hypergraph theory that their connection motivates \n(particularly extremal questions on the testability of properties for graphs \nand hypergraphs). \n \nWe also locate the notions of exchangeability of interest to us in the \ncontext of other classes of probability measures subject to various symmetries, in particular contrasting the methods employed to analyze exchangeable laws with related structural results in ergodic theory, particular the Furstenberg-Zimmer structure theorem for probability-preserving \nℤ-systems, which underpins Furstenberg’s ergodic-theoretic proof of Szemeredi’s Theorem. \n \nThe forthcoming paper [10] will make a much more elaborate appeal to \nthe link between exchangeable laws and dense (directed) hypergraphs to \nestablish various results in property testing.","PeriodicalId":46216,"journal":{"name":"Probability Surveys","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2008-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"127","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Probability Surveys","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1214/08-PS124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 127
Abstract
De Finetti’s classical result of [18] identifying the law of an
exchangeable family of random variables as a mixture of i.i.d. laws was
extended to structure theorems for more complex notions of exchangeability
by Aldous [1, 2, 3], Hoover [41, 42], Kallenberg [44] and Kingman [47]. On
the other hand, such exchangeable laws were first related to questions from
combinatorics in an independent analysis by Fremlin and Talagrand [29],
and again more recently in Tao [62], where they appear as a natural proxy
for the ‘leading order statistics’ of colourings of large graphs or hypergraphs. Moreover, this relation appears implicitly in the study of various
more bespoke formalisms for handling ‘limit objects’ of sequences of dense
graphs or hypergraphs in a number of recent works, including Lovasz and
Szegedy [52], Borgs, Chayes, Lovasz, Sos, Szegedy and Vesztergombi [17],
Elek and Szegedy [24] and Razborov [54, 55]. However, the connection between these works and the earlier probabilistic structural results seems to
have gone largely unappreciated.
In this survey we recall the basic results of the theory of exchangeable
laws, and then explain the probabilistic versions of various interesting questions from graph and hypergraph theory that their connection motivates
(particularly extremal questions on the testability of properties for graphs
and hypergraphs).
We also locate the notions of exchangeability of interest to us in the
context of other classes of probability measures subject to various symmetries, in particular contrasting the methods employed to analyze exchangeable laws with related structural results in ergodic theory, particular the Furstenberg-Zimmer structure theorem for probability-preserving
ℤ-systems, which underpins Furstenberg’s ergodic-theoretic proof of Szemeredi’s Theorem.
The forthcoming paper [10] will make a much more elaborate appeal to
the link between exchangeable laws and dense (directed) hypergraphs to
establish various results in property testing.