Related papers: Subsequential scaling limits of simple random walk…
The distribution of times $t_{j,N}$ elapsed until the first $j$ independent random walkers from a set of $N \gg 1$, all starting from the same site, are trapped by a quenched configuration of traps randomly placed on a disordered lattice is…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
We consider a random walk among a Poisson cloud of moving traps on ${\mathbb Z}^d$, where the walk is killed at a rate proportional to the number of traps occupying the same position. In dimension $d=1$, we have previously shown that under…
We propose a model of a one-dimensional random walk in dynamic random environment that interpolates between two classical settings: (I) the random environment is sampled at time zero only; (II) the random environment is resampled at every…
Continuing from a companion article: 'Random walks and contracting elements I: Deviation inequality and limit laws', we study random walks on metric spaces with contracting elements. We prove that random subgroups of the isometry group of a…
We consider critical site percolation ($p=p_c=1/2$) on the triangular lattice $\mathbf{T}$ in two dimensions. We show that the simple random walk on the clusters of open vertices converges in the scaling limit to a continuous diffusion…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
In this note, we make explicit the law of the renormalized supercritical branching random walk, giving credit to a conjecture formulated in a previous works of the authors for a continuous analog of the branching random walk. Also, in the…
The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…
We have investigated the random walk problem in a finite system and studied the crossover induced in the the persistence probability scales by the system size.Analytical and numerical work show that the scaling function is an exponentially…
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.…
Motivated by the manifold hypothesis, which states that data with a high extrinsic dimension may yet have a low intrinsic dimension, we develop refined statistical bounds for entropic optimal transport that are sensitive to the intrinsic…
We consider a continuous-time random walk on a regular tree of finite depth and study its favorite points among the leaf vertices. For the walk started from a leaf vertex and stopped upon hitting the root we prove that, in the limit as as…
Random fields are commonly used for modeling of spatially (or timely) dependent stochastic processes. In this study, we provide a characterization of the intrinsic complexity of a random field in terms of its second order statistics, e.g.,…
We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…
We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…