Related papers: Repeated bond traversal probabilities for the simp…

We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…

We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…

We provide a decomposition of the trace of the Brownian motion into a simple path and an independent Brownian soup of loops that intersect the simple path. More precisely, we prove that any subsequential scaling limit of the loop erased…

We consider a biased nearest-neighbor random walk on $\Z$ which at each step is trapped for some random time with random, site-dependent mean. We derive a simple formula for the speed function in terms of the model parameters.

In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…

Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…

We present analytical results for the distribution of cover times of random walks (RWs) on random regular graphs consisting of $N$ nodes of degree $c$ ($c \ge 3$). Starting from a random initial node at time $t=1$, at each time step $t \ge…

We employ a simple and accurate dimensional interpolation formula for the shapes of random walks at $D=3$ and $D=2$ based on the analytically known solutions at both limits $D=\infty$ and $D=1$. The results obtained for the radii of…

The elephant random walk (ERW) is a microscopic, one-dimensional, discrete-time, non-Markovian random walk, which can lead to anomalous diffusion due to memory effects. In this study, I propose a multi-dimensional generalization in which…

We establish both the $\limsup$ and the $\liminf$ law of the iterated logarithm (LIL), for the capacity of the range of a simple random walk in any dimension $d\ge 3$. While for $d \ge 4$, the order of growth in $n$ of such LIL at dimension…

The probability of a random walker to return to its starting point in dimensions one and two is unity, a theorem first proven by G. Polya. The recurrence probability -- the probability to be found at the origin at a time t, is a power law…

Let $(Y_n)$ be a sequence of i.i.d. real valued random variables. Reflected random walk $(X_n)$ is defined recursively by $X_0=x \ge 0$, $X_{n+1} = |X_n - Y_{n+1}|$. In this note, we study recurrence of this process, extending a previous…

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 consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…

We study records generated by Brownian particles in one dimension. Specifically, we investigate an ordinary random walk and define the record as the maximal position of the walk. We compare the record of an individual random walk with the…

We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

We consider the use of random walks as an approach to obtain connection coefficients for higher-order Bernoulli and Euler polynomials. In particular, we consider the cases of a $1$-dimensional linear reflected Brownian motion and of a…