Metastability for continuum interacting particle systems

Similar documents
Metastability for interacting particle systems

Capacitary inequalities in discrete setting and application to metastable Markov chains. André Schlichting

Metastability for the Ginzburg Landau equation with space time white noise

Metastability for the Ising model on a random graph

Three lectures on metastability under stochastic dynamics

2012 NCTS Workshop on Dynamical Systems

Markov Chains and MCMC

Sharp asymptotics for Kawasaki dynamics on a finite box with open boundary

Dynamical systems with Gaussian and Levy noise: analytical and stochastic approaches

Phase transitions for particles in R 3

arxiv: v2 [math.pr] 9 Mar 2018

Metastability in a class of parabolic SPDEs

6 Markov Chain Monte Carlo (MCMC)

Stochastic domination in space-time for the supercritical contact process

Cluster and virial expansions for multi-species models

process on the hierarchical group

Random Walks A&T and F&S 3.1.2

Convex decay of Entropy for interacting systems

On Markov Chain Monte Carlo

Convergence Rate of Markov Chains

Math 456: Mathematical Modeling. Tuesday, April 9th, 2018

Probabilistic Graphical Models Lecture Notes Fall 2009

Uniformly Uniformly-ergodic Markov chains and BSDEs

Birth-and-death in continuum: constructive aspects

Scaling limits of inclusion particles. Cristian Giardinà

Latent voter model on random regular graphs

Anton Bovier Lectures on Metastability

XVI International Congress on Mathematical Physics

Path Coupling and Aggregate Path Coupling

Markov processes and queueing networks

Brownian Motion and the Dirichlet Problem

Phase Equilibria and Molecular Solutions Jan G. Korvink and Evgenii Rudnyi IMTEK Albert Ludwig University Freiburg, Germany

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains

(# = %(& )(* +,(- Closed system, well-defined energy (or e.g. E± E/2): Microcanonical ensemble

LECTURE 3. Last time:

April 20th, Advanced Topics in Machine Learning California Institute of Technology. Markov Chain Monte Carlo for Machine Learning

Lecture 7 and 8: Markov Chain Monte Carlo

Oberwolfach workshop on Combinatorics and Probability

arxiv: v1 [cond-mat.stat-mech] 28 Jun 2016

Lecture 6. 2 Recurrence/transience, harmonic functions and martingales

Advanced Topics in Probability

Bayesian Methods for Machine Learning

Theory and applications of random Poincaré maps

Computational statistics

Evaporation/Condensation of Ising Droplets

Discrete solid-on-solid models

arxiv: v1 [math.pr] 5 Dec 2018

Mixing Times and Hitting Times

Spectra of Large Random Stochastic Matrices & Relaxation in Complex Systems

STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL

Monte Carlo Methods in Statistical Mechanics

Harmonic Functions and Brownian motion

Monte Carlo importance sampling and Markov chain

Simons Workshop on Approximate Counting, Markov Chains and Phase Transitions: Open Problem Session

Lecture No 1 Introduction to Diffusion equations The heat equat

Metastability for interacting particles in double-well potentials and Allen Cahn SPDEs

Where Probability Meets Combinatorics and Statistical Mechanics

RIEMANNIAN GEOMETRY COMPACT METRIC SPACES. Jean BELLISSARD 1. Collaboration:

Sharp estimates on metastable lifetimes for one- and two-dimensional Allen Cahn SPDEs

A mathematical framework for Exact Milestoning

Intertwining of Markov processes

Markovian Description of Irreversible Processes and the Time Randomization (*).

Multi-species virial expansions

Mathematical Structures of Statistical Mechanics: from equilibrium to nonequilibrium and beyond Hao Ge

LECTURE 10: Monte Carlo Methods II

Overview of Markovian maps

CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling

Statistical Mechanics

Residence-time distributions as a measure for stochastic resonance

Hopping transport in disordered solids

Chapter 11. Stochastic Methods Rooted in Statistical Mechanics

Ch5. Markov Chain Monte Carlo

Markov Chain Monte Carlo (MCMC)

Gradient-based Monte Carlo sampling methods

Markov Chains, Conductance and Mixing Time

RECURRENCE IN COUNTABLE STATE MARKOV CHAINS

Markov Chain Monte Carlo Inference. Siamak Ravanbakhsh Winter 2018

Path Decomposition of Markov Processes. Götz Kersting. University of Frankfurt/Main

Numerical methods for lattice field theory

Symmetries and Dynamics of Discrete Systems

Stat 8501 Lecture Notes Spatial Lattice Processes Charles J. Geyer November 16, Introduction

arxiv: v1 [math-ph] 25 Mar 2008

CS 798: Homework Assignment 3 (Queueing Theory)

Insert your Booktitle, Subtitle, Edition

Fractional Laplacian

Diffusion of wave packets in a Markov random potential

Time-Dependent Statistical Mechanics 1. Introduction

Coarsening process in the 2d voter model

Markov Chains Handout for Stat 110

André Schleife Department of Materials Science and Engineering

Lectures on Markov Chains

Lattice Gaussian Sampling with Markov Chain Monte Carlo (MCMC)

Definition A finite Markov chain is a memoryless homogeneous discrete stochastic process with a finite number of states.

Macroscopic quasi-stationary distribution and microscopic particle systems

Metastability for reversible probabilistic cellular automata with self interaction

Wang-Landau Monte Carlo simulation. Aleš Vítek IT4I, VP3

Monte Carlo Methods. Leon Gu CSD, CMU

First order differential equations

Lecture 2+3: Simulations of Soft Matter. 1. Why Lecture 1 was irrelevant 2. Coarse graining 3. Phase equilibria 4. Applications

Copyright 2001 University of Cambridge. Not to be quoted or copied without permission.

Transcription:

Metastability for continuum interacting particle systems Sabine Jansen Ruhr-Universität Bochum joint work with Frank den Hollander (Leiden University) Sixth Workshop on Random Dynamical Systems Bielefeld, 31 October 2013

Problem Question: How long does it take to go from gas to condensed phase? Typically, if the density is only slightly larger than saturation density: it takes a long time there is a nucleation barrier to overcome. Physics / thermodynamics: topic of nucleation theory. This talk: stochastic approaches to metastability for Markovian dynamics whose stationary measures are Gibbs measures. Adapt existing results for lattice spin systems to continuum. Bianchi, Bovier, Eckhoff, den Hollander, Gayrard, Ioffe, Klein, Manzi, Nardi, Spitoni... Limitations: We do not know whether the system actually has a gas / condensed phase transition at positive temperature. But: this does not bother us because we work in the zero-temperature limit at fixed finite volume. Moreover, artificial dynamics particles appear and disappear out of the blue. Expected: methods carry over to a whole class of Markovian dynamics.

Outline 1. Model 2. Main result 3. Key proof ingredient: potential-theoretic approach 4. Application to our problem

Grand-canonical Gibbs measure L > 0, box Λ = [0, L] [0, L]. β > 0 inverse temperature, µ R chemical potential v : [0, ) R { } pair potential soft disk potential Radin 81, r < 1 v(r) = 24r 25, 1 r 25/24, 0, r > 25/24. Total energy U({x 1,..., x n}) := i<j v( x i x j ), U( ) = U({x}) = 0. Probability space: Ω := {ω Λ card(ω) < }. Reference measure: Poisson point process Q, intensity parameter 1. Grand-canonical Gibbs measure P = P β,µ,λ dp dq (ω) = 1 ( Ξ exp β ( U(ω) µn(ω) )), n(ω) := card(ω) = number of points in configuration ω. Ξ = Ξ Λ (β, µ) grand-canonical partition function.

Dynamics Combine interaction energy and chemical potential H(ω) := U(ω) µn(ω). Dynamics: Metropolis-type Markov process with generator ( Lf ) (ω) := x ω exp ( ) ( ) β[h(ω\x) H(ω)] + f (ω\x) f (ω) + exp ( ) ( ) β[h(ω x) H(ω)] + f (ω x) f (ω) dx. Λ Birth and death process: particles appear and disappear anywhere in the box. Rates are exponentially small in β if adding / removing particle increases H(ω). Grand-canonical Gibbs measure is reversible. Analogue of spin-flip dynamics for lattice spin systems: Glauber dynamics. Used in numerical simulations under the name grand-canonical Monte-Carlo. Studied in finite and infinite volume Glötzl 81; Bertini, Cancrini, Cesi 02; Kuna, Kondratiev, Röckner... Warm-up for more realistic dynamics (particles hop / diffuse).

Metastable regime We are interested in the limit β at fixed µ, fixed Λ. The equilibrium measure P β,µ,λ will concentrate on minimizers of H(ω) = U(ω) µn(ω). Observe min ω H(ω) = min Ground states: Radin 81 ( ) ( min U(ω) µn(ω) = min Ek kµ ). k N 0 k N 0 n(ω)=k E k := min U(ω) = 3k + 12k 3. n(ω)=k Every minimizer of U is a subset of a triangular lattice of spacing 1. Three cases: 1. µ < 3 : k E k kµ increasing, minimizer k = 0. Minimum = empty box. 2. µ > 2: k E k kµ decreasing, minimizer: k large. Minimum = filled box. 3. 3 < µ < 2: local minimum at k = 0, global minimum: k large. Empty box = metastable, filled box = stable. Metastable regime. Question: for µ ( 3, 2), how long does it take to go from empty to full?

Critical and protocritical droplets Write µ = 3 + h. Assumption h (0, 1) and h 1 / 1 2 N. Set l c := 1. h Proposition The map k E k kµ has a unique maximizer k c, { (3l 2 1 c + 3l c + 1) (l c + 1) + 1, h ( l k c =, 1 c +1/2 l c ), (3l 2 c + 3l c + 1) + l c + 1, h ( 1, 1 ). l c +1 l c +1/2 Note: 3l 2 c + 3l c + 1 = no. of particles in equilateral hexagon of sidelength l c. Proposition Let k p := k c 1. The minimizer of U(ω) with n(ω) = k p is unique, up to translations and rotations obtained from an equilateral hexagon of sidelength l c by adding or removing one row. Protocritical droplet. Critical droplet = protocritical droplet + a protuberance. Proof: builds on Radin 81. Related: Au Yeung, Friesecke, Schmidt 12. Generalization of known results for Ising / square lattice to triangular lattice + continuum degrees of freedom.

Target theorem Time to reach dense configurations: ρ 0 density of the triangular lattice. Goal: as β, Energy barrier: Prefactor: C(β) 2π Λ D = {ω Ω n(ω) ρ 0 Λ }, τ D := inf{t > 0 ω t D}. E τ D = ( 1 + o(1) ) C(β) 1 exp(βγ ). ( Γ = max Ek kµ ) = E kc k cµ. k N 1 a finite sum over critical droplet shapes. 2kc (24β) 3 Might have to settle for different set D because of the complex energy landscape. Generalizes results for Glauber dynamics on square lattice. Principal difference: prefactor β-dependent. Appearance of derivative v (1+) = 24 reminiscent of Eyring-Kramers formula (transition times for diffusions). Blends discrete and continuous aspects.

Details & interpretation Inverse of the hitting time: intermediate expression ( ) 1 E τ D 1 L(ω) Ξ 1 + L(ω) exp( βh(ω) ) Q(dω). with {n(ω)=k c } L(ω) = { y Λ H(ω y) H(ω) and ( ) } Λ (*) there is a sequence ω k = ω {y, y 1,..., y k } k = 1,..., n such that H(ω k ) < Γ for all k and ω n D. Evaluation: As β, only a small neighborhood of critical droplets (quasi-hexagon + protuberance) contributes to the integral. L(ω) /(1 + L(ω) ) = probability that a critical droplet ω grows rather than shrinks. probability of seeing a critical droplet: 2π Λ (position in space + orientation) a Laplace type integral over droplet-internal degrees of freedom. Evaluation as β leads to powers of β, sum over possible shapes of critical droplets (location of the protuberance).

Potential theoretic approach (X t) irreducible Markov process with finite state space V, transition rates q(x, y), (x y). Reversible measure m(x). Conductance: c(x, y) = m(x)q(x, y) = m(y)q(y, x). A, B disjoint sets, A = {a} singleton. Representation of the hitting time: E aτ B = 1 cap(a, B) h(x)m(x) x V h(x) = P x(τ a < τ B ) unique solution of the Dirichlet problem (Lh)(x) = h(a) = 1, h(b) = 0 (b B), q(x, y) ( h(y) h(x) ) = 0 (x V \({a} B)). y V, y x Capacity or effective conductance: cap(a, B) = y V q(a, y) ( h(a) h(y) ) = ( Lh)(a). Well-known formulas. Have analogues for continuous state spaces.

Potential theoretic approach, continued Dirichlet form and Dirichlet principle: E(f ) = 1 2 x,y V c(x, y) ( f (y) f (x) ) 2 cap(a, B) = min { E(f ) f A = 1, f B = 0 }. Instead of computing hitting times, we have to estimate capacities. Facilitated by variational principles: Dirichlet, Thomson, Berman-Konsowa. Remark: vocabulary (capacity / conductance) hybrid of two distinct pictures: Random walks electric networks: network of resistors, c(x, y) = 1/r(x, y) = conductance, f (x) = voltage at node x, E(f ) = power of dissipated energy. Think P = UI = RI 2 = CU 2. Probabilistic potential theory (Brownian motion Laplacian): Dirichlet form = electrostatic energy, think E(ϕ) = 1 ε(x) ϕ(x) 2 dx. 2 Gaudillière 09: Condenser physics applied to Markov chains: a brief introduction to potential theory. Notes from the XII. Brazilian school of probability.

Application to continuum Glauber dynamics Dirichlet form: E(f ) = 1 f (x) ( Lf ) (x)p β,µ,λ (dω) 2 Ω = 1 1 e β max(h(ω),h(ω x))( f (ω x) f (ω) )2 dx Q(dω) 2 Ξ Ω Λ Network with edges (ω, ω x), conductances exp( β max[h(ω), H(ω x)]). More precisely: conductance is a measure K(dω, d ω) on Ω Ω, E(f ) = 1 ( ) 2 f (ω) f ( ω) K(dω, d ω). 2 Ω Ω Wanted: effective conductance (capacity) between A = { } and B = D = dense configurations as β. Upper bound with Dirichlet principle cap(, D) E(f ), f = guessed good test function. Lower bound with Berman-Konsowa principle: capacity as a maximum over probability measures on paths from to D. Finite state space: Berman, Konsowa 90. Reversible jump processes in Polish state spaces den Hollander, J. (in preparation).

Berman-Konsowa principle and state of the proof Berman-Konsowa principle: den Hollander, J. 13 P probability measure on paths γ = (ω 0,..., ω n) from to D Φ P flow: Φ P (C 1 C 2) = expected no. of edges from C 1 to C 2 (measure). Variational representation for the capacity: [( dφ ) P 1] cap(, D) = sup E P dk (x, y). (x,y) γ Lower bound for the capacity: guess a test measure P on paths. State of the proof for asymptotics of the hitting time: Proof nearly complete for time to become supercritical, i.e., modified choice of D D = {ω Ω n(ω) k c + 1}. For original choice D = {n(ω) ρ 0 Λ }, need to answer an additional question about energy landscape, no-deep-well property. Open. If property does not hold, it is possible that the Glauber dynamics gets stuck in configuration in D\D.