{"title":"多项式增长图渗流的局部性","authors":"D. Contreras, S'ebastien Martineau, V. Tassion","doi":"10.1214/22-ecp508","DOIUrl":null,"url":null,"abstract":"Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive graphs with polynomial growth. Our proof relies on two recent works about such graphs, namely supercritical sharpness of percolation by the same authors and a finitary structure theorem by Tessera and Tointon.","PeriodicalId":50543,"journal":{"name":"Electronic Communications in Probability","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Locality of percolation for graphs with polynomial growth\",\"authors\":\"D. Contreras, S'ebastien Martineau, V. Tassion\",\"doi\":\"10.1214/22-ecp508\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive graphs with polynomial growth. Our proof relies on two recent works about such graphs, namely supercritical sharpness of percolation by the same authors and a finitary structure theorem by Tessera and Tointon.\",\"PeriodicalId\":50543,\"journal\":{\"name\":\"Electronic Communications in Probability\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2022-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Communications in Probability\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1214/22-ecp508\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Communications in Probability","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1214/22-ecp508","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
Locality of percolation for graphs with polynomial growth
Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive graphs with polynomial growth. Our proof relies on two recent works about such graphs, namely supercritical sharpness of percolation by the same authors and a finitary structure theorem by Tessera and Tointon.
期刊介绍:
The Electronic Communications in Probability (ECP) publishes short research articles in probability theory. Its sister journal, the Electronic Journal of Probability (EJP), publishes full-length articles in probability theory. Short papers, those less than 12 pages, should be submitted to ECP first. EJP and ECP share the same editorial board, but with different Editors in Chief.