{"title":"upt上场地渗透的概率和临界指数","authors":"Laurent M'enard","doi":"10.4153/S0008414X22000554","DOIUrl":null,"url":null,"abstract":"Abstract We derive three critical exponents for Bernoulli site percolation on the uniform infinite planar triangulation (UIPT). First, we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the off-critical exponent for site percolation on the UIPT is \n$\\beta = 1/2$\n . Then we establish an integral formula for the generating function of the number of vertices in the root cluster. We use this formula to prove that, at criticality, the probability that the root cluster has at least n vertices decays like \n$n^{-1/7}$\n . Finally, we also derive an expression for the law of the perimeter of the root cluster and use it to establish that, at criticality, the probability that the perimeter of the root cluster is equal to n decays like \n$n^{-4/3}$\n . Among these three exponents, only the last one was previously known. Our main tools are the so-called gasket decomposition of percolation clusters, generic properties of random Boltzmann maps, and analytic combinatorics.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Percolation probability and critical exponents for site percolation on the UIPT\",\"authors\":\"Laurent M'enard\",\"doi\":\"10.4153/S0008414X22000554\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We derive three critical exponents for Bernoulli site percolation on the uniform infinite planar triangulation (UIPT). First, we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the off-critical exponent for site percolation on the UIPT is \\n$\\\\beta = 1/2$\\n . Then we establish an integral formula for the generating function of the number of vertices in the root cluster. We use this formula to prove that, at criticality, the probability that the root cluster has at least n vertices decays like \\n$n^{-1/7}$\\n . Finally, we also derive an expression for the law of the perimeter of the root cluster and use it to establish that, at criticality, the probability that the perimeter of the root cluster is equal to n decays like \\n$n^{-4/3}$\\n . Among these three exponents, only the last one was previously known. Our main tools are the so-called gasket decomposition of percolation clusters, generic properties of random Boltzmann maps, and analytic combinatorics.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2022-01-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.4153/S0008414X22000554\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4153/S0008414X22000554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Percolation probability and critical exponents for site percolation on the UIPT
Abstract We derive three critical exponents for Bernoulli site percolation on the uniform infinite planar triangulation (UIPT). First, we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the off-critical exponent for site percolation on the UIPT is
$\beta = 1/2$
. Then we establish an integral formula for the generating function of the number of vertices in the root cluster. We use this formula to prove that, at criticality, the probability that the root cluster has at least n vertices decays like
$n^{-1/7}$
. Finally, we also derive an expression for the law of the perimeter of the root cluster and use it to establish that, at criticality, the probability that the perimeter of the root cluster is equal to n decays like
$n^{-4/3}$
. Among these three exponents, only the last one was previously known. Our main tools are the so-called gasket decomposition of percolation clusters, generic properties of random Boltzmann maps, and analytic combinatorics.