Related papers: How large a disc is covered by a random walk in n …

We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both…

Our objective is to sample the node set of a large unknown graph via crawling, to accurately estimate a given metric of interest. We design a random walk on an appropriately defined weighted graph that achieves high efficiency by…

We study the problem of searching for a fixed path $\epsilon_0\epsilon_1\cdots\epsilon_l$ on a network through random walks. We analyze the first hitting time of tracking the path, and obtain exact expression of mean first hitting time…

We study the order statistics of a random walk (RW) of $n$ steps whose jumps are distributed according to symmetric Erlang densities $f_p(\eta)\sim |\eta|^p \,e^{-|\eta|}$, parametrized by a non-negative integer $p$. Our main focus is on…

We consider Brownian motion in a circular disk $\Omega$, whose boundary $\p\Omega$ is reflecting, except for a small arc, $\p\Omega_a$, which is absorbing. As $\epsilon=|\partial \Omega_a|/|\partial \Omega|$ decreases to zero the mean time…

We study a random walk that prefers tou se unvisited edges in the context of random cubic graphs. We establish asymptotically correct estimates for the vertex and edge cover times, these being $\approx n\log n$ and $\approx \frac32n\log n$…

Let $\{Z_n\}_{n\geq 0 }$ be a critical $d$-dimensional branching random walk started from a Poisson random measure whose intensity measure is the Lebesgue measure on $\mathbb{R}^d$. Denote by…

Let $R_n=\max_{0\leq j\leq n}S_j-S_n$ be a random walk $S_n$ reflected in its maximum. Except in the trivial case when $P(X\ge0)=1$, $R_n$ will pass over a horizontal boundary of any height in a finite time, with probability 1. We extend…

Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…

We study the number of distinct sites S_N(t) and common sites W_N(t) visited by N independent one dimensional random walkers, all starting at the origin, after t time steps. We show that these two random variables can be mapped onto extreme…

Let $G$ be a connected simple real Lie group, $\Lambda_{0}\subseteq G$ a lattice and $\Lambda \unlhd \Lambda_{0}$ a normal subgroup such that $\Lambda_{0}/\Lambda\simeq \mathbb{Z}^d$. We study the drift of a random walk on the…

The $n$ queens problem considers the maximum number of safe squares on an $n \times n$ chess board when placing $n$ queens; the answer is only known for small $n$. Miller, Sheng and Turek considered instead $n$ randomly placed rooks,…

We consider large deviations of the cover time of the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, $d \geq 3$ by simple random walk. We prove a lower bound on the probability that the cover time is smaller than $\gamma\in (0,1)$ times its…

We consider a special case of random walk in random environment (RWRE) on Z^d where the environment is periodic (RWPE). Under natural conditions, we show that law of large numbers and central limit theorem holds. In the ballistic nearest…

We study the cover time of random walk on dynamical percolation on the torus $\mathbb{Z}_n^d$ in the subcritical regime. In this model, introduced by Peres, Stauffer and Steif, each edge updates at rate $\mu$ to open with probability $p$…

Rotor walk is a deterministic analogue of random walk. We study its recurrence and transience properties on Z^d for the initial configuration of all rotors aligned. If n particles in turn perform rotor walks starting from the origin, we…

We consider a random walk in a random environment (RWRE) on the strip of finite width $\mathbb{Z} \times \{1,2,\ldots,d\}$. We prove both quenched and averaged large deviation principles for the position and the hitting times of the RWRE.…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…