Level-set percolation of the Gaussian free field on regular graphs II: finite expanders

被引:4
|
作者
Abacherli, Angelo [1 ]
Cerny, Jiri [2 ]
机构
[1] Swiss Fed Inst Technol, Dept Math, Zurich, Switzerland
[2] Univ Basel, Dept Math & Informat, Basel, Switzerland
来源
ELECTRONIC JOURNAL OF PROBABILITY | 2020年 / 25卷
关键词
level-set percolation; Gaussian free field; regular graphs; expander graphs; RANDOM-WALK;
D O I
10.1214/20-EJP532
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We consider the zero-average Gaussian free field on a certain class of finite d-regular graphs for fixed d >= 3. This class includes d-regular expanders of large girth and typical realisations of random d-regular graphs. We show that the level set of the zero-average Gaussian free field above level h(*), exhibits a phase transition at level which agrees with the critical value for level-set percolation of the Gaussian free field on the infinite d-regular tree. More precisely, we show that, with probability tending to one as the size of the finite graphs tends to infinity, the level set above level h does not contain any connected component of larger than logarithmic size whenever h > h(*), and on the contrary, whenever h < h(*), linear fraction of the vertices is contained in connected components of the level set above level h having a size of at least a small fractional power of the total size of the graph. It remains open whether in the supercritical phase h < h(*), as the size of the graphs tends to infinity, one observes the emergence of a (potentially unique) giant connected component of the level set above level h. The proofs in this article make use of results from the accompanying paper [2].
引用
收藏
页码:1 / 39
页数:39
相关论文
共 50 条