For a Markov process associated with a diffusion type Dirichlet form an upper bound is shown for the law of the finite dimensional distributions of the process. Under some more assumptions on the underlaying space this is also shown for the law of the Markov process itself. In the last section we want to give an application to the Wasserstein diffusion.
The large deviations principle for the empirical measure for both continuous and discrete time Markov processes is well known. Various expressions are available for the rate function, but these expressions are usually as the solution to a variational problem, and in this sense not explicit. An interesting class of continuous time, reversible processes was identified in the original work of Donsker and Varadhan for which an explicit expression is possible. While this class includes many (reversible) processes of interest, it excludes the case of continuous time pure jump processes, such as a re…
Consider a sequence of continuous-time Markov chains $(X^{(n)}_t:t\ge 0)$ evolving on a fixed finite state space $V$. Let $I_n$ be the level two large deviations rate functional for $X^{(n)}_t$, as $t\to\infty$. Under a hypothesis on the jump rates, we prove that $I_n$ can be written as $I_n = I^{(0)} \,+\, \sum_{1\le p\le q} (1/θ^{(p)}_n) \, I^{(p)}$ for some rate functionals $I^{(p)}$. The weights $θ^{(p)}_n$ correspond to the time-scales at which the sequence of Markov chains $X^{(n)}_t$ exhibit a metastable behavior, and the zero level sets of the rate functionals $I^{(p)}$ identify the me…
The classical Metropolis-Hastings (MH) algorithm can be extended to generate non-reversible Markov chains. This is achieved by means of a modification of the acceptance probability, using the notion of vorticity matrix. The resulting Markov chain is non-reversible. Results from the literature on asymptotic variance, large deviations theory and mixing time are mentioned, and in the case of a large deviations result, adapted, to explain how non-reversible Markov chains have favorable properties in these respects. We provide an application of NRMH in a continuous setting by developing the necessa…
In the framework of Harnack type Dirichlet forms, we prove a large deviation principle for the asymptotics of reversible Markov processes with rate function given by the energy of the paths.
We build optimal exponential bounds for the probabilities of large deviations of sums \sum_{k=1}^nf(X_k) where (X_k) is a finite reversible Markov chain and f is an arbitrary bounded function. These bounds depend only on the stationary mean E_πf, the end-points of the support of f, the sample size n and the second largest eigenvalue λof the transition matrix.
Let $S_N$ be the sum of vector-valued functions defined on a finite Markov chain. An analogue of the Bernstein--Hoeffding inequality is derived for the probability of large deviations of $S_N$ and relates the probability to the spectral gap of the Markov chain. Examples suggest that this inequality is better than alternative inequalities if the chain has a sufficiently large spectral gap and the function is high-dimensional.
In this paper, we investigate the functional central limit theorem for stochastic processes associated to partial sums of additive functionals of reversible Markov chains with general spate space, under the normalization standard deviation of partial sums. For this case, we show that the functional central limit theorem is equivalent to the fact that the variance of partial sums is regularly varying with exponent 1 and the partial sums satisfy the CLT. It is also equivalent to the conditional CLT.
A variational formula for the asymptotic variance of general Markov processes is obtained. As application, we get a upper bound of the mean exit time of reversible Markov processes, and some comparison theorems between the reversible and non-reversible diffusion processes.
In Monte-Carlo methods the Markov processes used to sample a given target distribution usually satisfy detailed balance, i.e. they are time-reversible. However, relatively recent results have demonstrated that appropriate reversible and irreversible perturbations can accelerate convergence to equilibrium. In this paper we present some general design principles which apply to general Markov processes. Working with the generator of Markov processes, we prove that for some of the most commonly used performance criteria, i.e., spectral gap, asymptotic variance and large deviation functionals, samp…
This paper presents a new, short proof of the computation of the upper tail large deviation rate function for the Brownian directed percolation model. Through a distributional equivalence between the last passage time in this model and the largest eigenvalue in a random matrix drawn from the Gaussian Unitary Ensemble, this provides a new proof a previously known result. The method leads to associated results for the stationary Brownian directed percolation model which have not been observed before.
We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give examples in which we compare with a famous exponential inequality for sums of correlated indicators, the Janson inequality. Here our bound sometimes proves to be superior to Janson's bound.
In this paper we consider the first passage percolation with identical and independent exponentially distributions, called the Eden growth model, and we study the upper tail large deviations for the first passage time ${\rm T}$. Our main results prove that for any $ξ>0$ and $x\neq 0$, $\mathbb{P}({\rm T}(0,nx)>n(μ+ξ))$ decays as $\exp{(-(2dξ+o(1))n)}$ with a time constant $μ$ and a dimension $d$. Moreover, we extend the result to stretched exponential distributions. On the contrary, we construct a continuous distribution with a finite exponential moment where the rate function does not exist.
We provide a general approach to obtain upper bounds for small deviations $ \mathbb{P}(\Vert y \Vert \le ε)$ in different norms, namely the supremum and $β$- Hölder norms. The large class of processes $y$ under consideration takes the form $y_t= X_t + \int_0^t a_s d s$, where $X$ and $a$ are two possibly dependent stochastic processes. Our approach provides an upper bound for small deviations whenever upper bounds for the \textit{concentration of measures} of $L^p$- norm of random vectors built from increments of the process $X$ and \textit{large deviation} estimates for the process $a$ are av…
A supersymmetric quantum perspective on the explicit large deviations for reversible Markov jump processes, with applications to pure and random spin chains
Branching Processes in a Random Environment (BPREs) $(Z_n:n\geq0)$ are a generalization of Galton Watson processes where in each generation the reproduction law is picked randomly in an i.i.d. manner. We determine here the upper large deviation of the process when the reproduction law may have heavy tails. The behavior of BPREs is related to the associated random walk of the environment, whose increments are distributed like the logarithmic mean of the offspring distributions. We obtain an expression of the upper rate function of $(Z_n:n\geq0)$, that is the limit of $-\log \mathbb{P}(Z_n\geq e…
We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^γ$ additional edges, where $γ< 1$. We find that the mixing times of reversible Markov chains properly interpolate between the mixing times of the cycle with no added edges and of the cycle with $cn$ added edges (which is in turn a Small World Network model). In the case of non-reversible Markov-chains, a considerable gap remains between lower and upper bounds, but simulations give hope to experience a significant speedup co…
We prove precise deviations results in the sense of Cramér and Petrov for the upper tail of the distribution of the maximal value for a special class of determinantal point processes that play an important role in random matrix theory. Here we cover all three regimes of moderate, large and superlarge deviations for which we determine the leading order description of the tail probabilities. As a corollary of our results we identify the region within the regime of moderate deviations for which the limiting Tracy-Widom law still predicts the correct leading order behavior. Our proofs use that the…
We prove a moderate deviation principle for subgraph count statistics of Erdos-Renyi random graphs. This is equivalent in showing a moderate deviation principle for the trace of a power of a Bernoulli random matrix. It is done via an estimation of the log-Laplace transform and the Gaertner-Ellis theorem. We obtain upper bounds on the upper tail probabilities of the number of occurrences of small subgraphs. The method of proof is used to show supplemental moderate deviation principles for a class of symmetric statistics, including non-degenerate U-statistics with independent or Markovian entrie…
We consider the standard first passage percolation in $\mathbb{Z}^{d}$ for $d\geq 2$ and we denote by $ϕ_{n^{d-1},h(n)}$ the maximal flow through the cylinder $]0,n]^{d-1} \times ]0,h(n)]$ from its bottom to its top. Kesten proved a law of large numbers for the maximal flow in dimension three: under some assumptions, $ϕ_{n^{d-1},h(n)} / n^{d-1}$ converges towards a constant $ν$. We look now at the probability that $ϕ_{n^{d-1},h(n)} / n^{d-1}$ is greater than $ν+ ε$ for some $ε>0$, and we show under some assumptions that this probability decays exponentially fast with the volume of the cylinder…
Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C x^(2/alpha)) for x > 1 and large n with alpha = 5/48 and C > 0. Our results extend to other two dimensional lattices and strengthen the previously known exponential upper bound derived by Borgs, Chayes, Kesten and Spencer [BCKS99]. Furthermore, under some general assumptions similar to those in [BCKS99], we derive a similar upper bound in dimensions d > 2.
Consider the Totally Asymmetric Simple Exclusion Process (TASEP) on the integer lattice $ \mathbb{Z} $. We study the functional Large Deviations of the integrated current $ \mathsf{h}(t,x) $ under the hyperbolic scaling of space and time by $ N $, i.e., $ \mathsf{h}_N(t,ξ) := \frac{1}{N}\mathsf{h}(Nt,Nξ) $. As hinted by the asymmetry in the upper- and lower-tail large deviations of the exponential Last Passage Percolation, the TASEP exhibits two types of deviations. One type of deviations occur with probability $ \exp(-O(N)) $, referred to as speed-$ N $; while the other with probability $ \ex…
We consider two approaches to study non-reversible Markov processes, namely the Hypocoercivity Theory (HT) and GENERIC (General Equations for Non-Equilibrium Reversible-Irreversible Coupling); the basic idea behind both of them is to split the process into a reversible component and a non-reversible one, and then quantify the way in which they interact. We compare such theories and provide explicit formulas to pass from one formulation to the other; as a bi-product we give a simple proof of the link between reversibility of the dynamics and gradient flow structure of the associated Fokker-Plan…
We consider the standard first passage percolation model in the rescaled graph $\mathbb {Z}^d/n$ for $d\geq2$ and a domain $Ω$ of boundary $Γ$ in $\mathbb {R}^d$. Let $Γ^1$ and $Γ^2$ be two disjoint open subsets of $Γ$ representing the parts of $Γ$ through which some water can enter and escape from $Ω$. We investigate the asymptotic behavior of the flow $ϕ_n$ through a discrete version $Ω_n$ of $Ω$ between the corresponding discrete sets $Γ^1_n$ and $Γ^2_n$. We prove that under some conditions on the regularity of the domain and on the law of the capacity of the edges, the upper large deviatio…
We introduce the concept of matrix liberation process, a random matrix counterpart of the liberation process in free probability, and prove a large deviation upper bound for its empirical distribution with several properties on its rate function. As a simple consequence we obtain the almost sure convergence of the empirical distribution of the matrix liberation process to that of the corresponding liberation process as continuous processes in large $N$ limit.
In this work, we investigate links between the formulation of the flow of marginals of reversible diffusion processes as gradient flows in the space of probability measures and path wise large deviation principles for sequences of such processes. An equivalence between the LDP principle and Gamma-convergence for a sequence of functionals appearing in the gradient flow formulation is proved. As an application, we study large deviations from the hydrodynamic limit for two variants of the Ginzburg-Landau model endowed with Kawasaki dynamics.
We formulate two types of extensions of the large deviation theory initiated by Bahadur in a non-regular setting. One can be regarded as a bound of the point estimation, the other can be regarded as the limit of a bound of the interval estimation. Both coincide in the regular case, but do not necessarily coincide in a non-regular case. Using the limits of relative Rényi entropies, we derive their upper bounds and give a necessary and sufficient condition for the coincidence of the two upper bounds. We also discuss the attainability of these two bounds in several non-regular location shift fami…
In this paper, we investigate the asymptotic behaviors of the critical branching process with immigration $\{Z_n, n\ge 0\}$. First we get some estimation for the probability generating function of $Z_n$. Based on it, we get a large deviation for $Z_{n+1}/Z_n$. Lower and upper deviations for $Z_n$ are also studied. As a by-product, an upper deviation for $\max_{1\le i\le n} Z_i$ is obtained.
Upper tail large deviation for the first passage time in the frog model on $Z^d$ with $d\geq 2$
Institute of Mathematics, Vietnam Academy of Science and Technology(越南科学技术院数学研究所);College of Science and Technology, Nihon University(日本大学理工学部);Department of Mathematics, Keio University(庆应义塾大学数学系)
In this work, we analyse the metastability of non-reversible diffusion processes $$dX_t=\boldsymbol{b}(X_t)dt+\sqrt h\,dB_t$$ on a bounded domain $Ω$ when $\mathbf{b}$ admits the decomposition $\mathbf{b}=-(\nabla f+\mathbf{\ell})$ and $\nabla f \cdot \mathbf{\ell}=0$. In this setting, we first show that, when $h\to 0$, the principal eigenvalue of the generator of $(X_t)_{t\ge 0}$ with Dirichlet boundary conditions on the boundary $\partialΩ$ of $Ω$ is exponentially close to the inverse of the mean exit time from $Ω$, uniformly in the initial conditions $X_0=x$ within the compacts of $Ω$. The …
We prove an upper bound on the total variation mixing time of a finite Markov chain in terms of the absolute spectral gap and the number of elements in the state space. Unlike results requiring reversibility or irreducibility, this bound is finite whenever the chain converges. The dependence on the number of elements means that the new bound cannot capture the behavior of rapidly mixing chains; but an example shows that such dependence is necessary. We also provide a sharpened result for reversible chains that are not necessarily irreducible. The proof of the general bound exploits a connectio…
We study a large class of reversible Markov chains with discrete state space and transition matrix $P_N$. We define the notion of a set of {\it metastable points} as a subset of the state space $\G_N$ such that (i) this set is reached from any point $x\in \G_N$ without return to x with probability at least $b_N$, while (ii) for any two point x,y in the metastable set, the probability $T^{-1}_{x,y}$ to reach y from x without return to x is smaller than $a_N^{-1}\ll b_N$. Under some additional non-degeneracy assumption, we show that in such a situation: \item{(i)} To each metastable point corres…
We consider the asymmetric simple exclusion process (ASEP) on $\mathbb{Z}$ started from step initial data and obtain the exact Lyapunov exponents for $H_0(t)$, the integrated current of ASEP. As a corollary, we derive an explicit formula for the upper-tail large deviation rate function for $-H_0(t)$. Our result matches with the rate function for the integrated current of the totally asymmetric simple exclusion process (TASEP) obtained in [Johansson 00](arXiv:math/9903134).
Using martingale methods, we obtain some upper bounds for large and moderate deviations of products of independent and identically distributed elements of GL d (R). We investigate all the possible moment conditions, from super-exponential moments to weak moments of order p \textgreater{} 1, to get a complete picture of the situation. We also prove a moderate deviation principle under an appropriate tail condition.
For a $Δ$-regular connected graph ${\sf H}$ the problem of determining the upper tail large deviation for the number of copies of ${\sf H}$ in $\mathbb{G}(n,p)$, an Erdős-Rényi graph on $n$ vertices with edge probability $p$, has generated significant interests. For $p\ll 1$ and $np^{Δ/2} \gg (\log n)^{1/(v_{\sf H}-2)}$, where $v_{\sf H}$ is the number of vertices in ${\sf H}$, the upper tail large deviation event is believed to occur due to the presence of localized structures. In this regime the large deviation event that the number of copies of ${\sf H}$ in $\mathbb{G}(n,p)$ exceeds its exp…
In this paper we are concerned with hitting times of a family of density-dependent Markov chains. A moderate deviation principle of the hitting time is given. The proof of the main theorem relies heavily on moderate deviations of density-dependent Markov chains given in \cite{Xue2021} and upper bounds of large deviations of Markov processes given in \cite{Dupuis1991}. An analogue moderate deviation of the hitting time of the diffusion approximation of the density-dependent Markov chain introduced in \cite{Ethier1986} is also given.
In order to sample from a given target distribution (often of Gibbs type), the Monte Carlo Markov chain method consists in constructing an ergodic Markov process whose invariant measure is the target distribution. By sampling the Markov process one can then compute, approximately, expectations of observables with respect to the target distribution. Often the Markov processes used in practice are time-reversible (i.e., they satisfy detailed balance), but our main goal here is to assess and quantify how the addition of a non-reversible part to the process can be used to improve the sampling prop…