Related papers: Attracting Random Walks
Certain continuous-time quantum walks can be viewed as scattering processes. These processes can perform quantum computations, but it is challenging to design graphs with desired scattering behavior. In this paper, we study and construct…
We introduce a model of interacting Random Walk, whose hopping amplitude depends on the number of walkers/particles on the link. The mesoscopic counterpart of such a microscopic dynamics is a diffusing system whose diffusivity depends on…
In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the…
Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…
Markov switching models are a popular family of models that introduces time-variation in the parameters in the form of their state- or regime-specific values. Importantly, this time-variation is governed by a discrete-valued latent…
We study the performance of a stochastic algorithm based on the power method that adaptively learns the large deviation functions characterizing the fluctuations of additive functionals of Markov processes, used in physics to model…
Activated Random Walk (ARW) is an interacting particle system on the $d$-dimensional lattice $\mathbb{Z}^d$. On a finite subset $V \subset \mathbb{Z}^d$ it defines a Markov chain on $\{0,1\}^V$. We prove that when $V$ is a Euclidean ball…
We study regular graphs in which the random walks starting from a positive fraction of vertices have small mixing time. We prove that any such graph is virtually an expander and has no small separator. This answers a question of Pak [SODA,…
A physical model called dressed photons, a composite system of photons and excitation of electrons in the nano-particles, is effectively used in the realm of near-field optics. Many interesting behaviors of dressed photons are known,…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs), known as frog model. The dynamics of this process is described as follows: There are some active particles, which perform independent SRWs, and sleeping…
We introduce and investigate a new model of a finite number of particles jumping forward on the real line. The jump lengths are independent of everything, but the jump rate of each particle depends on the relative position of the particle…
We prove a shape theorem for a growing set of simple random walks on Z^d, known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent discrete time SRWs, and sleeping…
We introduce a particle model, that we call the $\textit{golf model}$. Initially, on a graph $G$, balls and holes are placed at random on some distinct vertices. The balls then move one by one, doing a random walk on $G$, starting from…
A lattice model for active matter is studied numerically, showing that it displays wettings transitions between three distinctive phases when in contact with an impenetrable wall. The particles in the model move persistently, tumbling with…
A conserved lattice gas with random neighbor hopping of active particles is introduced which exhibits a continuous phase transition from an active state to an absorbing non-active state. Since the randomness of the particle hopping breaks…
We introduce weighted Markovian graphs, a random walk model that decouples the transition dynamics of a Markov chain from (random) edge weights representing the cost of traversing each edge. This decoupling allows us to study the…
Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…