PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 23, 2026Potential Analysis1 citationsOpen Access

Solidification Estimates for Random Walks on Supercritical Percolation Clusters

View Full Paper
ACAlberto ChiariniZLZhizhou LiuMNMaximilian Nitzschner

Key Points

  • The research investigates how random walks behave on supercritical percolation clusters in higher dimensions.
  • Analyzed random walks in the context of infinite percolation clusters on $0 3$ Z^d$
  • Established controls on absorption probabilities using porous interfaces around compact sets.
  • Generalized previous results by considering various percolation models beyond standard settings.
  • Demonstrated uniform control on absorption probabilities for random walks in supercritical percolation.
  • Found that these controls apply to a broader class of percolation models, including those with strong correlations.
  • Showed significant generalization from previous results on Brownian motion and random walks.

Abstract

Abstract We consider the simple random walk on the infinite cluster of a general class of percolation models on Zᵈ Z d, d 3 d ≥ 3, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost every realization of the percolation configuration, we obtain uniform controls on the absorption probability of a random walk by certain “porous interfaces” surrounding the discrete blow-up of a compact set A. These controls substantially generalize previous results obtained in Nitzschner and Sznitman (J. Eur. Math. Soc. (JEMS) 22 (8), 2629–2672, 2020) for Brownian motion in Rᵈ R d and in Chiarini and Nitzschner (Comm. Math. Phys. 386 (3), 1685–1745, 2021) for random walks on Zᵈ Z d equipped with uniformly elliptic edge weights to a manifestly non-elliptic framework.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Chiarini et al. (2026) studied this question.

synapsesocial.com/papers/69e9b8d485696592c86ebd6chttps://doi.org/10.1007/s11118-026-10287-8
Ask AI
Helpful
Bookmark
Share
View Full Paper