中文
相关论文

相关论文: Anchored expansion, percolation and speed

200 篇论文

Given a finite-range random walk on a finitely generated free group , what is the asymptotic behaviour, as the number of steps goes to infinity, of the sequence of probabilities that the random walk is at a given element of the group? In…

概率论 · 数学 2025-07-22 Guillaume Chevalier

In this paper, we give a detailed construction of an example of excited random walk with speed zero in an ergodic random environment that have an infinite average number of cookies in each site. This example confirms that a result of…

概率论 · 数学 2019-09-10 Rafael Santos

We conjecture that finite graphs with positive Cheeger constant admit a spanning subgraph with positive Cheeger constant and girth proportional to the diameter. We prove this conjecture for regular expander graphs with large expansion. Our…

组合数学 · 数学 2021-12-04 Itai Benjamini , Mikolaj Fraczyk , Gabor Kun

Consider a closed surface $M$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $M$ with finite first moment. Corresponding to each point in the Teichm\"uller space of $M$, there is an…

On the complete graph ${\cal{K}}_M$ with $M \ge3$ vertices consider two independent discrete time random walks $\mathbb{X}$ and $\mathbb{Y}$, choosing their steps uniformly at random. A pair of trajectories $\mathbb{X} = \{ X_1, X_2, \dots…

概率论 · 数学 2014-11-17 Riddhipratim Basu , Vladas Sidoravicius , Allan Sly

We consider a random walk in an i.i.d. Cauchy-tailed conductances environment. We obtain a quenched functional CLT for the suitably rescaled random walk, and, as a key step in the arguments, we improve the local limit theorem for…

概率论 · 数学 2010-10-18 Martin T. Barlow , Xinghua Zheng

We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…

概率论 · 数学 2018-08-10 Jan-Erik Lübbers , Matthias Meiners

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

数据结构与算法 · 计算机科学 2024-06-04 Vedat Levi Alev , Shravas Rao

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

概率论 · 数学 2019-07-29 Tom Hutchcroft

Let Z_N be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Z^d with parameter p>p_c(Z^d). The object of this paper is to study the connective…

概率论 · 数学 2013-06-27 Hubert Lacoin

This is the third in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

离散数学 · 计算机科学 2019-11-14 Joel Friedman , David Kohler

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

概率论 · 数学 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey

We prove an invariance principle for the bridge of a random walk conditioned to stay positive, when the random walk is in the domain of attraction of a stable law, both in the discrete and in the absolutely continuous setting. This includes…

概率论 · 数学 2012-10-10 Francesco Caravenna , Loïc Chaumont

We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the Poisson Voronoi triangulation in the plane.…

概率论 · 数学 2021-06-22 Gourab Ray , Tingzhou Yu

We study biased random walks on dynamical percolation in $\mathbb{Z}^d$, which were recently introduced by Andres et al. We provide a second order expansion for the asymptotic speed and show for $d \ge 2$ that the speed of the biased random…

概率论 · 数学 2025-02-13 Assylbek Olzhabayev , Dominik Schmid

We establish annealed and quenched invariance principles for random walks in random conductances lifted to the p-variation rough path topology, allowing for degenerate environments and long-range jumps. Our proof is based on a unified…

概率论 · 数学 2026-04-17 Johannes Bäumler , Noam Berger , Tal Orenshtein , Martin Slowik

We study random walks on supercritical percolation clusters on wedges in $\Z^3$, and show that the infinite percolation cluster is (a.s.) transient whenever the wedge is transient. This solves a question raised by O. Haggstrom and E.…

概率论 · 数学 2007-05-23 Omer Angel , Itai Benjamini , Noam Berger , Yuval Peres

Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…

概率论 · 数学 2010-02-16 Nina Gantert , Yueyun Hu , Zhan Shi

Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…

概率论 · 数学 2025-09-30 George Andriopoulos

We study site percolation on Angel & Schramm's uniform infinite planar triangulation. We compute several critical and near-critical exponents, and describe the scaling limit of the boundary of large percolation clusters in all regimes…

概率论 · 数学 2018-02-19 Nicolas Curien , Igor Kortchemski