Related papers: A Class of Multi-particle Reinforced Interacting R…
We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks. By inducing correlations between the trajectories of an interacting ensemble such that their marginal transition probabilities…
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…
Encounters between walkers performing a random motion on an appropriate structure can describe a wide variety of natural phenomena ranging from pharmacokinetics to foraging. On homogeneous structures the asymptotic encounter probability…
We continue the investigation of the localization phenomenon for a Vertex Reinforced Random Walk on the integer lattice. We provide some partial results towards a full characterization of the weights for which localization on 5 sites occurs…
Under certain circumstances, a swarm of a species of trail-laying ants known as army ants can become caught in a doomed revolving motion known as the death spiral, in which each ant follows the one in front of it in a never-ending loop…
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z^2 by removing all horizontal edges off the X-axis,…
We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…
We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study semi-infinite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction…
Vertex-reinforced random walk (VRRW), defined by Pemantle in 1988, is a random process that takes values in the vertex set of a graph G, which is more likely to visit vertices it has visited before. Pemantle and Volkov considered the case…
We consider a non-homogeneous random walks system on $\bbZ$ in which each active particle performs a nearest neighbor random walk and activates all inactive particles it encounters up to a total amount of $L$ jumps. We present necessary and…
We study the effect of inter-component interactions on the dynamical properties of quantum walkers. We consider the simplest situation of two indistinguishable non-interacting walkers on a tilted optical lattice interacting with a walker…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
Efficient techniques to navigate networks with local information are fundamental to sample large-scale online social systems and to retrieve resources in peer-to-peer systems. Biased random walks, i.e. walks whose motion is biased on…
Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…
A flowing pair of particles in inertial microfluidics gives important insights into understanding and controlling the collective dynamics of particles like cells or droplets in microfluidic devices. They are applied in medical cell analysis…
Random walks play an important role in probing the structure of complex networks. On traditional networks, they can be used to extract community structure, understand node centrality, perform link prediction, or capture the similarity…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…