Related papers: The loop-erased random walk and the uniform spanni…
We consider the branching capacity of the range of a simple random walk on $\mathbb Z^d$, with $d \ge 5$, and show that it falls in the same universality class as the volume and the capacity of the range of simple random walks and branching…
The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the…
For $d\ge 3$ we construct a new coupling of the trace left by a random walk on a large $d$-dimensional discrete torus with the random interlacements on $\mathbb Z^d$. This coupling has the advantage of working up to macroscopic subsets of…
We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…
The random split tree introduced by Devroye (1999) is considered. We derive a second order expansion for the mean of its internal path length and furthermore obtain a limit law by the contraction method. As an assumption we need the…
In this paper we study extreme events for random walks on homogeneous spaces. We consider the following three cases. On the torus we study closest returns of a random walk to a fixed point in the space. For a random walk on the space of…
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…
We consider one or more independent random walks on the $d\ge 3$ dimensional discrete torus. The walks start from vertices chosen independently and uniformly at random. We analyze the fluctuation behavior of the size of some random sets…
Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…
We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…
Self-avoiding walks (SAWs) and loop-erased random walks (LERWs) are two ensembles of random paths with numerous applications in mathematics, statistical physics and quantum field theory. While SAWs are described by the $n \to 0$ limit of…
We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…
We prove distributional limit theorems for the length of the largest convex minorant of a one-dimensional random walk with independent identically distributed increments. Depending on the increment law, there are several regimes with…
We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the…