Related papers: Anchored expansion, percolation and speed
We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…
Consider a closed surface $S$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $S$ with finite first moment with respect to some hyperbolic metric on $S$. Corresponding to each point in…
Steady statistics of a passive scalar advected by a random two-dimensional flow of an incompressible fluid is described in the range of scales between the correlation length of the flow and the diffusion scale. That corresponds to the…
Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We consider discrete Gaussian free fields with ergodic random conductances on a class of random subgraphs of $\mathbb{Z}^{d}$, $d \geq 2$, including i.i.d.\ supercritical percolation clusters, where the conductances are possibly unbounded…
Inspired by Benjamini et al (Ann. Inst. H. Poincar\'{e} Probab. Stat. 2010) and Windisch (Electron. J. Probab. 2010), we consider the entropy of the random walk range formed by a simple random walk on a discrete group. It is shown in this…
We give a "direct" coupling proof of strict monotonicity of the speed for 1-dimensional multi-excited random walks with positive speed. This reproves (and extends) a recent result of Peterson without using branching processes.
We consider random walks in a random environment of the type p_0+\gamma\xi_z, where p_0 denotes the transition probabilities of a stationary random walk on \BbbZ^d, to nearest neighbors, and \xi_z is an i.i.d. random perturbation. We give…
We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…
We study asymptotic properties of the Green metric associated with transient random walks on countable groups. We prove that the rate of escape of the random walk computed in the Green metric equals its asymptotic entropy. The proof relies…
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…
We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…
It has been recently understood (arXiv:1212.2885, arXiv:1310.4764, arXiv:1410.0605) that for a general class of percolation models on $\mathbb{Z}^d$ satisfying suitable decoupling inequalities, which includes i.a.\ Bernoulli percolation,…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
We show that the local weak limit of a sequence of finite expander graphs with uniformly bounded degree is an ergodic (or extremal) unimodular random graph. In particular, the critical probability of percolation of the limiting random graph…
We establish mild conditions under which a possibly irregular, sparse graph $G$ has "many" strong orientations. Given a graph $G$ on $n$ vertices, orient each edge in either direction with probability $1/2$ independently. We show that if…
Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…
The universal law for percolation thresholds proposed by Galam and Mauger (GM) is found to apply also to dynamical situations. This law depends solely on two variables, the space dimension d and a coordinance numberq. For regular lattices,…