Related papers: Multiparticle random walks
We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…
In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…
We investigate two complementary problems related to maintaining the relative positions of N random walks on the line: (i) the leader problem, that is, the probability {\cal L}_N(t) that the leftmost particle remains the leftmost as a…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…
We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…
The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections…
We consider random walks in i.i.d. elliptic random environments which are not uniformly elliptic. We introduce a computable condition in dimension $d=2$ and a general condition valid for dimensions $d\ge 2$ expressed in terms of the exit…
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…
One goal in the quantum-walk research is the exploitation of the intrinsic quantum nature of multiple walkers, in order to achieve the full computational power of the model. Here we study the behaviour of two non-interacting particles…
There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…
Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…
In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
A particle subject to successive, random displacements is said to execute a random walk (in position or some other coordinate). The mathematical properties of random walks have been very thoroughly investigated, and the model is used in…
We review some representative results for first-passage problems involving so-called mortal or evanescent walkers, i.e., walkers with a finite lifetime. The mortality constraint plays a key role in the modeling of many real scenarios, as it…
We discuss the properties of the residence time in presence of moving defects or obstacles for a particle performing a one dimensional random walk. More precisely, for a particle conditioned to exit through the right endpoint, we measure…
We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial…
We study the ordering statistics of 4 random walkers on the line, obtaining a much improved estimate for the long-time decay exponent of the probability that a particle leads to time $t$; $P_{\rm lead}(t)\sim t^{-0.91287850}$, and that a…
Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…