Related papers: Attracting Random Walks
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…
The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph.…
We present a general method to derive the metastable behavior of weakly mixing Markov chains. This approach is based on properties of the resolvent equations and can be applied to metastable dynamics which do not satisfy the mixing…
The combined Continuous Time Random Walk (CTRW) in position and momentum space is introduced, in the form of two coupled integral equations that describe the evolution of the probability distribution for finding a particle at a certain…
The six-vertex model in statistical physics is a weighted generalization of the ice model on $\mathbb{Z}^2$ (i.e., Eulerian orientations) and the zero-temperature three-state Potts model (i.e., proper three-colorings). The phase diagram of…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
We study the stochastic motion of active particles that undergo spontaneous transitions between two distinct modes of motion. Each mode is characterized by a velocity distribution and an arbitrary (anti-)persistence. We present an…
We describe a model for $m$ vertex reinforced interacting random walks on complete graphs with $d\geq 2$ vertices. The transition probability of a random walk to a given vertex depends exponentially on the proportion of visits made by all…
We study various models of independent particles hopping between energy `traps' with a density of energy barriers $\rho(E)$, on a $d$ dimensional lattice or on a fully connected lattice. If $\rho(E)$ decays exponentially, a true dynamical…
We study the performance of Markov chains for the $q$-state ferromagnetic Potts model on random regular graphs. It is conjectured that their performance is dictated by metastability phenomena, i.e., the presence of "phases" (clusters) in…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model…
We solve exactly the non-equilibrium dynamics of two discrete random walkers moving in channels with transition rates $p \neq q$ that swap positions at a rate $s$. We compute exactly the joint probability distribution $P_{n,m}(t)$ for the…
We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…
We show bounds on total variation and $L^{\infty}$ mixing times, spectral gap and magnitudes of the complex valued eigenvalues of a general (non-reversible non-lazy) Markov chain with a minor expansion property. This leads to the first…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
We have numerically studied the trapping problem in a two-dimensional lattice where particles are continuously generated. We have introduced interaction between particles and directionality of their movement. This model presents a critical…
We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…
Let X be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the "forward" neighbours of the actual state, i.e., it does not go back along the…