Related papers: Mixing for the primitive equations under bounded n…

There exist very few results on mixing for non-stationary processes. However, mixing is often required in statistical inference for non-stationary processes such as time-varying ARCH (tvARCH) models. In this paper, bounds for the mixing…

We study time-inhomogeneous Markov chains to obtain quantitative results on their asymptotic behavior. We use Poincar\'e, Nash, and logarithmic-Sobolev inequalities. We assume that our Markov chain admits a finite invariant measure at each…

Whereas classical invariance principles for ergodic Markov chains address the situation in which the time horizon of observations is much larger than the mixing time, the quality of approximation is questionable when this is not the case…

In this paper, we consider the classical spin systems on unbounded lattices given by infinite-dimensional stochastic differential equations (SDEs). We assume that the stochastic forcing acts only on one particle. The other particles are not…

Using a new and general method, we prove the existence of random attractor for the three dimensional stochastic primitive equations defined on a manifold $\D\subset\R^3$ improving the existence of weak attractor for the deterministic model.…

In this paper, we establish a small time large deviation principle for the strong solution of 3D stochastic primitive equations driven by multiplicative noise. Both the small noise and the small, but highly nonlinear, unbounded nonlinear…

We study continuous-time Markov chains on the non-negative integers under mild regularity conditions (in particular, the set of jump vectors is finite and both forward and backward jumps are possible). Based on the so-called flux balance…

The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical…

We consider tilings of $\mathbb{Z}^2$ by two types of squares. We are interested in the rate of convergence to the stationarity of a natural Markov chain defined for square tilings. The rate of convergence can be represented by the mixing…

We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-on-solid model of statistical physics. This model has been proposed, among other things, as an idealization of the behavior of…

The convergence rate of a Markov chain to its stationary distribution is typically assessed using the concept of total variation mixing time. However, this worst-case measure often yields pessimistic estimates and is challenging to infer…

We study the long-time mixing behavior of the stochastic nonlinear Schr\"odinger equation in $\mathbb{R}^d$, $d\le 3$. It is well known that, under a sufficiently strong damping force, the system admits unique ergodicity, although the rate…

Through a Metropolis-like algorithm with single step computational cost of order one, we build a Markov chain that relaxes to the canonical Fermi statistics for k non-interacting particles among m energy levels. Uniformly over the…

We consider tilings of a closed region of the Kagome lattice (partition of the plane into regular hexagons and equilateral triangles such that each edge is shared by one triangle and one hexagon). We are interested in the rate of…

Considering a Markov chain defined on a cycle, near-quadratic improvement of mixing is shown when only a subtle perturbation is introduced to the structure and non-reversible transition probabilities are used. More precisely, a mixing time…

We investigate the mixing properties of a finite Markov chain in random environment defined as a mixture of a deterministic chain and a chain whose state space has been permuted uniformly at random. This work is the counterpart of a…

We survey recent results concerning the total-variation mixing time of the simple exclusion process on the segment (symmetric and asymmetric) and a continuum analog, the simple random walk on the simplex with an emphasis on cutoff results.…

We consider Markov chains which are polynomially mixing, in a weak sense expressed in terms of the space of functions on which the mixing speed is controlled. In this context, we prove polynomial large and moderate deviations inequalities.…

This paper is concerned with stochastic incompressible Navier-Stokes equations with multiplicative noise in two dimensions with respect to periodic boundary conditions. Based on the Helmholtz decomposition of the multiplicative noise,…

We consider stochastic optimization problems where data is drawn from a Markov chain. Existing methods for this setting crucially rely on knowing the mixing time of the chain, which in real-world applications is usually unknown. We propose…