Ergodic theory on stationary random graphs

被引：50

作者：

Benjamini, Itai ^{[1
]}

Curien, Nicolas ^{[2
]}

机构：

[1] Weizmann Inst Sci, IL-76100 Rehovot, Israel

[2] Dma Ens, F-75005 Paris, France

来源：

ELECTRONIC JOURNAL OF PROBABILITY | 2012年 / 17卷

关键词：

Stationary random graph; Simple random walk; Ergodic Theory; Entropy; Liouville Property; LONG-RANGE PERCOLATION; RANDOM-WALKS; INVARIANT PERCOLATION; HARMONIC-FUNCTIONS; TREES; GROWTH; PLANAR; QUADRANGULATION; HOMOGENIZATION; DIMENSION;

D O I：

10.1214/EJP.v17-2401

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random graphs of subexponential growth are almost surely Liouville, that is, admit no non constant bounded harmonic functions. Applications include the uniform infinite planar quadrangulation and long-range percolation clusters.

引用

页码：1 / 20

页数：20

共 38 条

[1]

Cuesta FA, 2011, MONATSH MATH, V163, P389, DOI 10.1007/s00605-010-0230-z

[2] Processes on unimodular random networks [J].