Related papers: Poissonization-based collision threshold derivatio…

In this work we study asymptotic properties of a long range memory random walk known as elephant random walk. First we prove recurrence and positive recurrence for the elephant random walk. Then, we establish the transience regime of the…

We consider the partially asymmetric simple exclusion process (PASEP) when its steady-state probability distribution function can be written in terms of a linear superposition of product measures with a finite number of shocks. In this case…

We suggest a new hardcore Poisson-type distribution for Young diagrams with the row lengths from some finite list. A discrete variant of the time-ordered Mat\'{e}rn II process in 1D is employed. This approach is related to that based on the…

For one-dimensional simple random walk in a general i.i.d. scenery and its limiting process we construct a coupling with explicit rate of approximation extending a recent result for Gaussian sceneries due to Khoshnevisan and Lewis.…

In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of lattice, we derive an explicit expression for the…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

We consider the random walk on a simple point process on $\Bbb{R}^d$, $d\geq2$, whose jump rates decay exponentially in the $\alpha$-power of jump length. The case $\alpha =1$ corresponds to the phonon-induced variable-range hopping in…

The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…

It is well known that random walks in one dimensional random environment can exhibit subdiffusive behavior due to presence of traps. In this paper we show that the passage times of different traps are asymptotically independent exponential…

Consider a random walk $S_i= \xi_1+\ldots+\xi_i$, $i\in\mathbb N$, whose increments $\xi_1,\xi_2,\ldots$ are independent identically distributed random vectors in $\mathbb R^d$ such that $\xi_1$ has the same law as $-\xi_1$ and $\mathbb…

We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…

In this paper, we investigate the exact asymptotic behavior of the connectivity probability in the Erdos-Renyi graph G(n,p), under different asymptotic assumptions on the edge probability p=p(n). We propose a novel approach based on the…

We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…

The Poisson boundary of a group G with a probability measure \mu is the space of ergodic components of the time shift in the path space of the associated random walk. Via a generalization of the classical Poisson formula it gives an…

We consider a random walk among i.i.d. obstacles on the one dimensional integer lattice under the condition that the walk starts from the origin and reaches a remote location y. The obstacles are represented by a killing potential, which…

We study the random variable B(c,n), which counts the number of balls that must be thrown into n equally-sized bins in order to obtain c collisions. The asymptotic expected value of B(1,n) is the well-known $\sqrt{n\pi/2}$ appearing in the…

We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…

We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…

We revisit the computation of a probability of collision in the context of automotive collision avoidance (also referred to as conflict detection in other contexts). After reviewing existing approaches to the definition and computation of a…

The system of one-dimensional symmetric simple random walks, in which none of walkers have met others in a given time period, is called the vicious walker model. It was introduced by Michael Fisher and applications of the model to various…