Related papers: Random walk on a discrete torus and random interla…

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.

We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…

Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…

We study a class of nearest-neighbor discrete time integer random walks introduced by Zerner, the so called multi-excited random walks. The jump probabilities for such random walker have a drift to the right whose intensity depends on a…

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

The usual development of the continuous time random walk (CTRW) assumes that jumps and time intervals are a two-dimensional set of independent and identically distributed random variables. In this paper we address the theoretical setting of…

In this paper we establish some properties of percolation for the vacant set of random interlacements, for d at least 5 and small intensity u. The model of random interlacements was first introduced by A.S. Sznitman in arXiv:0704.2560. It…

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

Fix $p>1$, not necessarily integer, with $p(d-2)<d$. We study the $p$-fold self-intersection local time of a simple random walk on the lattice $\Z^d$ up to time $t$. This is the $p$-norm of the vector of the walker's local times, $\ell_t$.…

Suppose that $X$ is a simple random walk on $\Z_n^d$ for $d \geq 3$ and, for each $t$, we let $\U(t)$ consist of those $x \in \Z_n^d$ which have not been visited by $X$ by time $t$. Let $\tcov$ be the expected amount of time that it takes…

We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

We consider the problem of locating the source (starting vertex) of a simple random walk, given a snapshot of the set of edges (or vertices) visited in the first $n$ steps. Considering lattices $\mathbb{Z}^d$, in dimensions $d \geq 5$, we…

We study Aldous' conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this…

We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices $\{u,v\}$ with distance $d>1$ is added as a "long-range" edge with probability…

A functional approach for the study of the random walks in random sceneries (RWRS) is proposed. Under fairly general assumptions on the random walk and on the random scenery, functional limit theorems are proved. The method allows to study…

We investigate random walks in independent, identically distributed random sceneries under the assumption that the scenery variables satisfy Cramer's condition. We prove moderate deviation principles in dimensions two and larger, covering…

We study the range $R_n$ of a random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ indexed by a random tree with $n$ vertices. Under the assumption that the random walk is centered and has finite fourth moments, we prove in dimension…

It is well known that adding "long edges (shortcuts)" to a regularly constructed graph will make the resulted model a small world. Recently, \cite{W} indicated that, among all long edges, those edges with length proportional to the diameter…