Related papers: Extracting subsets maximizing capacity and Folding…

We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. We prove an invariance principle (functional central limit theorem) under almost every fixed environment. The…

In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is $\mathrm{SO}(2,1)$ or $\mathrm{SO}(3,1)$ and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense…

We study branching random walk on $\mathbb{Z}$ in a bounded i.i.d. random environment. For this process, we prove that, for almost every realization of the environment, the distributions of the maximally displaced particle (re-centered…

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

In proving large deviation estimates, the lower bound for open sets and upper bound for compact sets are essentially local estimates. On the other hand, the upper bound for closed sets is global and compactness of space or an exponential…

Let $G$ be a finitely generated group of polynomial volume growth equipped with a word-length $|\cdot|$. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures $\mu$ such that, for…

We study the scaling limit of the capacity of the range of a simple random walk on the integer lattice in dimension four. We establish a strong law of large numbers and a central limit theorem with a non-gaussian limit. The asymptotic…

We consider a particle moving in a one dimensional potential which has a symmetric deterministic part and a quenched random part. We study analytically the probability distributions of the local time (spent by the particle around its mean…

Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…

We prove Gaussian concentration inequalities for maximal displacement of compactly supported random walks on a compactly generated locally compact group with polynomial growth. Concentration inequalities with different exponents hold for…

We consider random walks in i.i.d. elliptic random environments which are not uniformly elliptic. We introduce a computable condition in dimension $d=2$ and a general condition valid for dimensions $d\ge 2$ expressed in terms of the exit…

Consider a supercritical branching random walk on the real line. The consistent maximal displacement is the smallest of the distances between the trajectories followed by individuals at the $n$th generation and the boundary of the process.…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

We consider the problem of wrapping three-dimensional solid bodies with a given planar sheet of paper, where the paper may be folded or wrinkled but not stretched or torn. We propose a conjecture characterising the maximumvolume solid…

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…

We consider a simple random walk on a discrete torus (Z/NZ)^d with dimension d at least 3 and large side length N. For a fixed constant u > 0, we study the percolative properties of the vacant set, consisting of the set of vertices not…

We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…

We consider a random walk on a second countable locally compact topological space endowed with an invariant Radon measure. We show that if the walk is symmetric and if every subset which is invariant by the walk has zero or infinite…