相关论文: Anchored expansion, percolation and speed

We consider a random walk in an i.i.d. non-negative potential on the d-dimensional integer lattice. The walk starts at the origin and is conditioned to hit a remote location y on the lattice. We prove that the expected time under the…

Lower bound on the equivariant Hilbertian compression exponent $\alpha$ are obtained using random walks. More precisely, if the probability of return of the simple random walk is $\succeq \textrm{exp}(-n^\gamma)$ in a Cayley graph then…

What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a…

This thesis concerns the study of random walks in random environments (RWRE). Since there are two levels of randomness for random walks in random environments, there are two different distributions for the random walk that can be studied.…

We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, $p^{(n)}(v,w)\leq C…

Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…

Families of symmetric simple random walks on Cayley graphs of Abelian groups with a bound on the number of generators are shown to never have sharp cut off in the sense of [1], [3], or [5]. Here convergence to the stationary distribution is…

Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…

We study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit…

Random Walks in Dirichlet Environment (RWDE) correspond to Random Walks in Random Environment (RWRE) on $\Bbb{Z}^d$ where the transition probabilities are i.i.d. at each site with a Dirichlet distribution. Hence, the model is parametrized…

Consider a discrete-time simple random walk $(X_t)_{t\ge 0}$ on an infinite, connected, locally finite graph $G$. Let $R_t := |\{X_0,\dots,X_t\}|$ denote its range at time $t$, and $T_n:=\inf\{t\ge 0: R_t= n\}$ the $n-$th discovery time. We…

We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…

We study homogenization properties of the discrete Laplace operator with random conductances on a large domain in $\mathbb{Z}^d$. More precisely, we prove almost-sure homogenization of the discrete Poisson equation and of the top of the…

We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our…

We show that Internal Diffusion Limited Aggregation (IDLA) on $\mathbb{Z}^d$ has near optimal Cheeger constant when the growing cluster is large enough. This implies, through a heat kernel lower bound derived previously in [H], that simple…

We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-\alpha}$ with $\alpha>0$.…

We study self-avoiding walks on three-dimensional critical percolation clusters using a new exact enumeration method. It overcomes the exponential increase in computation time by exploiting the clusters' fractal nature. We enumerate walks…

We show that the Plancherel measure of the lamplighter random walk on a graph coincides with the expected spectral measure of the absorbing random walk on the Bernoulli percolation clusters. In the subcritical regime the spectrum is pure…

On a transient weighted graph, there are two models of random walk which continue after reaching infinity: random interlacements, and random walk reflected off of infinity, recently introduced in arXiv:2506.18827 [math.PR]. We prove these…

Using a general Green function formulation, we re-derive, both, (i) Spitzer and his followers results for the winding angle distribution of the planar Brownian motion, and (ii) Edwards-Prager-Frisch results on the statistical mechanics of a…