交换随机变量与大图和超图的统计

IF 1.3 Q2 STATISTICS & PROBABILITY Probability Surveys Pub Date : 2008-01-10 DOI:10.1214/08-PS124
Tim Austin
{"title":"交换随机变量与大图和超图的统计","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":"{\"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}","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

摘要

De Finetti的经典结果[18]将可交换随机变量族的规律识别为i.i.d定律的混合物,并被Aldous[1,2,3]、Hoover[41,42]、Kallenberg[44]和Kingman[47]扩展为更复杂的可交换性概念的结构定理。另一方面,这些可交换律首先与Fremlin和Talagrand bbb的独立分析中的组合学问题有关,最近在Tao[62]中再次出现,在那里它们作为大图或超图着色的“领先阶统计量”的自然代理。此外,在最近的一些研究中,这种关系隐含地出现在处理密集图或超图序列的“极限对象”的各种定制形式的研究中,包括Lovasz和Szegedy [52], Borgs, Chayes, Lovasz, Sos, Szegedy和Vesztergombi [17], Elek和Szegedy[24]和Razborov[54,55]。然而,这些工作与早期的概率结构结果之间的联系似乎在很大程度上没有得到重视。在这篇综述中,我们回顾了交换定律理论的基本结果,然后解释了图和超图理论中由它们的联系引起的各种有趣问题的概率版本(特别是关于图和超图性质的可测试性的极端问题)。我们还将我们感兴趣的可交换性概念定位在其他类别的概率度量中,这些概率度量受各种对称性的影响,特别是将用于分析可交换律的方法与遍历理论中的相关结构结果进行对比,特别是用于概率保持的v系统的Furstenberg- zimmer结构定理,它支撑了Furstenberg对Szemeredi定理的遍历理论证明。即将发表的论文[10]将对交换定律和密集(定向)超图之间的联系做出更详细的呼吁,以建立性质测试中的各种结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On exchangeable random variables and the statistics of large graphs and hypergraphs
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Probability Surveys
Probability Surveys STATISTICS & PROBABILITY-
CiteScore
4.70
自引率
0.00%
发文量
9
期刊最新文献
Probabilistic representations of fragmentation equations L2-small ball asymptotics for Gaussian random functions: A survey Models of random subtrees of a graph Numerical methods for backward stochastic differential equations: A survey From Markov processes to semimartingales
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1