Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The Speed of Simple ...
Conference paper

The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview

Dayue Chen (1), Yuval Peres (2)
(1) School of Mathematics and Physics [Beijing]
(2) Department of Statistics [Berkeley]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2002
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Proceedings
DOI
10.46298/dmtcs.3340
License
https://about.hal.science/hal-authorisation-v1
Indicators
758
Views
658
Downloads

The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview

Dayue Chen (1), Yuval Peres (2)
(1) School of Mathematics and Physics [Beijing]
(2) Department of Statistics [Berkeley]
Abstract
Benjamini, Lyons and Schramm (1999) considered properties of an infinite graph $G$, and the simple random walk on it, that are preserved by random perturbations. To address problems raised by those authors, we study simple random walk on the infinite percolation cluster in Cayley graphs of certain amenable groups known as "lamplighter groups''.We prove that zero speed for random walk on a lamplighter group implies zero speed for random walk on an infinite cluster, for any supercritical percolation parameter $p$. For $p$ large enough, we also establish the converse. We prove that if $G$ has a positive anchored expansion constant then so does every infinite cluster of independent percolation with parameter $p$ sufficiently close to 1; We also show that positivity of the anchored expansion constant is preserved under a random stretch if, and only if, the stretching law has an exponential tail.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • Cayley graphs
  • percolation
  • random walks
  • speed
  • anchored expansion constant.
Preview
Loading PDF preview...