Related papers: Poissonization-based collision threshold derivatio…

We developed an integer lattice gas method for the fluctuating diffusion equation. Such a method is unconditionally stable and able to recover the Poisson distribution for the microscopic densities. A key advance for integer lattice gases…

Theoretical analysis of random walk on percolation lattices has predicted that, at the occupied site concentrations of above the threshold value, a characteristic crossover between an initial sub-diffusion to a final classical diffusion…

In this article we study collisions of two independent random walks on comb graphs $\mathrm{Comb}(\tilde{G},f)$ for a large class of recurrent planar graphs $\tilde{G}$ and profile functions $f$, the latter governing the length of vertical…

Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively,…

We consider quantum walks with position dependent coin on 1D lattice $\mathbb{Z}$. The dispersive estimate $\|U^tP_c u_0\|_{l^\infty}\lesssim (1+|t|)^{-1/3} \|u_0\|_{l^1}$ is shown under $l^{1,1}$ perturbation for the generic case and…

Distribution of the sum of independent identically distributed symmetric lattice vectors is approximated by the accompanying compound Poisson law and the second-order Hipp-type signed compound Poisson measure. Bergstr\"om -type asymptotic…

For any countable group with infinite conjugacy classes we construct a family of forests on the group. For each of them there is a random walk on the group with the property that its sample paths almost surely converge to the geometric…

Computing collision-free trajectories is of prime importance for safe navigation. We present an approach for computing the collision probability under Gaussian distributed motion and sensing uncertainty with the robot and static obstacle…

We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…

We propose a new method of analyzing the asymptotics of moments of certain linear random recurrences which is based on the technique of iterative functions. By using the method, we show that the moments of the number of collisions and the…

We define an electrification of the curve graph of a surface S of finite type and use it to identify the Poisson boundary of a random walk on the mapping class group of S with some logarithmic moment condition as a stationary measure on the…

Interaction between vehicles and pedestrians is seen in many areas such as crosswalks and intersections. In this paper, we study a totally asymmetric simple exclusion process with a bottleneck at a boundary caused by an interaction. Due to…

We show that the total number of collisions in the exchangeable coalescent process driven by the beta $(1,b)$ measure converges in distribution to a 1-stable law, as the initial number of particles goes to infinity. The stable limit law is…

By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching…

We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…

Current approaches for collision avoidance and space traffic management face many challenges, mainly due to the continuous increase in the number of objects in orbit and the lack of scalable and automated solutions. To avoid catastrophic…

We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…

We consider random walks on non-amenable Baumslag-Solitar groups BS(p,q) and describe their Poisson-Furstenberg boundary. The latter is a probabilistic model for the long-time behaviour of the random walk. In our situation, we identify it…