Metastable Markov chains: from the convergence of the trace to the convergence of the finite-dimensional distributions
Claudio Landim, Michail Loulakis, Mustapha Mourragui

TL;DR
This paper studies metastable continuous-time Markov chains with multiple wells, establishing conditions for their finite-dimensional distributions to converge to a finite state Markov chain and representing the process as a convex combination of metastable states.
Contribution
It introduces sufficient conditions for convergence of finite-dimensional distributions and provides a representation of the process as a convex combination of metastable states.
Findings
Finite-dimensional distributions converge to a finite state Markov chain.
The process can be represented as a time-dependent convex combination of metastable states.
Conditions for convergence are explicitly characterized.
Abstract
We consider continuous-time Markov chains which display a family of wells at the same depth. We provide sufficient conditions which entail the convergence of the finite-dimensional distributions of the order parameter to the ones of a finite state Markov chain. We also show that the state of the process can be represented as a time-dependent convex combination of metastable states, each of which is supported on one well.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Metastable Markov chains: from the
convergence of the trace to the convergence of the finite-dimensional distributions
C. Landim, M. Loulakis, M. Mourragui
IMPA, Estrada Dona Castorina 110, CEP 22460 Rio de Janeiro, Brasil and CNRS UMR 6085, Université de Rouen, Avenue de l’Université, BP.12, Technopôle du Madrillet, F76801 Saint-Étienne-du-Rouvray, France.
School of Applied Mathematical and Physical Sciences, National Technical University of Athens, 15780 Athens, Greece and Institute of Applied and Computational Mathematics, Foundation for Research and Technology- Hellas (FORTH), 70013 Heraklion Crete, Greece.
CNRS UMR 6085, Université de Rouen, Avenue de l’Université, BP.12, Technopôle du Madrillet, F76801 Saint-Étienne-du-Rouvray, France.
Abstract.
We consider continuous-time Markov chains which display a family of wells at the same depth. We provide sufficient conditions which entail the convergence of the finite-dimensional distributions of the order parameter to the ones of a finite state Markov chain. We also show that the state of the process can be represented as a time-dependent convex combination of metastable states, each of which is supported on one well.
1. Introduction
Several different methods to prove the metastable behavior of Markov chains have been proposed in the last years [39, 11, 17, 18, 20, 10, 21].
Inspired by the potential theoretic approach to metastability, proposed by Bovier, Eckhoff, Gayrard and Klein in [12, 13], Beltrán and Landim introduced a general method, known as the martingale method, to derive the metastable behavior of a Markov process [3, 6, 7]. The reader will find in [7] a discussion on the similarities and differences between the martingale approach, the pathwise approach, put forward in [16] and presented in [39], and the potential theoretic approach, proposed in [12, 13] and reviewed in [11].
To insert the main results of the article in their context, we recall below the martingale method in the context of condensing zero-range processes [5, 30, 43]. Denote by the non-negative integers, , by , , the discrete, one-dimensional torus with points, and by the elements of called configurations. The total number of particles at for a configuration is represented by . Let , , be the set of configurations with particles:
[TABLE]
Fix , and define as
[TABLE]
where , , . In this way, , , and is a strictly decreasing sequence converging to as .
Fix , and denote by the transition probability given by , , , otherwise. Let be the configuration obtained from by moving a particle from to :
[TABLE]
The nearest-neighbor, zero-range process associated to the jump rates and the transition probability is the continuous-time, -valued Markov process whose generator acts on functions as
[TABLE]
Hence, if there are particles at site , at rate , resp. , one of them jumps to the right, resp. left. Since decreases to as , the more particles there are at some site the slower they jump, but the rate remains bounded below by .
This Markov process is irreducible. The stationary probability measure, denoted by , is given by
[TABLE]
where is the normalizing constant.
Fix a sequence such that , , and let , , be the set of configurations in which all but particles sit at :
[TABLE]
According to equation (3.2) in [5], for each , as .
By the ergodic theorem, the process stays most of the time in the set . Since these sets are far apart, one expects the sets to behave as wells of the dynamics: the process remains for a very long time in each of the sets at the end of which it performs a quick transition to another set .
If the process evolves as described in the previous paragraph, it is reasonable to call depth of the well the average time the process remains in before hitting another well. The symmetry of the model implies that in the zero-range process introduced above all wells have the same depth. This is an important difference between this dynamics and the previous ones in which a metastable behavior has been observed. In the latter ones, cf. [39, 11], the models feature one shallow and one deep well and the problem consists in describing the transition from the shallow well to the deep one, or in estimating the mean value of the transition time. In contrast, in the zero-range process, the presence of many wells of the same depth transforms the problem in the characterization of the evolution of the process among the wells.
Beltrán and Landim proposed in [3, 6] a mathematical formulation of this phenomenon which we present below in the context of a sequence of Markov chains, each of which takes values in a finite set.
Consider a sequence of finite sets whose cardinality tends to infinity with . The elements of are called configurations and are denoted by the Greek letters , , . Let be a continuous-time, -valued, irreducible Markov chain.
The wells. Consider a partition , , , of the set , and let
[TABLE]
Here and below we use the notation to represent the union of two disjoint sets , : , and . As in the example above, the sets have to be understood as the wells of the dynamics, the sets where the process remains most of the time, and as the set which separates the wells.
The time scale. Let be the time-scale at which one observes a transition from a well to the set which consists of the union of all the other wells. This time-scale has to be determined in each model. As it can be expressed in terms of capacities (cf. Lemma 6.8 in [3]), its derivation corresponds to the calculation of the capacity between and .
Denote by the process speeded-up by : . Note that the transitions between wells occur in time-intervals of order for the process . This is the reason for changing the time scale and introducing .
Model reduction. We expect the process to remain for a very long time in each well, a time much longer than the time it needs to equilibrate inside the well. If this description is correct, the hitting time of a new well should be asymptotically Markovian due to the loss of memory entailed by the equilibration.
Let , be the projections defined by
[TABLE]
Note that for , while is not defined on the set . In general, is not a Markov chain, but only a hidden Markov chain. As the cardinality of increases to with , takes values in a much smaller state space than . For this reason it is called the reduced chain.
The argument laid down above on equilibration and loss of memory suggests that converges to a Markov chain taking values in . However, the brief sojourns at create an obstacle to the convergence. Starting from the well , the process makes many unsuccessful attempts before hitting a new well . These attempts correspond to brief visits to . A typical path of is illustrated in Figure 1. These short sojourns at , which disappear in the limit, prevent the convergence (in the usual Skorohod topology) of the process to a -valued Markov chain.
To overcome this difficulty, we perform a small surgery in the trajectories by removing from them the pieces of the paths in . This is done by considering the trace of the process on .
Trace process. Fix a proper subset of . The trace of the process on the set , denoted by , is the process obtained from by stopping its evolution when it leaves the set and by restarting it when it returns to the set . More precisely, denote by the total time spent at before time :
[TABLE]
where represents the indicator of the set . Note that the function is piecewise differentiable and that its derivative takes only the values and [math]. It is equal to when the process is in and it is equal to [math] when it is not. Let be the generalized inverse of :
[TABLE]
The trace process is defined as . It is shown in [3, Proposition 6.1] that if is a continuous-time, irreducible Markov chain, then is a continuous-time, -valued, irreducible Markov chain whose jump rates can be expressed in terms of the probabilities of hitting times of the original chain.
Denote by the trace of the process on . By the previous paragraph, is an -valued Markov process. If the time spent on is negligible, we only removed from the original trajectory the short sojourns in .
Metastability. Denote by , the hidden Markov chains given by , , respectively. Note that takes values in , while takes values on the set . Moreover, is the trace on the set of the process .
Let be the space of right-continuous functions with left-limits endowed with the Skorohod topology. Let , , be the probability measure on the path space induced by the Markov chain starting from . Expectation with respect to is represented by .
In [3, 6, 7], a set of conditions have been introduced which yield that
- (H1)
The dynamics is asymptotically Markovian: For all , and sequences , under the measure the process converges in the Skorohod topology to a Markov chain denoted by ; 2. (H2)
The time spent in is negligible: For all
[TABLE]
The first condition asserts that the trace on of the process converges to a Markov chain, while the second one states that the amount of time the process spends outside vanishes as , uniformly over initial configurations in .
The second condition can be restated as
[TABLE]
Soft topology. It is clear that the convergence of the process to in the Skorohod topology does not follow from conditions (H1) and (H2). Consider, for example, a continuous-time, -valued Markov chain , and a sequence , . Fix , and define the process by . The sequence of processes fulfills properties (H1) and (H2), but does not converge to in the Skorohod topology. Actually, not even the -dimensional distributions converge.
This example is artificial, but in almost all models in which a metastable behavior has been observed (cf. the examples of Section 5), as mentioned in the subsection Model Reduction, due to the many and very short sojourns of in [math], the process can not converge in any of the Skorohod topologies to . To overcome this obstacle a weaker topology has been proposed in [31], called the soft topology, in which the convergence takes place.
The soft topology is, however, quite weak. For instance, the function which associates to a trajectory the value is not continuous. For this reason, we put forward in this article an alternative definition of metastability. We propose to declare that the sequence of Markov chains is metastable in the time-scale if the finite-dimensional distributions of converge to the ones of . Moreover, we show that the conditions (H1), (H2) together with an extra condition on the visits to the set , stated below in equation (2.1), entail the metastability of the Markov chains in the FDD sense. This latter result, stated in Proposition 2.1 below, is the main contribution of this article.
We also show, in Proposition 2.2, that conditions (H1), (H2) together with slightly stronger assumptions entail the convergence of the state of the process to a time-dependent convex combination of metastable states.
2. Notation and Results
We present in this section the main results of the article. We adopt the notation introduced in the previous section: is an -valued, irreducible Markov chain, whose state space can be decomposed as in (1.3).
Convergence of the finite-dimensional distributions. The main result of the article reads as follows:
Proposition 2.1**.**
Beyond (H1) and (H2), suppose that for all ,
[TABLE]
Then, for all , and all sequences , , under the finite-dimensional distributions of converge to the finite-dimensional distributions of the chain .
The proof of this result is presented in Section 3, together with several, easier to verify, sufficient conditions for (2.1) to hold.
Slow variables. In all models where metastability has been proved the time-scale increases to with . Since it follows from the previous paragraphs that the finite-dimensional distributions of converge to the ones of the Markov chain , we say that is a slow variable. In this sense, metastability consists in discovering the slow variables of the system and in deriving their asymptotic dynamics.
Convergence of the states. We have coined properties (H1) and (H2) as the metastable behavior of the Markov chain in the time-scale . However, it has been pointed out that in mathematical-physics metastability means the convergence of the state of the process. The second result of this note fills the gap between these two concepts by establishing that properties (H1), (H2) together with conditions (M1), (M2) below lead to the convergence of the state of the process to a convex combination of states supported on the wells . The precise statement of this result requires some notation.
Recall that we denote by the Markov chain speeded-up by : . Denote by the unique stationary state of the chain , and by , , the probability measure conditioned to :
[TABLE]
Note that is defined on and it is supported on .
Reflected process. For , denote by the Markov chain reflected at . This is the Markov chain obtained from by forbidding jumps from to its complement . This mechanism produces a new Markov chain whose state space is , which might be reducible.
We assume that for each the reflected chain is irreducible and that is its unique stationary state. In the reversible case this latter assumption follows from the irreducibility. In the non-reversible case, if the Markov chain is a cycle chain (cf. [22, 35]) it is easy to define the sets for the reflected chain on to be irreducible. Let , be the semigroup of the Markov chain .
Trace process. Similarly, we denote by the trace on of the process , and by the semigroup of the Markov chain .
Mixing times. Denote by the total variation distance between two probability measures defined on the same denumerable set :
[TABLE]
where denotes the positive part of . Hereafter, the set will be either the set or one of the wells , .
Denote by , the -mixing time of the reflected, trace processes, respectively:
[TABLE]
where stands for the Dirac measure concentrated on the configuration .
Hitting times. For a subset of , denote by , the hitting time and the time of the first return to :
[TABLE]
where represents the time of the first jump of the chain : .
For two subsets , denote by the hitting time on the set of the trace process on :
[TABLE]
Let , be two sequences of positive numbers. The relation means that . In the next result, we assume that for each there exists a set fulfilling the following conditions:
- (M1)
For every we have
[TABLE] 2. (M2)
There exists a time-scale such that ,
[TABLE]
and
[TABLE]
Condition (M1) requires that the process restricted in reaches the set quickly. Additionally, condition (M2) imposes that it takes longer to leave the set , when starting from , than it takes to mix in . Slightly more precisely, condition (M2) requests the existence of a time scale , longer than the mixing time of the reflected process and shorter than the exit time from the set . Note, however, that in condition (2.8) the initial configuration belongs to the set , while in the definition of the mixing time the initial configuration may be any element of the set . In any case, condition (2.8) is in force if .
Assume that the chain is reversible. Fix , denote by the transition probabilities of the reflected process , and fix . By definition,
[TABLE]
where and . By Schwarz inequality and a decomposition of along the eigenfunctions of the generator of the reflected process (cf. equation (12.5) in [37]), the square of the previous expression is bounded by , where represents the spectral gap of and the norm of in . Since
[TABLE]
as , we conclude that
[TABLE]
Therefore, in the reversible case, condition (2.8) of (M2) is fulfilled provided
[TABLE]
Proposition 2.2**.**
Assume that conditions (H1), (H2), and (M1), (M2) are in force. Suppose, furthermore, that for all
[TABLE]
and that either of the following three conditions (a), (b) or (c) hold.
- (a)
The process is reversible. 2. (b)
There exists a constant , such that for all , ,
[TABLE] 3. (c)
The sets referred to in (M1) and (M2) further satisfy
[TABLE]
For , , let stand for the joint law of \big{(}\xi^{N}(t_{1}),\ldots,\xi^{N}(t_{k})\big{)}, with . Then, for every and every sequence , ,
[TABLE]
Remark 2.3** (On the hypotheses of Proposition 2.2).**
Separation of scales, in the sense that the process mixes in a well before jumping, is a common feature in metastable Markov chains and it is usually hidden in the proof of (H1). Conditions (M1)–(M2) is a mathematically concrete way to elicit this fact in generality. In the proof of the metastability of zero-range processes in [2], (M1)–(M2) are actually the way (H1) is established. On the other hand, the ”either of three” conditions are not so hard to check. This is clear for reversibility. Condition (b) can be readily checked when is known. Moreover, it is always satisfied if the rates of the limiting process are the rescaled rates of jumping between wells (which is an assumption for H1) and the limiting Markov chain is irreducible. As for (c) there are standard tools to estimate mixing times (cf. [37] in a general set-up, [2] in the context of metastability and Remark 3.9 below).
The article is organized as follows. Propositions 2.1 and 2.2 are proved in Sections 3, 4, respectively. In Section 5 we show that the assumptions of these propositions are in force for four different classes of dynamics. In the last section, we present a general bound for the probability that a hitting time of some set is smaller than a value in terms of capacities (which can be evaluated by the Dirichlet and the Thomson principles). Throughout this article, and are finite positive constants, independent of , whose values may change from line to line.
3. Convergence of the finite-dimensional distributions
In this section, we prove Proposition 2.1, and we present some sufficient conditions for (2.1). We will use the shorthand for the time spent by the process in before time t. Likewise, we will denote the generalized inverse of by . Note that condition (H2) can be stated as
[TABLE]
Since , it follows from the previous equation that for all , ,
[TABLE]
The proof of Proposition 2.1 is based on the next technical result, which provides an estimate for the distribution of the trace process in terms of the distribution of the process .
Lemma 3.1**.**
Assume conditions (H1) and (H2). Then, for all , , , , and ,
[TABLE]
where
[TABLE]
for all , and
[TABLE]
Proof.
Fix , , , and . By definition of , and since ,
[TABLE]
where
[TABLE]
and
[TABLE]
By (3.2) with ,
[TABLE]
On the other hand,
[TABLE]
Denote by the first time the process hits the point after :
[TABLE]
By the strong Markov property, the second term on the right hand side of the penultimate equation is equal to
[TABLE]
Recall from (1.3) the definition of . The previous probability is bounded by
[TABLE]
Since , the first term is bounded by
[TABLE]
By condition (H1), vanishes as and then . To complete the proof of the lemma, it remains to set and to recall the estimate (3.3). ∎
Denote by , , the probability measure on induced by the Markov chain starting from . Since for all , the finite-dimensional distributions of converge to the ones of .
Proof of Proposition 2.1.
We prove the result for one-dimensional distributions. The extension to higher order is immediate. Fix , , , and a sequence , . By assumption (H1), by Lemma 3.1, and by (2.1),
[TABLE]
Since
[TABLE]
the inequality in the penultimate formula must be an identity for each , which completes the proof of the proposition. ∎
3.1. The assumption (2.1)
We conclude this section presenting three sets of sufficient conditions for the bound (2.1).
Remark 3.2**.**
To prove condition (2.1), one is tempted to argue that for all , ,
[TABLE]
In many examples, however, it is not true that the right hand side vanishes, uniformly over configurations in , as and then . In condensing zero ranges processes or in random walks in a potential field, starting from certain configuration in a valley , in a time interval , the chain visits many times the set and the right hand side of the previous inequality, for such configurations , is close to .
The next lemma provides sufficient conditions for assumption (2.1) to hold. It is tailor-made to cover the case where the metastable sets are singletons. This includes spin models on finite sets [38, 42, 4, 8, 18, 32, 36, 19], inclusion processes [9, 25], and random walks among random traps [26, 27].
Lemma 3.3**.**
Assume that for each ,
[TABLE]
Then, (2.1) holds.
Proof.
Fix , and . Multiplying and dividing the probability by , we obtain that
[TABLE]
In particular, condition (2.1) follows from the assumption of the lemma. ∎
The next condition is satisfied by random walks in a potential field [12, 33, 35, 34], illustrated by Example 5.3. It is instructive to think of the sets below, as the deep part of the well . The first condition requires the process to reach the set quickly, while the second one imposes that it will not attain the set in a short time interval when starting from .
Lemma 3.4**.**
Assume that for each there exists a set such that
[TABLE]
Then, condition (2.1) is in force.
Proof.
Fix , , , , and write
[TABLE]
On the event let us denote . By the strong Markov property and since belongs to the interval , the first term on the right hand side is bounded by
[TABLE]
which completes the proof of the lemma. ∎
In Lemmata 3.6 and 3.8 below we present some conditions which imply that, for all , vanishes as .
Recall from (2.2), (2.3) that represents the stationary measure conditioned to , and the semigroup of the reflected process on . The third set of conditions which yield (2.1) relies on the next estimate.
Lemma 3.5**.**
For every , , and configuration ,
[TABLE]
Proof.
Fix , , and . Clearly,
[TABLE]
On the set , up to time , we may couple the chain with the chain reflected at the boundary of , which has been denoted by . By the Markov property at time and replacing by , the second term of the previous equation becomes
[TABLE]
By definition of the total variation distance, and since, by assumption, the stationary measure of the reflected process is given by , this sum is less than or equal to
[TABLE]
The second term is equal to , which completes the proof of the lemma. ∎
Recall from (2.5) that we denote by (, respectively) the hitting time on the set for the trace process on (, respectively).
Lemma 3.6**.**
Under assumptions (H1) and (H2), for every and ,
[TABLE]
Proof.
By definition of , for any ,
[TABLE]
The first term on the right hand side of the preceding equation vanishes ,as , by (3.1). The second term is bounded by
[TABLE]
Since the event can be expressed as for some , by assumption (H1), the first term on the right hand side of the last equation vanishes as . Just as in the proof of Lemma 3.5, on the event we may couple the trace process with the trace process on the well . This permits to bound the last term in the preceding equation by . Hence,
[TABLE]
The reverse implication is trivial, since pointwise. ∎
Corollary 3.7**.**
Assume that conditions (H1), (H2), (M1), (M2) and (2.10) are in force. Then, condition (2.1) is satisfied. In particular, under the assumptions of Proposition 2.2, the finite-dimensional distributions of the projected chain converge, as , to the finite-dimensional distributions of the Markov chain appearing in condition (H1).
Proof of Corollary 3.7.
The first assertion of the corollary is a straightforward consequence of the assumptions and Lemma 3.4, Lemma 3.5, Lemma 3.6 with . The second assertion follows from Proposition 2.1. ∎
Denote by , , the holding rates of the Markov chain . For two disjoint subsets , of , denote by the capacity between and :
[TABLE]
Similarly, for two disjoint subsets , of we represent by the capacity between and for the trace process :
[TABLE]
where stands for the holding rates of the trace process .
The following lemma offers sufficient conditions for (M1), in terms of mixing time or capacity estimates. In view of Lemma 3.6, together with (H1) and (H2) these conditions also imply that
[TABLE]
Lemma 3.8**.**
Let represent the \big{(}\frac{1}{2e}\big{)}-mixing time of the trace process on . If, for every either
[TABLE]
or
[TABLE]
are satisfied, then (M1) holds. If is reversible, the logarithmic term in (3.9) can be dropped.
Proof.
To prove the assertion of the lemma under the assumption (3.8), note that by Proposition A.2 in [6],
[TABLE]
where the last equality follows from identity (A.10) in [6].
Assume, now, that (3.9) is in force. The following argument is inspired by Theorem 6 in [1] and Theorem 1.1 in [40]. We include it here for completeness. Recall from (2.3) that we denote by the semigroup of the trace process on . Pick a time-scale such that
[TABLE]
We may choose, for example,
[TABLE]
Recall that we denote by the trace of the Markov chain on . For any , by definition of
[TABLE]
Since this estimate is uniform in , we may iterate it, using the Markov property, to get
[TABLE]
This expression vanishes, as , if (3.9) is satisfied and if we choose according to (3.10).
Finally, if the process is reversible, by Theorem 5 in [1], there exists a finite universal constant such that
[TABLE]
Hence, (3.7) follows from (3.5) by Markov’s inequality. ∎
The preceding lemma evidences the importance of an upper bound for the mixing time of the trace process. This is the content of Remark 3.9 below.
Denote by , , , the jump rates of the Markov chain , and by , , , the jump rates of the trace process . Assume that the Markov chain is reversible and denote by , the Dirichlet form of the processes , , respectively:
[TABLE]
for functions , . By replacing, in the first line of the previous formula, the measure by the conditioned measure , and by restricting the sum to configurations , we obtain the Dirichlet form of the reflected process, denoted by .
Denote by , the relaxation times of the trace process , the reflected process , respectively:
[TABLE]
where the supremum is carried over all functions with mean zero with respect to , and represents the norm of : .
Remark 3.9**.**
Obtaining estimates for the mixing time of the trace process on the well is often not harder than doing so for the mixing time of the reflected process on the well. Both processes have the same invariant measure and the former has higher jump rates. Indeed, by [3, Corollary 6.2], for any , ,
[TABLE]
Hence, the Dirichlet form corresponding to the trace on dominates the Dirichlet form corresponding to the reflected process on and, consequently, the relaxation time of the former is smaller than the relaxation time of the latter. Then, by the proof of [37, Theorem 12.3],
[TABLE]
The right hand side of the preceding inequality, which is often used as an upper bound for the mixing time of the chain restricted in the well , is also a bound for the mixing time of the trace process.
Remark 3.10**.**
In many interesting cases, e.g. random walks on a potential field [12, 33, 35, 34] or condensing zero-range processes [5, 30], the set may be taken as a singleton.
4. Convergence of the state
In this section, we prove Proposition 2.2. From now on, we assume that the number of valleys is fixed and that the sequence of Markov chains fulfills conditions (H1), (H2), (M1), (M2) and (2.10).
Proof of Proposition 2.2.
We will prove the assertion for . The general case follows easily from Corollary 3.7 and the Markov property. The proof is divided in several steps. At each stage we write the main expression as the sum of a simpler one and a negligible remainder.
Fix , , a sequence , , and . By definition, can be written as
[TABLE]
where
[TABLE]
By Corollary 3.7, for every ,
[TABLE]
By the Markov property, the sum appearing in (4.1) is equal to
[TABLE]
Let . We may rewrite this expression as
[TABLE]
where
[TABLE]
By (3.5) and condition (M1),
[TABLE]
By the strong Markov property, using the notation , the first term in (4.2) is equal to
[TABLE]
Let us now define , and recall the definition of the time-scale introduced in condition (M2). Rewrite the previous sum as
[TABLE]
where
[TABLE]
By (2.7), this latter expression vanishes as .
By the Markov property, the sum appearing in (4.3) is equal to
[TABLE]
where . On the set , we may replace the chain by the reflected chain at , denoted by . The previous expression is thus equal to
[TABLE]
This sum can be rewritten as
[TABLE]
where, by (2.7) and a similar argument to the one following (4.3)
[TABLE]
Since, for every ,
[TABLE]
the first term of (4.4) is equal to
[TABLE]
where the remainder is given by
[TABLE]
Therefore,
[TABLE]
so that, by (2.8),
[TABLE]
The first term in (4.5) can be written as
[TABLE]
where
[TABLE]
Therefore,
[TABLE]
The probability inside the expectation is less than or equal to
[TABLE]
where has been introduced in (1.3). Since , the first term is bounded by . On the other hand, the second term is less than or equal to
[TABLE]
Therefore,
[TABLE]
and, by assumption (H1) and (2.11),
[TABLE]
Lemma 4.1 below shows that the first term in (4.6) is equal to
[TABLE]
where
[TABLE]
We may rewrite the sum in (4.7) as
[TABLE]
where
[TABLE]
By (3.5) and condition (M1), for every ,
[TABLE]
In view of the definition of , the first term in (4.8) can be written as
[TABLE]
where
[TABLE]
Clearly, is less than or equal to
[TABLE]
where the supremum is carried over real numbers , in . By assumption (H1) and Corollary 3.7,
[TABLE]
Up to this point we proved that
[TABLE]
where
[TABLE]
Therefore, in view of (4.9),
[TABLE]
which completes the proof of the proposition, in view of (4.10) and Corollary 3.7. ∎
Lemma 4.1**.**
Under (H1), (M1), (M2), (2.10) and any of the assumptions (a), (b) or (c) of Proposition 2.2, for any we have
[TABLE]
Proof.
For all ,
[TABLE]
Hence,
[TABLE]
By (2.10), the first term of this sum vanishes, as . It remains to show that the second term also vanishes under assumption (a), (b) or (c).
Assume first that (a) holds. Then, by reversibility, the last term in (4.11) is equal to
[TABLE]
This expression vanishes, as , by assumption (H1). This completes the proof of the lemma under the hypothesis (a).
Assume now that condition (b) is in force. In this case, the last term in (4.11) is bounded by
[TABLE]
Here again, by assumption (H1), this expression vanishes, as . This completes the proof of the lemma under the hypothesis (b).
Assume, finally, that condition (c) is fulfilled. Note that
[TABLE]
by Markov’s inequality. The last expression vanishes as by (2.10). Define the stopping time as
[TABLE]
By repeating the arguments that led to (3.5) and (3.11) we obtain that
[TABLE]
Let
[TABLE]
Conditioning first on , and using (2.7), (2.8) and (4.12) yields that
[TABLE]
This concludes the argument. ∎
5. Examples
We present in this section four examples to evaluate the conditions introduced in the previous sections. The first example belongs to the class of models in which the metastable sets are singletons. In the second and third examples the metastable sets are not singletons, but the process visits all configurations of a metastable set before hitting a new metastable set. These processes are said to visit points. In the second example the assumptions of Lemma 3.3 are in force, but not in the third. For this latter class, we show that the conditions of Corollary 3.7 are fulfilled for an appropriate singleton set . In the last example, the process does not visit all configurations of a metastable set before reaching a new metastable set. In these models the entropy plays an important role in the metastable behavior of the system. For this last model, we prove that the hypotheses of Lemma 3.4 hold.
The purpose of this section is not to show that the conditions of Lemmata 3.3, 3.4 or Corollary 3.7 are in force in great generality. Actually, in some cases, this requires lengthy arguments and a detailed analysis of the dynamics. We just want to convince the reader that this is possible. In other words, that one can deduce the convergence of the finite-dimensional distributions and the convergence of the state of the process from conditions (H1), (H2) and some reasonable additional conditions.
In the arguments below we use the Dirichlet and the Thomson principles for the capacities between two disjoint sets of . We do not recall these results here and we refer to [11, Section 7.3]
Example 5.1** (Inclusion process [25, 9]).**
The inclusion process describes the evolution of particles on a countable set. Recall from (1.1) that we denote by , , the discrete, one-dimensional torus with points, by the set of configurations on with particles, and by , , the total number of particles at for the configuration .
Fix a sequence of strictly positive numbers. Recall from (1.2) the definition of the configuration . The reversible, nearest-neighbor, inclusion process associated to the sequence is the continuous-time, -valued Markov process whose generator acts on functions as
[TABLE]
where , , otherwise.
The inclusion process is clearly irreducible and it is reversible with respect to the probability measure given by
[TABLE]
where is the normalizing constant, , and is the gamma function.
Assume that , as . Denote by the configurations in which all particles are placed at site , , for , and let . By [9, Proposition 2.1], as .
The metastable behavior of the inclusion process in the sense of conditions (H1), (H2) has been proved in [9, Theorem 2.3]. The time-scale at which a metastable behavior is observed is given by .
In this model the metastable sets are singletons. This phenomenon occurs in many other models. For instance, in spin systems evolving in large, but fixed, volumes as the temperature vanishes (cf. the Ising model with an external field under the Glauber dynamics [38, 42, 4] and the Blume-Capel model with zero chemical potential and a small magnetic field [18, 32, 19]). It also occurs for random walks evolving among random traps [26, 27].
We claim that all hypotheses of Propositions 2.1, 2.2 are in force. Actually, with the exception of (H1) and (H2), all assumptions trivially hold because the metastable sets are singletons. Set .
A. Conditions (H1) and (H2). We already mentioned that assumptions (H1) and (H2) have been proved in [9] with the time-scale .
B. Condition (2.1). By [9, Proposition 2.1], . In particular, the inclusion process satisfies the assumption of Lemma 3.3.
C. Condition (M1). Condition (M1) is empty because the sets and coincide.
D. Condition (2.7) of (M2). Since , starting from , corresponds to the first jump of the Markov chain , denoted hereafter by : . Since the process has been speeded-up by , is an exponential random variable of rate . It is thus enough to choose a sequence such that .
E. Condition (2.8) of (M2). This condition is empty because . It holds for any sequence .
F. Condition (2.10) of Proposition 2.2. This is a consequence of [9, Proposition 2.1] which asserts that .
G. Conditions (a), (b) or (c). Assumption (a) of Proposition 2.2 is in force as the process is reversible.
Example 5.2** (Condensing zero-range processes [5, 30, 43]).**
This model has been introduced at the beginning of Section 2. Set .
The condensing zero-range process is an example of a process which visits points in the sense that, starting from a well , the dynamics visits all configurations of before reaching another well. This property reads as follows. For all ,
[TABLE]
where has been introduced in (1.3). Other examples of metastable dynamics which visit points are random walks in a potential field [16, 12, 33, 35].
We show below that all hypotheses of Propositions 2.1, 2.2 are in force. In certain cases we impose further assumptions on the dynamics, e.g., that it is reversible or that , to avoid lengthy arguments. The main tool to prove this assertion is the fact that the process visit points. Recall from (3.6) that we denote by the capacity between two disjoint subsets and of . Since is the process speeded-up by , by [5, Theorem 2.2] and [43, Theorem 6.3], for any disjoint subsets , of ,
[TABLE]
where is the capacity between and for the random walk on with transition probabilities , for .
A. Conditions (H1) and (H2). Assumptions (H1) and (H2) have been proved in [5] in the reversible case, in [30] in the totally asymmetric case, , and in [43] in the asymmetric case .
B. Condition (2.1). We prove that the assumptions of Lemma 3.4 are in force in the reversible case for , where represents the configurations in which all particles are placed at site .
Fix and . By the Markov inequality and [3, Proposition 6.10],
[TABLE]
By (H1), page 806 in [5],
[TABLE]
Therefore, by (5.1), for every ,
[TABLE]
On the other hand, for every ,
[TABLE]
By equation (3.2) in [5], , and by [5, Proposition 2.1], . This shows that the second assumption of Lemma 3.4 is in force.
I. Seo extended the previous result to the asymmetric case in [43, Proposition 6.3].
C. Condition (M1). Since , condition (M1) follows from (5.2).
D. Condition (2.7) of (M2). Since the exterior boundary of is contained in , under , . We claim that
[TABLE]
for some finite constant . In particular, condition (2.7) of (M2) is fulfilled provided we choose .
We turn to the proof of (5.3). By Corollary 6.4 we have
[TABLE]
On the other hand, by monotonicity of capacities
[TABLE]
Since the holding rates are uniformly bounded by , if we denote by the interior boundary of the set , the previous sum is bounded by . An explicit computation shows that the measure of is bounded by . The proof of this assertion is similar to the one of [5, Lemma 3.1] and is omitted. Hence, . Together with (5.4) and [5, Proposition 2.1], this gives (5.3). (Remark: In the case , it is possible to compute exactly and one gets that it is of order . We lost a factor at the first estimate in the preceding display.)
E. Condition (2.8) of (M2). The proof relies on an estimate of the spectral gap. We prove this condition in the case of two sites, the general case can be handled using the martingale approach developed by Lu and Yau [28, Appendix 2].
Assume that , and denote by the spectral gap of the process reflected at . We claim that
[TABLE]
On two sites, the zero-range process is a birth and death process, and the reflected process on is the continuous-time Markov chain whose generator is given by
[TABLE]
where for all , and , due to the reflection at . Denote by the stationary measure conditioned to .
In order to prove (5.5), we have to show that there exists a finite constant such that
[TABLE]
for all and all functions , where represents the scalar product in .
Fix a function . By Schwarz inequality,
[TABLE]
The sum over is bounded by . Hence, since , changing the order of summations the previous expression is seen to be less than or equal to
[TABLE]
This expression is bounded by because is bounded below by a positive constant and the process is speeded-up by . This proves claim (5.6), and therefore (5.5).
We turn to condition (2.8) of (M2). We claim that this condition is fulfilled provided . Indeed, since , in view of (2.9), we have to show that
[TABLE]
which follows from (5.5) if .
For , in view of (D) and (E) above, conditions (2.7) and (2.8) of (M2) are fulfilled for any sequence such that .
F. Condition (2.10) of Proposition 2.2. By [5, Remark 2.5],
[TABLE]
G. Conditions (a), (b) or (c). Assumption (b) of Proposition 2.2 is in force since for all , .
Example 5.3** (Random walk in a potential field).**
In this example, the sets are still reduced to singletons, , but . To simplify the discussion as much as possible, we assume that the process is reversible and that the potential has two wells of the same height, but the arguments apply to the more general situations considered in [12, 33, 35].
Let be an open, bounded and connected subset of with a smooth boundary . Fix a smooth function , with three critical points, satisfying the following assumptions:
- (RW1)
There are two local minima, denoted by , . All the eigenvalues of the Hessian of at these points are strictly positive. Moreover, . 2. (RW2)
The other critical point of is denoted by . The Hessian of at has one strictly negative eigenvalue, all the other ones being strictly positive. 3. (RW3)
For every , , where represents the exterior normal to the boundary of , and the scalar product of , . This hypothesis guarantees that has no local minima at the boundary of .
Denote by the discretization of : , . Let be the probability measure on defined by
[TABLE]
where is the partition function . By equation (2.3) in [33],
[TABLE]
where represents the Hessian of calculated at and its determinant.
Let be the continuous-time Markov chain on whose generator is given by
[TABLE]
where represents the Euclidean norm of .
Recall that , , , represent the two local minima of in , and the saddle point. Let . Denote by , , two balls of radius centered at the local minima. Assume that is small enough for . Denote by the discretization of the sets : .
Let . It has been proved in [33, 35] that the process fulfills conditions (H1) and (H2). We claim that the assumptions of Propositions 2.1 and 2.2 are in force.
We prove condition (2.1) through Corollary 3.7 with , where is a point in which approximates the local minima .
A. Condition (2.6). Fix . Since , by the Markov inequality, it is enough to prove that
[TABLE]
By [3, Proposition 6.10], the expectation is bounded by . Consider a path such that , , , for some . Let be the unitary flow from to such that . By Thomson’s principle,
[TABLE]
The factor appeared as the process has been speeded-up. This expression vanishes as in view of (5.8), the definition of , and because , .
B. Condition (2.7). Let . We claim that this condition is in force provided
[TABLE]
Since, under , , we need to estimate . By Corollary 6.4,
[TABLE]
where stands for the inner boundary of :
[TABLE]
By definition of , the right-hand side of the penultimate formula is bounded above by , which proves the claim.
C. Condition (2.8). We claim that this condition is fulfilled provided
[TABLE]
for some .
We first estimate the spectral gap of the reflected process , denoted by . We claim that . To prove this assertion, we have to show that
[TABLE]
for all and all functions , where represents the scalar product in . For each , denote by a discrete version of the path from to given by . This means that , , and is the closest point of the lattice to for some increasing sequence of times . Clearly, |F(\eta_{j})-F\big{(}x({t_{j}})\big{)}|\leq\frac{c_{0}}{N} and since \frac{d}{dt}F\big{(}x(t)\big{)}=-\|(\nabla F)\big{(}x(t))\|^{2}\leq 0, for all we have
[TABLE]
In particular,
[TABLE]
Since , by Schwarz inequality,
[TABLE]
where the last inequality follows from (5.13). Fix an edge and consider all configurations whose path contains this pair (that is for some ). Of course, there are at most such configurations. Hence, changing the order of summation, the previous sum is seen to be bounded above by
[TABLE]
This proves claim (5.12) since the double sum is equal to .
We turn to the proof of condition (2.8). Fix a sequence satisfying (5.11) for some . By (5.8), . Hence, by (5.12),
[TABLE]
By (5.11) this expression vanishes as . This proves condition (2.8) in view of (2.9).
Conditions (2.10) and (2.11) are elementary. Hence, as claimed, all conditions of Propositions 2.1 and 2.2 are in force. Similar arguments apply in the case of several wells and critical points, as well as in the non-reversible setting.
Example 5.4** (Random walk on a singular graph).**
In this example, the metastable behavior is not due to an energy landscape but to the presence of bottlenecks. After attaining a well, the system remains there a time long enough to relax inside the well before it hits a point from which it can jump to another well. In this example, to fulfil condition (M1) the set can not be taken as a singleton.*
In many other models the entropy plays an important role in the metastable behavior. In the majority of them, the time-scale in which the metastable behavior is observed can not be computed explicitly and is given in terms of the spectral gap or the expectation of hitting times. This is the case of polymers in the depinned phase [15, 14, 29], or the evolution of a droplet in the Ising model with the Kawasaki dynamics [8, 24].
We consider below a random walk on a graph which is illustrated in Figure 2 in the two-dimensional case. For , , let , , be -dimensional cubes of length . Let , , be the points in given by , , , , where is the -dimensional vector with all coordinates equal to [math]. Set , , , , , , . Note that the sets are singletons in all dimensions. This explains the rather intricate definition of the sets .
Denote by the canonical basis of . Let be the continuous-time Markov chain on which jumps from a configuration to at rate if and at rate if . With these jump rates the Markov chain on the cube can be thought as the projection on of a simple random walk on .
Denote by , , the number of neighbors of which do not belong to , and by the four corners of : . Let be the probability measure on given by
[TABLE]
where is the normalizing factor. The measure is the unique stationary (actually, reversible) state. Denote by the inverse of the spectral gap of this chain. By [41, Example 3.2.5], there exist constants such that for all ,
[TABLE]
and
[TABLE]
Fix sequences , , , such that
[TABLE]
Recall that we denote by the four corners of . Let be the points at graph distance less than from one of the corners:
[TABLE]
where stands for the graph distance from to . Finally, let , , and {\mathscr{B}}^{x}_{N}=w_{x}+J_{N}^{2}\times\big{(}(-1)^{x}J_{N}\big{)}^{d-2}. Note that . We refer to Figure 2 for an illustration of these sets.
Assumptions (H1) and (H2) for this model follow from the arguments presented in [7, Proposition 8.3]. Condition (2.1) follows from Lemma 3.4.
A. First condition of Lemma 3.4. If , this condition follows easily from Lemma 3.8. Indeed, since the mixing time of a random walk on a -dimensional cube of length is of order , condition (3.9) is an easy consequence of (3.13). The following argument also works for .
Fix , , and recall that we denote by the set of corners. Let be a sequence such that . By equation (6.18) in [26],
[TABLE]
We may therefore assume that the process does not hit before . On this event, we may couple with a speeded-up random walk on , and hits when hits . By Theorem 5 in [1] applied to ,
[TABLE]
Since and , this proves that
[TABLE]
and in particular the first condition of Lemma 3.4.
B. Second condition of Lemma 3.4. The argument is based on the fact that the process relaxes to equilibrium inside each cube much before it hits the corners. Fix , , , and let be as in A, i.e. . By (5.15), we may insert the event inside the probability appearing in the second displayed equation in Lemma 3.4. After this operation, applying the Markov property, the probability becomes
[TABLE]
On the set , we may couple the process with the speeded-up, random walk reflected at . Denote by the distribution with respect to this dynamics and by the expectation.
Up to this point we proved that
[TABLE]
Since the mixing time of the (speeded-up) random walk on is of order , the previous expression is bounded by
[TABLE]
where is the stationary state of the reflected random walk. As , and since is the stationary state, the previous expression is bounded by
[TABLE]
which completes the proof of the second condition of Lemma 3.4.
The convergence of the finite-dimensional distributions has been addressed in [7]. We now turn to the assumptions of Proposition 2.2. Condition (M1) has been proved above in A. We show below that (M2) is in force in dimension .
C. Condition (2.7). Recall from (5.14) that . Let be a sequence such that .
Fix . Up to the hitting time of the set the process behaves as the chain introduced below (5.15). It is therefore enough to prove condition (2.7) for this latter process. Let , be the simplexes given by
[TABLE]
We have to show that for , ,
[TABLE]
where stands for the distribution of starting from . By symmetry, it suffices to do so for .
Set , and denote by the -enlargement of the process . We refer to Section 6 for the definition of the enlargement and the statement of some properties. Denote by the distribution of the process starting from , and by the equilibrium potential between and : V^{\star}(\eta)={\mathbf{P}}^{\star}_{\eta}\big{[}H_{\Delta^{(1)}_{N}}\leq H_{{\mathbf{E}}^{\star}_{N}}\big{]}. By (6.5), (5.16) follows from
[TABLE]
To bound the equilibrium potential , we follow a strategy proposed in [7]. We first claim that
[TABLE]
Fix , and let the function given by for , for and for , where is chosen for . Let , be given by , , , , . By the Dirichlet principle, , where represents the Dirichlet form of the enlarged process .
There are two contributions to the Dirichlet form . The first one corresponds to edges whose vertices belong to the set . This contribution is bounded by
[TABLE]
The other contribution, is due to the edges between the sets and . Since is bounded by 1, this contribution is bounded by . This completes the proof of (5.18).
We turn to (5.17). Let be the partial order on defined by if for . We may couple two copies of the process , denoted by , , starting from , respectively, in such a way that for all . In particular, hits before , so that
[TABLE]
Suppose that (5.17) does not hold. There exists, therefore, , a subsequence , still denoted by , and a configuration such that . By the previous inequality and by definition of , for all such that . In particular,
[TABLE]
Comparing this bound with (5.18) we deduce that , which is a contradiction since and .
D. Condition (2.8). It is well known that the mixing time of a random walk on a -dimensional cube of length is of order , which proves that condition (2.8) is fulfilled since .
E. Last conditions of Proposition 2.2. Condition (2.10) is clearly in force by definition of . On the other hand the chain is reversible.
6. Appendix
We present in this section a general estimate for the hitting time of a set in Markovian dynamics. Fix a finite set and let be a continuous-time, irreducible, -valued Markov chain. Denote by the unique stationary state of the process, by , , its jump rates, and by its distribution starting from .
We start with an elementary lemma.
Lemma 6.1**.**
Let , be two independent random variables defined on some probability space . Assume that has an exponential distribution of parameter . Then, for all ,
[TABLE]
Proof.
Since and are independent, for every ,
[TABLE]
The last term is equal to e^{-\gamma b}\,P\big{[}X\leq b\big{]}, which completes the proof of the lemma. ∎
Note that if is an exponential random variable of parameter , the inequality reduces to
[TABLE]
Hence, choosing , if is small, the inequality is sharp in the sense that the left-hand side is equal to , while the right-hand side is equal to .
Enlargement of a chain [10, 7]. Let be a copy of and denote by the copy of . Denote by , , the Markov process on whose jump rates are given by
[TABLE]
Hence, being at some state in , the process may only jump to and this happens at rate . In contrast, being at some state in , the process jumps with rate to some state , and jumps with rate to . We call the process the -enlargement of the process . Note that the trace of the enlargement on coincides with the original process .
The chain is clearly irreducible and its invariant probability measure, denoted by , is given by
[TABLE]
The process reversed in time is the Markov chain, denoted by , whose jump rates are given by
[TABLE]
where represents the jump rates of the process reversed in time.
Denote by the distribution of the chain starting from , and by the capacity between two disjoint subsets , of .
Lemma 6.2**.**
Fix two disjoint subsets , of . Then
[TABLE]
and
[TABLE]
Proof.
By equation (2.6) in [23],
[TABLE]
where represents the Dirichlet form of a function for the enlarged process, and the equilibrium potential between two disjoints subsets , of : . On the one hand, by definition of the enlargement, for every , . Hence, the contribution to the Dirichlet form of the edges between and vanishes. On the other hand, since the trace of the enlargement on coincides with the original process , for all , . Hence, the sum appearing on the right-hand side of the previous displayed equation is equal to
[TABLE]
Since, for , , , , the previous sum is equal to
[TABLE]
as claimed in (6.2).
Let and stand for the holding rate of at . We have
[TABLE]
where in the last equality we have split the inner sum over and . Taking into account that for every we have {\mathbb{P}}^{\star}_{\xi}\big{[}H_{{\mathscr{A}}^{\star}}>H_{{\mathscr{A}}}\big{]}=1 because points are only accessible from , the preceding computation gives
[TABLE]
Inequality (6.3) now follows by monotonicity of capacities. ∎
Denote by the equilibrium measure between , for the chain , which is concentrated on the set and is given by
[TABLE]
If is a set with small measure with respect to the stationary measure, it is expected that, for most configurations , is approximately exponentially distributed under . Let be its expectation, so that {\mathbb{P}}_{\eta}\big{[}H_{{\mathscr{A}}}\leq b\big{]}\approx 1-\exp\{-b\lambda\}\approx b\lambda, provided . On the one hand, by [6, Proposition A.2],
[TABLE]
where is the equilibrium potential between and for the time-reversed dynamics, and the capacity between and . If (for instance, because ), we conclude that . On the other hand, choosing as the parameter for the enlarged process, for every ,
[TABLE]
Once more, if , we conclude that , so that
[TABLE]
The next lemma establishes this estimate.
Lemma 6.3**.**
Fix a proper subset of . For every and ,
[TABLE]
and
[TABLE]
Proof.
Fix a proper subset of , and . Fix , and consider the -enlarged process. Denote by the hitting time of the set . By definition of the enlargement, under , has an exponential distribution of parameter and is independent of . Hence, by Lemma 6.1,
[TABLE]
The previous probability is the value of the equilibrium potential between and computed at the configuration , denoted hereafter by . By equation (3.3) in [32] and by (6.2), the previous expression is bounded by
[TABLE]
This proves the first assertion of the lemma.
We may also rewrite the right-hand side of (6.5) as
[TABLE]
where represents the indicator of the set . By [6, Proposition A.2], the previous sum is equal to
[TABLE]
where represents the distribution of the process reversed in time, and the equilibrium measure given by (6.4). By definition of the enlarged process, for every initial condition , has an exponential distribution of parameter . The penultimate displayed equation is thus bounded by , which completes the proof of the lemma. ∎
Denote by the exterior boundary of a set :
[TABLE]
Corollary 6.4**.**
Fix a proper subset of . For every and ,
[TABLE]
where .
Proof.
In view of (6.3), the first result of the preceding lemma gives
[TABLE]
It suffices now to pick . For the second inequality note that
[TABLE]
∎
Acknowledgements. C. Landim has been partially supported by FAPERJ CNE E-26/201.207/2014, by CNPq Bolsa de Produtividade em Pesquisa PQ 303538/2014-7, and by ANR-15-CE40-0020-01 LSD of the French National Research Agency.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. J. Aldous. Some inequalities for reversible Markov chains. J. London Math. Soc. (2) , 25(3):564–576, 1982.
- 2[2] I. Armendáriz, S. Grosskinsky, and M. Loulakis. Metastability in a condensing zero-range process in the thermodynamic limit. Probab. Theory Related Fields , 169(1-2):105–175, 2017.
- 3[3] J. Beltrán and C. Landim. Tunneling and metastability of continuous time Markov chains. J. Stat. Phys. , 140(6):1065–1114, 2010.
- 4[4] J. Beltrán and C. Landim. Metastability of reversible finite state Markov processes. Stochastic Process. Appl. , 121(8):1633–1677, 2011.
- 5[5] J. Beltrán and C. Landim. Metastability of reversible condensed zero range processes on a finite set. Probab. Theory Relat. Fields , 152(3-4):781–807, 2012.
- 6[6] J. Beltrán and C. Landim. Tunneling and metastability of continuous time Markov chains II, the nonreversible case. J. Stat. Phys. , 149(4):598–618, 2012.
- 7[7] J. Beltrán and C. Landim. A martingale approach to metastability. Probab. Theory Related Fields , 161(1-2):267–307, 2015.
- 8[8] J. Beltrán and C. Landim. Tunneling of the Kawasaki dynamics at low temperatures in two dimensions. Ann. Inst. Henri Poincaré Probab. Stat. , 51(1):59–88, 2015.
