Related papers: Simple Conditions for Metastability of Continuous …
We consider the ferromagnetic q-state Potts model on a finite grid graph with non-zero external field and periodic boundary conditions. The system evolves according to Glauber-type dynamics described by the Metropolis algorithm, and we…
We study a stochastic system of interacting neurons and its metastable properties. The system consists of $N$ neurons, each spiking randomly with rate depending on its membrane potential. At its spiking time, the neuron potential is reset…
We consider simple stochastic climate models, described by slowly time-dependent Langevin equations. We show that when the noise intensity is not too large, these systems can spend substantial amounts of time in metastable equilibrium,…
In this paper we derive the moderate deviation principle for stationary sequences of bounded random variables under martingale-type conditions. Applications to functions of $\phi$-mixing sequences, contracting Markov chains, expanding maps…
This article aims to investigate sufficient conditions for the stability of stochastic differential equations with a random structure, particularly in contexts involving the presence of concentration points. The proof of asymptotic…
The SIS (susceptible-infected-susceptible) epidemic model on an arbitrary network, without making approximations, is a $2^n$-state Markov chain with a unique absorbing state (the all-healthy state). This makes analysis of the SIS model and,…
Statistical mechanics assumes that a quantum many-body system at low temperature can be effectively described by its Gibbs state. However, many complex quantum systems exist only as metastable states of dissipative open system dynamics,…
A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. We introduce and study…
We prove stochastic stability of chaotic maps for a general class of Markov random perturbations (including singular ones) satisfying some kind of mixing conditions. One of the consequences of this statement is the proof of Ulam's…
We consider symmetric Markov chains on $\Bbb Z^d$ where we do {\bf not} assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper…
We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary…
Let $(X_n)_{n\ge 1}$ be a Markov chain on a measurable state space $X$, and let $S_n = \sum_{k=1}^n f(X_k)$ be the associated Markov walk. For $y>0$, denote by $\tau_y$ the first time at which $y+S_n$ becomes non-positive. Assuming that the…
We study limit theorems for partial sums of instantaneous functions of a homogeneous Markov chain on a general state space. The summands are heavy-tailed and the limits are stable distributions. The conditions imposed on the transition…
In many dynamical systems in nature, the law of the dynamics changes along with the temporal evolution of the system. These changes are often associated with the occurrence of certain events. The timing of occurrence of these events…
We studied metastability and extinction time of a finite system with a large number of interacting components in discrete time by means of analytical and numerical investigation. The system is markovian with respect to the potential profile…
Markov chains can be used to generate samples whose distribution approximates a given target distribution. The quality of the samples of such Markov chains can be measured by the discrepancy between the empirical distribution of the samples…
In this paper we establish the meta-stability of travelling waves for a class of reaction-diffusion equations forced by a multiplicative noise term. In particular, we show that the phase-tracking technique developed in…
One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain converges to the uniform distribution, but generally the rate…
We consider the problem of finding the transition rates of a continuous-time homogeneous Markov chain under the empirical condition that the state changes at most once during a time interval of unit length. It is proven that this…
We consider a discrete-time Markov chain $(X^t,Y^t)$, $t=0,1,2,...$, where the $X$-component forms a Markov chain itself. Assume that $(X^t)$ is Harris-ergodic and consider an auxiliary Markov chain ${\hat{Y}^t}$ whose transition…