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

The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows,…

For a univalent smooth mapping $f$ of the unit disk $\ID$ of complex plane onto the manifold $f(\ID)$, let $d_f(z_0)$ be the radius of the largest univalent disk on the manifold $f(\ID)$ centered at $f(z_0)$ ($|z_0|<1$). The main aim of the…

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 consider a random walk on the fully-connected lattice with $N$ sites and study the time evolution of the number of distinct sites $s$ visited by the walker on a subset with $n$ sites. A record value $v$ is obtained for $s$ at a record…

Activated Random Walk (ARW) is an interacting particle system on the $d$-dimensional lattice $\mathbb{Z}^d$. On a finite subset $V \subset \mathbb{Z}^d$ it defines a Markov chain on $\{0,1\}^V$. We prove that when $V$ is a Euclidean ball…

We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range $(2,3)$. In particular, we first focus on the expected time for a…

We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…

We study a $d$-dimensional branching random walk (BRW) in an i.i.d. random environment on $\mathbb{Z}^d$ in discrete time. A Bernoulli trap field is attached to $\mathbb{Z}^d$, where each site, independently of the others, is a trap with a…

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

We consider a discrete-time random motion, Markov chain on the Poincar\'{e} disk. In the basic variant of the model a particle moves along certain circular arcs within the disk, its location is determined by a composition of random…

It is widely believed that the scaling limit of self-avoiding walks (SAWs) at the critical temperature is (i) conformally invariant, and (ii) describable by Schramm-Loewner Evolution (SLE) with parameter $\kappa = 8/3.$ We consider SAWs in…

We study the circumradius of the intersection of an $m$-dimensional ellipsoid $\mathcal E$ with semi-axes $\sigma_1\geq\dots\geq \sigma_m$ with random subspaces of codimension $n$. We find that, under certain assumptions on $\sigma$, this…

Starting from a continuous time random walk (CTRW) model of particles that may evanesce as they walk, our goal is to arrive at macroscopic integro-differential equations for the probability density for a particle to be found at point r at…

As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…

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

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…

A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…

It is shown that statistics of records for time series generated by random walks are independent of the details of the jump distribution, as long as the latter is continuous and symmetric. In N steps, the mean of the record distribution…

We study the statistics of the number of records R_{n,N} for N identical and independent symmetric discrete-time random walks of n steps in one dimension, all starting at the origin at step 0. At each time step, each walker jumps by a…