Long-range percolation mixing time

被引：14

作者：

Benjamini, Itai ^{[1
]}

Berger, Noam ^{[2
]}

Yadin, Ariel ^{[1
]}

机构：

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

[2] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA

来源：

COMBINATORICS PROBABILITY & COMPUTING | 2008年 / 17卷 / 04期

关键词：

D O I：

10.1017/S0963548308008948

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotic almost sure mixing time of the graph created by long-range percolation on the cycle of length N (Z/NZ). While it is known that the asymptotic almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2 [4, 9], the asymptotic almost sure mixing time drops from N(2) only to N(s-1) (up to poly-logarithmic factors).

引用

页码：487 / 494

页数：8

共 17 条

[1]

Alon N., 2004, The probabilistic method

[2]

Alon N., 1997, COMBINATORICS PROBAB, V6, P145, DOI DOI 10.1017/S096354839700299X

[3]

[Anonymous], REVERSIBLE MAR UNPUB

[4] On the mixing time of a simple random walk on the super critical percolation cluster [J].