{"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":55284,"journal":{"name":"Canadian Journal of Mathematics-Journal Canadien De Mathematiques","volume":"138 1","pages":"1869 - 1903"},"PeriodicalIF":0.6000,"publicationDate":"2022-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Canadian Journal of Mathematics-Journal Canadien De Mathematiques","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4153/S0008414X22000554","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
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
$\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.
期刊介绍:
The Canadian Journal of Mathematics (CJM) publishes original, high-quality research papers in all branches of mathematics. The Journal is a flagship publication of the Canadian Mathematical Society and has been published continuously since 1949. New research papers are published continuously online and collated into print issues six times each year.
To be submitted to the Journal, papers should be at least 18 pages long and may be written in English or in French. Shorter papers should be submitted to the Canadian Mathematical Bulletin.
Le Journal canadien de mathématiques (JCM) publie des articles de recherche innovants de grande qualité dans toutes les branches des mathématiques. Publication phare de la Société mathématique du Canada, il est publié en continu depuis 1949. En ligne, la revue propose constamment de nouveaux articles de recherche, puis les réunit dans des numéros imprimés six fois par année.
Les textes présentés au JCM doivent compter au moins 18 pages et être rédigés en anglais ou en français. C’est le Bulletin canadien de mathématiques qui reçoit les articles plus courts.