Metastablity by decomposition of the potential

The project (together with Georg Menz) considers as a prime example a Fokker-Planck equation in a multi-well potential and calculates the precise rate of convergence to equilibrium. The convergence to equilibrium is measures in variance and in relative entropy. We consider the following parabolic PDE

with invariant measure in Gibbs form . Therewith, the generator is symmetric in  . Therefor, it is convenient to consider the evolution of . Then, for this evolution the variance and relative entropy defined by

with $\bar f := \int f d\mu$, are decresing in time:

Exponential convergence to equilibrium is established by a simple Gronwall arguemnt, if one is able to connect the quantities on the right hand side back to the variance and relative entropy, respectively. The functional inequalities needed in this case are the Poincaré (PI( and the logarithmic Sobolev inequality

The main result in

  • Georg Menz, André Schlichting. Poincaré and logarithmic Sobolev inequalities by decomposition of the energy landscape. Annals of Probability. Volume 42, Number 5 (2014), 1809-1884. [ link | arXiv | pdf ]

proves asymptotic estimates  in $\varepsilon$ for the constants and .

The main idea comes from the simple observation, that a sample path of the according SDE

with a standard Brownian motion in $\mathbb{R}^d$. Then, a typical picture of a sufficiently long trajectories looks like:

Sample path of a SDE in a double well potential

Sample path of a SDE in a double well potential

The trajectory shows a scale separation and spends a long time inside the individual basins of attraction for the local minima of (wrt. deterministic gradient flow ) before doing a transition between the basins of attraction. The proof carries over this strategy by decomposing the measure roughly along the basin of attractions denoted by with the number of local minima. Then has the mixture representation

where are the conditional probability measures with support in and . This decomposition carries over to a splitting of the variance and entropy as follows:

and likewise for the entropy.

The local variances and entropies are estimated by constructing a Lyapunov function for the dynamics. For a background on the Lyapunov technique see (Patrick Cattiaux, Arnaud Guillin. Functional Inequalities via Lyapunov conditions. IF_ETE. 2010. <hal-00446104v2>). We slightly generalized the technique to cope with bounded domains by demanding appropriate Neumann boundary conditions for the Lyapunov function. Moreover, we succeeded also to construct a Lyapunov function, which made a fine analysis arond saddle points necessary.

The other part in the variance invoving the term was estimated using a Benamou-Brenier representation of the , which we called a weighted transport distance. This cost representation allowed to construct a sufficiently flow of pushforwards connecting and .

Metastability in discrete setting

This ongoging project (with Martin Slowik) considers the discrete counterpart of the above dynamic, i.e. Markov chain on a discrete state space written with stochastic generator as

We assume the existence of a reversible invariant measure such that the detailed balance condition holds. The crucial idea from the continuous case to decompose the potential along the basin of attractions does not translate immediatley, since there is no canonical deterministic dyanmic associated with the generator , i.e. the role of is hidden inside.

We characterize metastability following the potential theoretic approach (see A. Bovier and F. den Hollander: Metastability - a potential theoretic approch) as follows: The Markov process with generator is -metastable with respect to metastable points , if

where is the conditial measure on . Hereby, for a set is the first hitting time if and else the first return time to .

For a metastable Markov chain, one can associate to each metastable point its stochastic valleys in terms of hitting probabilities: The point belongs to the valley of if among the hitting probabilities to start in and to hit any the largest one is attained for . This allows to carry over the decomposition idea from continuous state spaces.

Moreover, the above stochastic definition has an analytic connection via capacities by the identity

The main question of the project was to show in generality that the above definition without any further model assumptions on the rates is already enough to prove Poincaré and logarithmic Sobolev inequalities with error bounds depending only on and maybe on the cardinality of .

The program succeeded with the help of a robust capacitary inequality, which was established for Sobolev spaces by Vladimir Maz'ya (see V. Maz’ya. Sobolev Spaces: with Applications to Elliptic Partial Differential Equations and references therein for the history). We translated the inequality to discrete state spaces, where it reads:

Capacitary inequality

For define by its super-level sets . Moreove, assume that $f|_B \equiv 0$, then it holds

where is the Dirichlet-form associated to the generator .

Exploiting the consequences of the above inequality allows to conclude estimates of and in terms of capacities with error bounds of the form . For furhter details see for the moment the proceeding article:

  • A. Schlichting, M. Slowik: Capacitary inequalities in discrete setting and application to metastable Markov chains, Oberwolfach Report 35/2015. [ link | pdf ]