Related papers: Metastability of a random walk with catastrophes
We consider a symmetric finite-range contact process on $\mathbb{Z}$ with two types of particles (or infections), which propagate according to the same supercritical rate and die (or heal) at rate $1$. Particles of type 1 can occupy any…
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution…
Markov chains are fundamental models for stochastic dynamics, with applications in a wide range of areas such as population dynamics, queueing systems, reinforcement learning, and Monte Carlo methods. Estimating the transition matrix and…
Random metastability occurs when an externally forced or noisy system possesses more than one state of apparent equilibrium. This work investigates a class of random dynamical systems, arising from perturbing a one-dimensional piecewise…
This paper provides an overview of the research on the metastable behavior of the Ising model. We analyze the transition times from the set of metastable states to the set of the stable states by identifying the critical configurations that…
We introduce a model for random-walking nodes on a periodic lattice, where the dynamic interaction network is defined from local interactions and E randomly-added long-range links. With periodic states for nodes and an interaction rule of…
What can one say on convergence to stationarity of a finite state Markov chain that behaves "locally" like a nearest neighbor random walk on ${\mathbb Z}$ ? The model we consider is a version of nearest neighbor lazy random walk on the…
Activated Random Walk is a system of interacting particles which presents a phase transition and a conjectured phenomenon of self-organized criticality. In this note, we prove that, in dimension 1, in the supercritical case, when a segment…
Physically motivated stochastic dynamics are often used to sample from high-dimensional distributions. However such dynamics often get stuck in specific regions of their state space and mix very slowly to the desired stationary state. This…
Stochastic systems often exhibit multiple viable metastable states that are long-lived. Over very long timescales, fluctuations may push the system to transition between them, drastically changing its macroscopic configuration. In realistic…
We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We…
We investigate the metastable behavior of reversible Markov chains on possibly countable infinite state spaces. Based on a new definition of metastable Markov processes, we compute precisely the mean transition time between metastable sets.…
We explore the concept of metastability in random dynamical systems, focussing on connections between random Perron-Frobenius operator cocycles and escape rates of random maps, and on topological entropy of random shifts of finite type. The…
In this paper we study the long term evolution of a continuous time Markov chain formed by two interacting birth-and-death processes. The interaction between the processes is modelled by transition rates which are functions with suitable…
Given a sequence $(\mathfrak{X}_i, \mathscr{K}_i)_{i=1}^\infty$ of Markov chains, the cut-off phenomenon describes a period of transition to stationarity which is asymptotically lower order than the mixing time. We study mixing times and…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
There are known expressions to calculate the moments of the first passage time in Markov chains. Nevertheless, it is commonly forgotten that in most applications the parameters of the Markov chain are constructed using estimates based upon…
We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a…
Many researchers have investigated first hitting times as models for survival data. First hitting times arise naturally in many types of stochastic processes, ranging from Wiener processes to Markov chains. In a survival context, the state…