Related papers: A Class of Multi-particle Reinforced Interacting R…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
We introduce a one-dimensional random walk, which at each step performs a reinforced dynamics with probability $\theta$ and with probability $1 - \theta$, the random walk performs a step independent of the past. We analyse its asymptotic…
Using an approximation by a set-valued dynamical system, this paper studies a class of non Markovian and non homogeneous stochastic processes on a finite state space. It provides an unified approach to simulated annealing type processes. It…
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…
In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of…
This paper considers non-backtracking random walks on random graphs generated according to the configuration model. The quantity of interest is the scaling of the mixing time of the random walk as the number of vertices of the random graph…
We consider a vertex reinforced random walk on the integer lattice with sub-linear reinforcement. Under some assumptions on the regular variation of the weight function, we characterize whether the walk gets stuck on a finite interval. When…
Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…
We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a mean vector field which induces the coupling between the…
We prove that the linearly edge reinforced random walk (LRRW) on any graph with bounded degrees is recurrent for sufficiently small initial weights. In contrast, we show that for non-amenable graphs the LRRW is transient for sufficiently…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state…
We consider shock measures in a class of conserving stochastic particle systems on Z. These shock measures have a product structure with a step-like density profile and include a second class particle at the shock position. We show for the…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
On infinite homogeneous structures, two random walkers meet with certainty if and only if the structure is recurrent, i.e., a single random walker returns to its starting point with probability 1. However, on general inhomogeneous…
We consider a generalization of the so-called elephant random walk by introducing multiple elephants moving along the integer line, $\mathbb{Z}$. When taking a new step, each elephant considers not only its own previous steps but also the…
Quantum walks on the line with a single particle possess a classical analog. Involving more walkers opens up the possibility to study collective quantum effects, such as many particle correlations. In this context, entangled initial states…
In the stochastic sandpile model on a graph, particles interact pairwise as follows: if two particles occupy the same vertex, they must each take an independent random walk step with some probability $0<p<1$ of not moving. These…
The self-avoid random walk algorithm has been extensively used in the study of polymers. In this work we study the basic properties of the trajectories generated with this algorithm when two interactions are added to it: contact and folding…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…