Large Deviations for Finite State Markov Jump Processes with Mean-Field Interaction Via the Comparison Principle for an Associated Hamilton–Jacobi EquationAcademic research paper on "Mathematics"

CC BY
0
0
Share paper
Journal of Statistical Physics
OECD Field of science
Keywords
{""}

Academic research paper on topic "Large Deviations for Finite State Markov Jump Processes with Mean-Field Interaction Via the Comparison Principle for an Associated Hamilton–Jacobi Equation"

﻿J Stat Phys (2016) 164:321-345 DOI 10.1007/s10955-016-1542-8

CrossMaik

Large Deviations for Finite State Markov Jump Processes with Mean-Field Interaction Via the Comparison Principle for an Associated Hamilton-Jacobi Equation

Richard Kraaij1

Abstract We prove the large deviation principle (LDP) for the trajectory of a broad class of finite state mean-field interacting Markov jump processes via a general analytic approach based on viscosity solutions. Examples include generalized Ehrenfest models as well as Curie-Weiss spin flip dynamics with singular jump rates. The main step in the proof of the LDP, which is of independent interest, is the proof of the comparison principle for an associated collection of Hamilton-Jacobi equations. Additionally, we show that the LDP provides a general method to identify a Lyapunov function for the associated McKean-Vlasov equation.

Keywords Large deviations • Non-linear jump processes • Hamilton-Jacobi equation • Viscosity solutions • Comparison principle

Mathematics Subject Classification 60F10 • 60J75 • 35D40

1 Introduction

We consider two models of Markov jump processes with mean-field interaction. In both cases, we have n particles or spins that evolve as a pure jump process, where the jump rates of the individual particles depend on the empirical distribution of all n particles.

We prove the large deviation principle (LDP) for the trajectory of these empirical quantities, with Lagrangian rate function, via a proof that an associated Hamilton-Jacobi equation has a unique viscosity solution. The uniqueness is a consequence of the comparison principle, and the proof of this principle is the main novel contribution of this paper.

B Richard Kraaij

r.c.kraaij@tudelft.nl

1 Department of Applied Mathematics, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands

The first set of models that we consider are conservative models that generalize the Ehrenfest model. In the one dimensional setting, this model can also be interpreted as the Moran model without mutation or selection.

We consider d-dimensional spins a(1),. ..,a(n) taking their values in {-1, 1}d. The quantity of interest is the empirical magnetisation xn = (xn,i, ..., xn,d) e Ei := [-1, 1]d, where xn,i = xn,i (a) = 1 £n=1 (j).

The second class of models are jump processes (a(1),..., a(n) on a finite state space {1,..., d}. As an example, we can consider Glauber type dynamics, such as Curie-Weiss spin flip dynamics. In this case, the empirical measure p,n (t) e E2 := P (1, . ..,d) is given by

Mn (t) := - ^ (t)■,

where ai (t) e {1,..., d} is the state of the i th spin at time t.

Under some appropriate conditions, the trajectory xn (t) or Mn (t) converges as n ^ x to x(t), or M(t), the solution of a McKean-Vlasov equation, which is a generalization of the linear Kolmogorov forward equation which would appear in the case of independent particles.

For these sets of models, we obtain a LDP for the trajectory of these empirical measures on the space Dei (R+), i e {1, 2} of cadlag paths on Ei of the form

P [{xn (t)}t>0 ~ Y] ~ e-nI(Y\ P [{Mn (t)}t>0 ~ Y] ~ e-nI(Y)

I(Y) = Io(Y(0)) W £(y(s),Y(s))ds 0

for trajectories y that are absolutely continuous and I (y) = x otherwise. In particular, I (y) = 0 for the solution y of the limiting McKean-Vlasov equation. The Lagrangian L : Ei x Rd ^ R+ is defined as the Legendre transform of a Hamiltionan H : Ei x Rd ^ R that can be obtained via a limiting procedure

H(x, V f (x)) = Hf (x) = lim1 e-nfAnenf. (1.1)

Here An is the generator of the Markov process of {xn (t)}t>0 or {^n (t)}t>0. More details on the models and definitions follow shortly in Sect. 2.

Recent applications of the path-space LDP are found in the study of mean-field Gibbs-non-Gibbs transitions, see e.g. [20,29] or the microscopic origin of gradient flow structures, see e.g. [1,27]. Other authors have considered the path-space LDP in various contexts before, see for example [3,9,13,19,23,24,26]. A comparison with these results follows in Sect. 2.6.

The novel aspect of this paper with respect to large deviations for jump processes is an approach via a class of Hamilton-Jacobi equations. In [22], a general strategy is proposed for the study for large deviations of trajectories which is based on an extension of the theory of convergence of non-linear semigroups by the theory of viscosity solutions. As in the theory of weak convergence of Markov processes, this program is carried out in three steps, first one proves convergence of the generators, i.e. (1.1), secondly one shows that H is indeed the generator of a semigroup. The third step is the verification of the exponential compact containment condition, which for our compact state-spaces is immediate, that yields, given the convergence of generators, exponential tightness on the Skorokhod space. This final step reduces the proof of the large deviation principle on the Skorokhod space to that of the finite dimensional distributions, which can then be proven via the first two steps.

Showing that H generates a semigroup is non-trivial and follows for example by showing that the Hamilton-Jacobi equation

f (x) - XH(x, V f (x)) - h(x) = 0 (1.2)

has a unique solution f for all h e C (Ei) and X > 0 in the viscosity sense. As mentioned above, it is exactly this problem that is the main focus of the paper. An extra bonus of this approach is that the conditions on the Markov processes for finite n are weaker than in previous studies, and allow for singular behaviour in the jump rate if the empirical quantity is close to the boundary.

This approach via the Hamilton-Jacobi equation has been carried out in [22] for Levy processes on Rd, systems with multiple time scales and for stochastic equations in infinite dimensions. In [16], the LDP for a diffusion process on (0, m) is treated with singular behaviour close to 0.

As a direct consequence of our LDP, we obtain a straightforward method to find Lyapunov functions for the limiting McKean-Vlasov equation. If An is the linear generator of the empirical quantity of interest of the n-particle process, the operator A obtained by Af = limn Anf can be represented by Af (fa) = (V f (x), F(x)) for some vector field F. If solutions to

x (t) = F(x (t)) (1.3)

are unique for a given starting point and if the empirical quantity xn (0) (or (0), in the setting of the second model) converges to x (0), the empirical quantities {xn (t)}t>0 converge almost surely to a solution {x (t)}t>0 of (1.3). In Sect. 2.4, we will show that if the stationary measures of An satisfy a LDP on Ei with rate function I0, then I0 is a Lyapunov function for (1.3).

The paper is organised as follows. In Sect. 2, we introduce the models and state our results. Additionally, we give some examples to show how to apply the theorems. In Sect. 3, we recall the main results from [22] that relate the Hamilton-Jacobi equations (1.2) to the large deviation problem. Additionally, we verify conditions from [22] that are necessary to obtain our large deviation result with a rate function in Lagrangian form, in the case that we have uniqueness of solutions to the Hamilton-Jacobi equations. Finally, in Sect. 4 we prove uniqueness of viscosity solutions to (1.2).

2 Main Results

2.1 Two Models of Interacting Jump Processes

We do a large deviation analysis of the trajectory of the empirical magnetization or distribution for two models of interacting spin-flip systems.

2.1.1 Generalized Ehrenfest Model in d-Dimensions

Consider d-dimensional spins a = (a(1),..., a(n)) e ({-1, 1}d )n. For example, we can interpret this as n individuals with d types, either being — 1 or 1. For k < n, we denote the ith coordinate of a(k) by ai (k). Set xn = (xn,\,..., xn,d) e E\ := [—1, 1]d, where xn,i = xn i (a) = 1 ^n=1 at (j) the empirical magnetisation in the ith spin. For later convenience, denote by E\n the discrete subspace of E1 which is the image of ({—1, 1}d)n under the map

a ^ xn(a). The spins evolve according to mean-field Markovian dynamics with generator An:

Anf (a) = XZ ^(J)=-!)<+(xn(a)) [f (ai •J) - f (a)]

i=1 j=1 dn

+ ZZ 1(ai(J)=i)r'n,-(Xn(a)) [f (ai,J) - f (a)j .

i=1 j=1

The configuration ai ,J is obtained by flipping the i th coordinate of the j th spin. The functions rn +, rn - are non-negative and represent the jump rate of the i th spin flipping from a — 1 to 1 or vice-versa.

The empirical magnetisation xn itself also behaves Markovian. To motivate the form of the generator of the xn process, we turn to the transition semigroups. For g e C(({—1, 1}d)n), denote

Sln(t)g(an) = E [g(an(t)) | an(0) = an].

As the rates in the generator of an only depend on the empirical magnetization, we find that for f e C (E1, n)

E [ f (xn (an (t))) | xn (an (0)) = x]

only depends on x and not on an (0). Therefore, we can denote this object by (t) f (x). Additionally, we see that S^t)(f oxn)(an) = S%(t) f (xn (an)). Thus, the empirical magnetization has generator An : C(E1,n) ^ C(E1,n) which satisfies Anf (xn(a)) := An(f o xn)(a) and is given by

Anf (x ) = X n rln +(x ^ f (x + 2 e^

[fiX " 2e')

+ n r'n-(x) I f[x - nei) - f (x)

where the vector consisting of 0s, and a 1 in the i th component.

Note that An can be obtained from An also intuitively. A change from —1 to 1 in the i th coordinate induces a change + 2ef in the empirical magnetisation. This happens at a rate rln +(xn (a)) multiplied by the number of spins. i.e. n 1 x2 (a'>, that satisfy ai = —1.

Under suitable conditions on the rates r'n + and r'n —, we will derive a LDP for the trajectory {xn (t)}t>0 in the Skorokhod space De1 (R+) of right continuous E1 valued paths that have left limits.

2.1.2 Systems of Glauber Type with d States

We will also study the large deviation behaviour of copies of a Markov process on {1,..., d} that evolve under the influence of some mean-field interaction. Here a = (a(1),..., a(n)) e {1,..., d}n and the empirical distribution ¡x is given by ¡xn (a) = 1 ^i<n &a(i) which takes values in

E2,n :=

M e P ( E2 ) | m = - > ¡xi, for

some xi e{1,..., d j

Of course, this set can be seen as discrete subset of E2 := P({1,...,d}) = {fa e Rd | fai > 0,£i fai = 1}. We take some n-dependent family of jump kernels rn : {1,..., d }x{1,...,d }x E2,n ^ R+ and define Markovian evolutions for a by

n d / 1 n \

Anf (a (I),... ,a(n)) = X Z rn[ a(i), b, j X Sa(>) [ f (ai,b) - f (a)] ,

i=1 b=1 n i=1

where al'b is the configuration obtained from a by changing the ith coordinate to b. Again, we have an effective evolution for fan, which is governed by the generator

Anf (fa) = n ^ fa(a)rn (a, b, fa)[ f (fa - n-1Sa + n-18b) - f (fa)].

As in the first model, we will prove, under suitable conditions on the jump kernels rn a LDP in n for {fan (t)}t>0 in the Skorokhod space De2 (R+).

2.2 Large Deviation Principles

The main results in this paper are the two large deviation principles for the two sets of models introduced above. To be precise, we say that the sequence xn e Dej (R+), or for the second case fan e De2 (R+), satisfies the large deviation principle with rate function I : Dej (R+) ^ [0, m] if I is lower semi-continuous and the following two inequalities hold:

(a) For all closed sets G C DEj (R+), we have

limsup — logP[{x„(t)}t>0 e G]<- inf I(y).

n^m n y eG

(b) For all open sets U C Dej (R+), we have

lim inf — log P[{x„ (t)}, >0 e U ]>- inf I (y).

n^m n ~ yeU

For the definition of the Skorokhod topology defined on Dej (R+), see for example [21]. We say that I is good if the level sets I-1[0, a] are compact for all a > 0.

Carrying out the procedure in (1.1) for our two sets of models, we obtain, see Lemma J below, operators (H, D(H)), D(H) = C J(E) that are of the form Hf (x) = H(x, V f (x)), H : E x Rd ^ R. These are the Hamiltonians that appear in Theorems 1 and 2.

For a trajectory y e Dej (R),wesaythatY e AC if the trajectory is absolutely continuous. For the d-dimensional Ehrenfest model, we have the following result.

Theorem 1 Suppose that

lim sup y

1 - Xi

rln + (x) - v+ (x)

1 + Xi

rln (x) - vl_ (x)

for some family of continuous functions v+, v- : Ej ^ R+, 1 < i < d with the following properties.

The rate v+ is identically zero or we have the following set of conditions. (a) v+ (x) > 0 ifxi = 1.

(b) For z e [-1, 1]d such that zi = 1, we have v+ (z) = 0 and for every such z there exists a neighbourhood Uz of z on which there exists a decomposition v+ (x) = v+ z ^(xj)v+ z ^(x), where v+ z ■ is decreasing and where v+ z ^ is continuous and satisfies v+, z , ^ (z) = 0.

The rate v— is identically zero or we have the following set of conditions.

(a) v— (x) > 0 ifxi =—1.

(b) For z e [—1, 1]d such that zi = —1, we have v— (z) = 0 and for every such z there exists a neighbourhood Uz of z on which there exists a decomposition v— (x) = v— z ■ (xi )v— z ¿.(x), where v+ z ■ is increasing and where v— z ^ is continuous and satisfies v—, z , ^(z) = 0.

Furthermore, suppose that {xn (0)}n>i satisfies the LDP on Ej with good rate function I0.

Then, {xn }n>1 satisfies the LDP on Dej (R+) with good rate function I given by

I0(y(0)) + /0 L(Y(s), Y(s))ds if y e AC,

otherwise

I (Y) =

where the Lagrangian L(x, v) : Ej x Rd ^ R is given by the Legendre transform L(x, v) = sup peKd (p, v) — H (x, p) of the Hamiltonian H : Ej x Rd ^ R, defined by

H(x, p) = £ v+ (x) [e2pi — 1] + v— (x) [e—2pi — 1] . (2.2)

Remark 1 Note that the functions v+ and v— do not have to be of the form v+ (x) = ^^—r+ (x), v — (x) = i+^r — (x) for some bounded functions r+, r —. This we call singular behaviour, as such a rate cannot be obtained the LDP for independent particles via Varadhan's lemma and the contraction principle as in [26] or [13].

Theorem 2 Suppose that

lim sup \p(a)rn(a, b,p) — v(a, b,p)\ = 0, (2.3)

for some continuous function v : {1,..., d}x{1,..., d }x E2 R+ with the following properties.

For each a, b, the map p ^ v(a, b,p) is either identically equal to zero or satisfies the following two properties.

(a) v(a, b, p) > 0 for all p such that p(a) > 0.

(b) For v such that v(a) = 0, there exists a neighbourhood Uv of v on which there exists a decomposition v(a, b, p) = vv,^(a, b, p(a))vv,\$(a, b, p) such that vv,•(■ is increasing in the third coordinate and such that vv^(a, b, •) is continuous and satisfies vv^(a, b, v) = 0.

Additionally, suppose that {pn (0)}n>j satisfies the LDP on E2 with good rate function I0. Then, {pn }n>i satisfies the LDP on De2 (R+) with good rate function I given by

I (Y) =

I0(Y (0)) + /0 L(Y (s), Y (s))ds if y e AC X otherwise,

where L : E2 x Rd ^ R+ is the Legendre transform of H : E2 x Rd ^ R given by

H(fa, p) = ^ v(a, b, fa) [epb-Pa - 1] . (2.4)

2.3 The Comparison Principle

The main results in this paper are the two large deviation principles as stated above. However, the main step in the proof of these principles is the verification of the comparison principle for a set of Hamilton-Jacobi equations. As this result is of independent interest, we state these results here as well, and leave explanation on why the comparison principle is relevant for the large deviation principles for later. We start with some definitions.

For E equals Ej or E2, let H : E x Rd ^ R be some continuous map. For k > 0 and h e C(E). Set Fk,h : E x R x Rd ^ R by

Fx,h(x, f, p) = f - kH(x, p) - h(x).

We will solve the Hamilton-Jacobi equation

Fkh(x, f (x), V f (x)) = f (x) - kH(x, V f (x)) - h(x) = 0 x e E, (2.5)

in the viscosity sense.

Definition 1 We say that u is a (viscosity) subsolution of Eq. (2.5) if u is bounded, upper semi-continuous and if for every f e C1 (E) and x e E such that u - f has a maximum at x, we have

Fk,h (x, u(x), V f (x)) < 0.

We say that u is a (viscosity) supersolution of Eq. (2.5) if u is bounded, lower semi-continuous and if for every f e C1 (E) and x e E such that u - f has a minimum at x, we have

Fkh(x, u(x), Vf (x)) > 0.

We say that u is a (viscosity) solution of Eq. (2.5) if it is both a sub and a super solution.

There are various other definitions of viscosity solutions in the literature. This definition is the standard one for continuous H and compact state-space E.

Definition 2 We say that Eq. (2.5) satisfies the comparison principle if for a subsolution u and supersolution v we have u < v.

Note that if the comparison principle is satisfied, then a viscosity solution is unique.

Theorem 3 Suppose that H : Ej x Rd ^ R is given by (2.2) and that the family of functions v+, v- : Ej ^ R+, 1 < i < d, satisfy the conditions of Theorem 1.

Then, for every k > 0 and h e C(Ej), the comparison principle holds for f (x) -kH(x, V f (x)) - h(x) = 0.

Theorem 4 Suppose that H : E2 x Rd ^ R is given by (2.4) and that function v :{1,...,d }x{1,...,d }x E2 ^ R+ satisfies the conditions of Theorem 2.

Then, for every k > 0 and h e C (E2), the comparison principle holds for f (fa) -kH(fa, V f (fa)) - h(fa) = 0.

The main consequence of the comparison principle for the Hamilton-Jacobi equations stems from the fact, as we will see below, that the operator H generates a strongly continuous contraction semigroup on C (E).

The proof of the LDP is, in a sense, a problem of semigroup convergence. At least for linear semigroups, it is well known that semigroup convergence can be proven via the convergence of their generators. The main issue in this approach is to prove that the limiting generator H generates a semigroup. It is exactly this issue that the comparison principle takes care of.

Hence, the independent interest of the comparison principle comes from the fact that we have semigroup convergence whatever the approximating semigroups are, as long as their generators converge to H, i.e. this holds not just for the specifically chosen approximating semigroups that we consider in Sect. 3.

2.4 A Lyapunov Function for the Limiting Dynamics

As a corollary to the large deviation results, we show how to obtain a Lyapunov function for the solutions of

x (t) = F(x (t)), (2.6)

where F(x) := Hp(x, 0) for a Hamiltonian as in (2.4) or (2.2). Here Hp(x, p) is interpreted as the vector of partial derivatives of H in the second coordinate.

We will see in Example 3 that the trajectories solving this differential equation are the trajectories with 0 Lagrangian cost: x = F(x) if and only if L(x, x) = 0. Additionally, the limiting operator (A, C1 (E)) obtained by

sup |Anf (x) - Af (x)|^0

xeEn nK

for all f e C1 (E) and compact sets K C E has the form by Af (x) = (Vf (x), F(x)) for the same vector field F. This implies that the 0-cost trajectories are solutions to the McKean-Vlasov equation (2.6). Solutions to 2.6 are not necessarily unique, see Example 3. Uniqueness holds for example under a one-sided Lipschitz condition: if there exists M > 0 such that (F(x) - F(y), x - y) < M|x - y |2 for all x, y e E.

For non-interacting systems, it is well known that the relative entropy with respect to the stationary measure is a Lyapunov function for solutions of (2.6). The large deviation principle explains this fact and gives a method to obtain a suitable Lyapunov function, also for interacting dynamics.

Proposition 1 Suppose the conditions for Theorems 1 or 2 are satisfied. Suppose there exists measures vn e P (En) C P (E) that are invariant for the dynamics generated by An. Furthermore, suppose that the measures vn satisfy the large deviation principle on E with good rate function I0.

Then I0 is increasing along any solution ofx(t) = F(x(t)).

Note that we do not assume that (2.6) has a unique solution for a given starting point.

2.5 Examples

We give a series of examples to show the extent of Theorems 1 and 2.

For the Ehrenfest model, we start with the basic case, of spins flipping under the influence of some mean-field potential.

Example 1 To be precise, fix some continuously differentiate V : [-1, 1]d ^ R and set for every n > 1 and i e {1,..., d} the rates

r+i(x) = exP r-i(x ) = exP

V(x + 2e) - V(x)) y(x - 2e) - y(x))

The limiting objects v+ and v- are given by

v+ x) = e-ViV (x\ v-(x) = eyiV (x\

which already have the decomposition as required in the conditions of the Theorem 1. For example, condition (b) for v+ is satisfied by

v+,,,tX) := , v+(x) := e-ViV(x>.

For d = 1, we give two extra notable examples, the first one exhibits unbounded jump rates for the individual spins if the empirical magnetisation is close to one of the boundary points. The second example shows a case where we have multiple trajectories y with I (y ) = 0 that start from xo = 0.

As d = 1, we drop all sub- and super-scripts i e{1,..., d} for the these two examples.

Example 2 Consider the one-dimensional Ehrenfest model with

rn,+(x) = A n, rn,-(x) = . A n.

VI + x

Set v+ (x) = V1 - x, v- (x) = V1 + x. By Dini's theorem, we have

x e[-1,1]

'-rn,+(x) - v+(x)

0, sup x e[-1,1]

rn,-(x) - v-(x)

And additionally, conditions (a) and (b) of Theorem 1 are satisfied, e.g. take u+j^(x) = V1 - x, v+i1ii(x) = 1.

Example 3 Consider the one-dimensional Ehrenfest model with some rates rn,+, rn - and functions v+(x) > 0, v-(x) > 0suchthat| (1-x)rn,+(x) ^ v+ (x) and 1 (1+x)rn,-(x) ^ v-(x) uniformly in x e [-1, 1].

Now suppose that there is a neighbourhood U of 0 on which v+, v- have the form

v+(x ) =

1 + -/x x > 0,

x < 0,

v-(x ) = 1.

Consider the family of trajectories t ^ ya (t), a > 0, defined by

Ya (t) :=

for t < a,

(t - a)2 for t > a.

Let T > 0 be small enough such that yo(t) e U, and hence ya (t) e U, for all t < T. A straightforward calculation yields ^ L(ya (t), ya (t))dt = 0 for all a > 0. So we find multiple trajectories starting at 0 that have zero Lagrangian cost.

Indeed, note that L(x, v) = 0 is equivalent to v = Hp(x, 0) = 2 [v+(x) - v-(x)] = 2*J(x). This yields that trajectories that have 0 Lagrangian cost are the trajectories, at least in U, that solve _

Y (t) = 2yYo

which is the well-known example of a differential equation that allows for multiple solutions.

We end with an example for Theorem 2 and Proposition 1 in the spirit of Example 1.

Example 4 (Glauber dynamics for the Potts-model) Fix some continuously differentiable function V : Rd ^ R. Define the Gibbs measures

e-V (pn (a)) vn (da) := ---P(da)

on {1,..., d}n, where P®,n is the n-fold product measure of the uniform measure P on {1,...,d} and where Zn are normalizing constants.

Let S(p | P) denote the relative entropy of p e P({1, ..., d}) with respect to P:

S(p | P) = X log(dp(a))p(a).

By Sanov's theorem and Varadhan's lemma, the empirical measures under the laws vn satisfy a LDP with rate function I0(p) = S(p | P) + V(p).

Now fix some function r :{1,...,d}x{1,..., dR+. Set

rn(a, b, p) = r (a, b) exp {-n2-1 (V (p - n-1Sa + n-15b) - V(p))} .

As n goes to infinity, we have uniform convergence of p(a)rn (a, b, p) to

v(a, b, p) := p(a)r (a, b) exp

2VaV(p) - 2VbV(p)

where Va V (p) is the derivative of V in the ath coordinate. As in Example 1, condition (b) of Theorem 2 is satisfied by using the obvious decomposition.

By Proposition 1, we obtain that S(p | P) + V (p) is Lyapunov function for

pp(a) = ^^ [v(b, a, p) — v(a, b, p)] a e{1,..., d}.

2.6 Discussion and Comparison to the Existing Literature

We discuss our results in the context of the existing literature that cover our situation. Additionally, we consider a few cases where the LDP is proven for diffusion processes, because the proof techniques could possibly be applied in this setting.

2.6.1 LDP: Approach Via Non-interacting Systems, Varadhan's Lemma and the Contraction Principle

In [3,13,26], the first step towards the LDP of the trajectory of some mean-field statistic of n interacting particles is the LDP for non-interacting particles on some large product space obtained via Sanov's theorem. Varadhan's lemma then gives the LDP in this product space for interacting particles, after which the contraction principle gives the LDP on the desired trajectory space. In [13,26], the set-up is more general compared to ours in the sense that in

[26] the behaviour of the particles depends on their spatial location, and in [13] the behaviour of a particle depends on some external random variable.

On the other hand, systems as in Example 2 fall outside of the conditions imposed in the three papers, if we disregard spatial dependence or external randomness.

The approach via Varadhan's lemma, which needs control over the size of the perturbation, does not work, at least naively, for the situation where the jump rate for individual particles is diverging to x, or converging to 0, if the mean is close to the boundary, see Remark 1.

2.6.2 LDP: Explicit Control on the Probabilities

For another approach considering interacting spins that have a spatial location, see [8]. The jump rates are taken to be explicit and the LDP is proven via explicit control on the Radon-Nikodym derivatives. This method should in principle work also in the case of singular v. The approach via the generators Hn in this paper, avoids arguments based on explicit control. This is an advantage for processes where the functions rn and v are not very regular. Also in the classical Freidlin-Wentzell approach [24] for dynamical systems with Gaussian noise the explicit form of the Radon-Nikodym derivatives is used to prove the LDP.

2.6.3 LDP: Direct Comparison to a Process of Independent Particles

The main reference concerning large deviations for the trajectory of the empirical mean for interacting diffusion processes on Rd is [14]. In this paper, the large deviation principle is also first established for non-interacting particles. An explicit rate function is obtained by showing that the desired rate is in between the rate function obtained via Sanov's theorem and the contraction principle and the projective limit approach. The LDP for interacting particles is then obtained via comparing the interacting process with a non-interacting process that has a suitably chosen drift. For related approaches, see [23] for large deviations of interacting jump processes on N, where the interaction is unbounded and depends on the average location of the particles. See [4] for mean-field jump processes on Rd.

Again, the comparison with non-interacting processes would fail in our setting due the singular interaction terms.

2.6.4 LDP: Variational Representation ofPoisson Random Measure

A proof of the large deviation principle for mean-field interacting jump processes has been given recently in [19]. The setting is similar to that of Theorem 2, but the proof of [19] allows for the possibility of more particles changing their state at the same time. The result is based on a variational representation for the Poisson random measure that can be used to establish bounds for trajectories in the interior of the simplex and perturbation arguments that show that trajectories that hit the boundary can be sufficiently well approximated by trajectories in the interior. For these arguments it is assumed that the rates are Lipschitz and ergodic. These are two conditions that are not necessary for our proof. On the other hand, the proof of the comparison principle using the methods from this paper fails in the context where multiple particles can change their state at the same time.

2.6.5 LDP: Proof Via Operator Convergence and the Comparison Principle

Regarding our approach based on the comparison principle, see Feng and Kurtz [22, Sect. 13.3], for an approach based on the comparison principle in the setting of Dawson and Gärtner

[14] and Budhiraja et al. [5]. See Deng et al. [16] for an example of large deviations of a diffusion processes on (0, w) with vanishing diffusion term with singular behaviour at the boundary. The methods to prove the comparison principle in Sects. 9.2 and 9.3 in [22] do not apply in our setting due to the different nature of our Hamiltonians.

2.6.6 LDP: Comparison of the Approaches

The method of obtaining exponential tightness in [22], and thus employed for this paper, is via density of the domain of the limiting generator (H, D(H)). Like in the theory of weak convergence, functions f e D(H) in the domain of the generator, and functions fn e D(Hn) that converge to f uniformly, can be used to bound the fluctuations in the Skorokhod space. This method is similar to the approaches taken in [9,14,24].

The approach using operator convergence is based on a result by Feng and Kurtz, analogous to the projective limit theorem, that allows one, given exponential tightness on the Skorokhod space, to establish a LDP via the large deviation principle for all finite dimensional distributions. This is done via the convergence of the logarithmic moment generating functions for the finite dimensional distributions. The Markov property reduces this to the convergence of the logarithmic moment generating function for time 0 and convergence of the conditional moment generating functions, that form a semigroup Vn (t) f (x) = n log E[enf(Xn(t)) | Xn(0) = x]. Thus, the problem is reduced to proving convergence of semigroups Vn (t) f ^ V (t) f. As in the theory of linear semigroups, this comes down to two steps. First one proves convergence of the generators Hn ^ H. Then one shows that the limiting semigroup generates a semigroup. The verification of the comparison principle implies that the domain of the limiting operator is sufficiently large to pin down a limiting semigroup.

This can be compared to the same problem for linear semigroups and the martingale problem. If the domain of a limiting linear generator is too small, multiple solutions to the martingale problem can be found, giving rise to multiple semigroups, see Chap. 12 in [28] or Sect. 4.5 in [21].

The convergence of Vn (t) f (x) ^ V (t) f (x) uniformly in x corresponds to having sufficient control on the Doob-h transforms corresponding to the change of measures

—^ (Xn) = exp {nf (Xn (t))},

where Pn,x is the measure corresponding to the process Xn started in x at time 0. An argument based on the projective limit theorem and control on the Doob h-transforms for independent particles is also used in [14], whereas the methods in [9,24] are based on direct calculation of the probabilities being close to a target trajectories.

2.6.7 Large Deviations for Large Excursions in Large Time

A notable second area of comparison is the study of large excursions in large time in the context of queuing systems, see e.g. [2,17,18] and references therein. Here, it is shown that the rate functions themselves, varying in space and time, are solutions to a Hamilton-Jacobi equation. As in our setting, one of the main problems is the verification of the comparison principle. The notable difficulty in these papers is a discontinuity of the Hamiltonian at the boundary, but in their interior the rates are uniformly bounded away from infinity and zero.

2.6.8 Lyapunov Functions

In [6,7], Lyapunov functions are obtained for the McKean-Vlasov equation corresponding to interacting Markov processes in a setting similar to the setting of Theorem 2. Their discussion goes much beyond Proposition 1, which is perhaps best compared to Theorem 4.3 in [7]. However, the proof of Proposition 1 is interesting in its own right, as it gives an intuitive explanation for finding a relative entropy as a Lyapunov functional and is not based on explicit calculations. In particular, the proof of Proposition 1 in principle works for any setting where the path-space large deviation principle holds.

3 Large Deviation Principle Via an Associated Hamilton-Jacobi Equation

In this section, we will summarize the main results of [22]. Additionally, we will verify the main conditions of their results, except for the comparison principle of an associated Hamilton-Jacobi equation. This verification needs to be done for each individual model separately and this is the main contribution of this paper. We verify the comparison principle for our two models in Sect. 4.

3.1 Operator Convergence

Let En and E denote either of the spaces En,i, Ei or En,2, E2. Furthermore, denote by C (E) the continuous functions on E and by C1 (E) the functions that are continuously differentiable on a neighbourhood of E in Rd.

Assume that for each n e N, we have a jump process Xn on En, generated by a bounded infinitesimal generator An. For the two examples, this process is either xn or pn. We denote by (5"n(t)}t>0 the transition semigroups Sn(t) f (y) = E [ f (Xn(t)) | Xn(0) = y] on C(En). Define for each n the exponential semigroup

Vn (t) f (y) := 1 log Sn(t)enf (y) = 1 log E \enf(Xn| Xn(0) = yl . nn

As in the theory of weak convergence, given that the processes Xn satisfy a exponential compact containment condition on the Skorokhod space, which in this setting is immediate, [22] show that the existence of a strongly continuous limiting semigroup {V (t)}t>0 on C (E) in the sense that for all f e C (E) and T > 0, we have

lim sup sup |V(t) f (x) - Vn(t) f (x)| = 0.

t<TxtE„

allows us to study the large deviation behaviour of the process Xn. We will consider this question from the point of view of the generators Hn of {Vn(t)}t>0, where Hnf is defined by the norm limit of t-1 (Vn (t) f - f) as t 4. 0. Note that Hnf = n-le-nf Anenf, which for our first model yields

Hnf (x ) = X

'r'n.+ (x )

1 + xi i

+ -+-L r'n ,-(x )

exp 1 n(^f(x + 2e^ - f (x

exp \ n^f (x - 2- f (x

For our second model, we have

Hnf (p) = X l^(a)rn (a, b,p)[exp [n (f (p - n-1Sa + n-1Sb) - f (p))} - 1].

In particular, Feng and Kurtz show that, as in the theory of weak convergence of Markov processes, the existence of a limiting operator (H, D(H)), such that for all f e D(H)

lim sup |Hf (x) - Hnf (x)| = 0, (3.2)

for which one can show that (H, D(H)) generates a semigroup {V(t)}t>0 on C(E) via the Crandall-Liggett theorem, [11], then (3.1) holds.

Lemma 1 For either of our two models, assuming (2.1) or (2.3), we find that Hnf ^ Hf, as in (3.2) holds for f e C1 (E), where Hf is given by Hf (x) := H (x, V f (x)) and where H(x, p) is defined in (2.2) or (2.4).

The proof of the lemma is straightforward using the assumptions and the fact that f is continuously differentiable.

Thus, the problem is reduced to proving that (H, C J(E)) generates a semigroup. The verification of the conditions of the Crandall-Liggett theorem is in general very hard, or even impossible. Two conditions need to be verified, the first is the dissipativity of H, which can be checked via the positive maximum principle. The second condition is the range condition: one needs to show that for k > 0, the range of (1 - kH) is dense in C (E). In other words, for k > 0 and sufficiently many fixed h e C (E),we needtosolve f -kHf = h with f e C 1(E). An alternative is to solve this equation in the viscosity sense. If a viscosity solution exists and is unique, we denote it by R(k)h. Using these solutions, we can extend the domain of the operator (H, CJ(E)) by adding all pairs of the form (R(k)h, k-1(R(k)h - h)) to the graph of H to obtain an operator H that satisfies the conditions for the Crandall-Liggett theorem. This is part of the content of Theorem 5 stated below.

As a remark, note that any concept of weak solutions could be used to extend the operator. However, viscosity solutions are special in the sense that the extended operator remains dissipative.

The next result is a direct corollary of Theorem 6.14 in [22].

Theorem 5 For either of our two models, assume that (2.1) or (2.3) holds. Additionally, assume that the comparison principle is satisfied for (2.5) for all k > 0 and h e C (E). Then, the operator

H := (J I(R(k)h, k-1(R(k)h - h)^ | h e C(E)|

generates a semigroup {V(t)}t>0 as in the Crandall-Liggett theorem and we have (3.1).

Additionally, suppose that {Xn (0)} satisfies the large deviation principle on E with good rate function ¡0. Then Xn satisfies the LDP on De (R+) with good rate function I given by

I(Y) = I0(Y(0)) + sup sup ^Itk-tk_j (y(tk) | Y(tk-J)),

m 0=t0<tj< -<tm k=j

where Is(y | x) := supf eC(E) f (y) - V(s) f (x). S

Note that to prove Theorem 6.14 in [22], one needs to check that viscosity sub- and supersolutions to (2.5) exist. Feng and Kurtz construct these sub- and super-solutions explicitly, using the approximating operators Hn, see the proof of Lemma 6.9 in [22].

Proof We check the conditions for Theorem 6.14 in [22]. In our models, the maps nn : En ^ E are simply the embedding maps. Condition (a) is satisfied as all our generators An are bounded. The conditions for convergence of the generators follow by Lemma 1.

The additional assumptions in Theorems 1 and 2 are there to make sure we are able to verify the comparison principle. This is the major contribution of the paper and will be carried out in Sect. 4.

The final steps to obtain Theorems 1 and 2 are to obtain the rate function as the integral over a Lagrangian. Also this is based on results in Chap. 8 of [22].

3.2 Variational Semigroups

In this section, we introduce the Nisio semigroup V(t), of which we will show that it equals V (t) on C (E). This semigroup is given as a variational problem where one optimises a payoff f (y(t)) that depends on the state y(t) e E, but where a cost is paid that depends on the whole trajectory {y(s)}0<s<t. The cost is accumulated over time and is given by a 'Lagrangian'. Given the continuous and convex operator Hf (x) = H(x, V f (x)), we define this Lagrangian by taking the Legendre-Fenchel transform:

L(x, u) := sup {(p, u) — H(x, p)}.

As p ^ H (x, p) is convex and continuous, it follows by the Fenchel - Moreau theorem that also

Hf (x) = H(x, V f (x)) = sup {(V f (x), u) — L(x, u)}.

Using L, we define the Nisio semigroup for measurable functions f on E:

V(t) f (x) = sup f (Y(t)) — f L(y(s),y(s))ds. (3.3)

YeAC J0

Y(0)=x

To be able to apply the results from Chap. 8 in [22], we need to verify Conditions 8.9 and 8.11 of [22].

For the semigroup to be well behaved, we need to verify Condition 8.9 in [22]. In particular, this condition implies Proposition 8.13 in [22] that ensures that the Nisio semigroup is in fact a semigroup on the upper semi-continuous functions that are bounded above. Additionally, it implies that all absolutely continuous trajectories up to time T, that have uniformly bounded Lagrangian cost, are a compact set in De ([0, T]).

Lemma 2 For the Hamiltonians in (2.2) and (2.4), Condition 8.9 in [22] is satisfied.

Proof For (1),take U = Rd and set Af (x, v) = (V f (x), v). Considering Definition 8.1 in [22], if y e AC, then

f (Y(t)) — f (Y(0)) = f Af(Y(s), Y(s))ds 0

by definition of A. In Definition 8.1, however, relaxed controls are considered, i.e. instead of a fixed speed y (s), one considers a measure k e ^(Rd x R+), such that k(Rd x [0, t]) = t for all t > 0 and

f (Y (t)) - f (Y(0)) = I Af (Y(s),v)k(dv, ds). Jo

These relaxed controls are then used to define the Nisio semigroup in Eq. (8.10). Note however, that by convexity of H in the second coordinate, also L is convex in the second coordinate. It follows that a deterministic control k(dv, dt) = 5v(t)(dv)dt is always the control with the smallest cost by Jensen's inequality. We conclude that we can restrict the definition (8.10) to curves in AC. This motivates our changed definition in Eq. (3.3).

For this paper, it suffices to set T = E x Rd, so that (2) is satisfied. By compactness of E, (4) is clear.

We are left to prove (3) and (5). For (3), note that L is lower semi-continuous by construction. We also have to prove compactness of the level sets. By lower semi-continuity, it is sufficient to show that the level sets {L < c} are contained in a compact set.

Set N := HxeE {p e Rd I H(x, p) < 1}. First, we show that N has non-empty interior, i.e. there is some e > 0 such that the open ball B(0,e) of radius e around 0 is contained in N. Suppose not, then there exists xn and pn such that pn ^ 0 and for all n: H(xn, pn) = 1. By compactness of E and continuity of H, we find some x e E such that H (x, 0) = 1, which contradicts our definitions of H, where H (y, 0) = 0 for all y e E. Let (x, v) e{L < c}, then

(p, v) < L(x, v) + H(x, p) < c + 1

for all p e B(0,e) C N. It follows that v is contained in some bounded ball in Rd .Itfollows that {L < c} is contained in some compact set by the Heine-Borel theorem. Finally, (5) can be proven as Lemma 10.21 in [22] or Lemma 4.29 in [25]

The last property necessary for the equality of V (t) f and V(t) f on C (E) is the verification of Condition 8.11 in [22]. This condition is key to proving that a variational resolvent, see Eq. (8.22), is a viscosity super-solution to (2.5). As the variational resolvent is also a subsolution to (2.5) by Young's inequality, the variational resolvent is a viscosity solution to this equation. If viscosity solutions are unique, this yields, after an approximation argument that

V (t) = V(t).

Lemma 3 Condition 8.11 in [22] is satisfied. In other words, for all g e C 1(E) andx0 e E, there exists a trajectory y e AC such that y (0) = x0 and for all T > 0:

fT Hg(y(t))dt = fT (Vg(y(t)), y (t)) - L(y(t), y (t))dt. (3.4)

Proof Fix T > 0, g e C1 (E) and x0 e E. We introduce a vector field Fg : E ^ Rd, by

Fg(x) := Hp(x, Vg(x)),

where Hp (x, p) is the vector of partial derivatives of H in the second coordinate. Note that in our examples, H is continuously differentiable in the p-coordinates. For example, for the d = 1 case of Theorem 1, we obtain

Fg(x) := 2v+(x)e2Vg(x> - 2v_(x)e-2Vg(x

As Fg is a continuous vector field, we can find a local solution yg (t) in E to the differential equation

ry(t) = Fg (y(t)), Y(0) = x0,

by an extended version of Peano's theorem [10]. The result in [10] is local, however, the length of the interval on which the solution is constructed depends inversely on the norm of the vector field, see his Eq. (2). As our vector fields are globally bounded in size, we can iterate the construction in [10] to obtain a global existence result, such that yg (t) = Fg (y (t)) for almost all times in [0, x).

We conclude that on a subset of full measure of [0, T] that

L(Yg(t), Yg(t)) = L(Yg(t), Fg(Yg(t)))

= sup (p, Fg(yg(t))) — H(yg(t), p)

= sup (p, Hp(yg(t), Vg(yg(t)))) — H(yg(t), p).

By differentiating the final expression with respect to p, we find that the supremum is taken for p = Vg(Yg(t)). In other words, we find

L(yg(t), Yg(t)) = (Vg(Yg(t)), Hp(Yg(t), Vg(Yg(t)))) — H(Yg(t), Vg(yg(t))) = (Vg(Yg(t)), Yg(t))— Hg(Yg(t)).

By integrating over time, the zero set does not contribute to the integral, we find (3.4).

The following result follows from Corollary 8.29 in [22].

Theorem 6 For either of our two models, assume that (2.1) or (2.3) holds. Assume that the comparison principle is satisfied for (2.5) for all X > 0 and h e C (E). Finally, suppose that {Xn (0)} satisfies the large deviation principle on E with good rate function I0.

Then, we have V (t) f = V(t) f for all f e C (E) and t > 0. Also, Xn satisfies the LDP on De (R+) with good rate function I given by

I(Y) :=

Io(y(0)) + J0°° L(y(s), Y(s))ds if y e AC, <x if Ye AC.

Proof We check the conditions for Corollary 8.29 in [22]. Note that in our setting H = H. Therefore, condition (a) of Corollary 8.29 is trivially satisfied. Furthermore, we have to check the conditions for Theorems 6.14 and 8.27. For the first theorem, these conditions were checked already in the proof of our Theorem 5. For Theorem 8.27, we need to check Conditions 8.9, 8.10 and 8.11 in [22]. As H1 = 0, Condition 8.10 follows from 8.11. 8.9 and 8.11 have been verified in Lemmas 2 and 3.

The last theorem shows us that we have Theorems 1 and 2 if we can verify the comparison principle, i.e. Theorems 3 and 4. This will be done in the section below.

Proof of Theorems 1 and 2 The comparison principles for equation (2.5) are verified in Theorems 3 and 4. The two theorems now follow from Theorem 6. □

Proof of Proposition 1 We give the proof for the system considered in Theorem 1. Fix t > 0 and some starting point X0. Let x(t) be any solution of x(t) = F(x(t)) with x(0) = X0. We show that 10(x (t)) < 10(x0 ).

Let Xn (0) be distributed as vn. Then it follows by Theorem 1 that the LDP holds for {Xn}n>0 on De (R+).

As vn is invariant for the Markov process generated by An, also the sequence {Xn (t)}n>0 satisfies the large deviation principle on E with good rate function I0. Combining these two facts, the Contraction principle [15, Theorem 4.2.1] yields

I0(x(t)) = inf I0(Y(0)) + I L(y(s),y(s))ds

Y eAC:y(t)=x(t) J0

< I0(x(0)) + i L(x(s), x(s))ds = I0(x(0)). 0

Note that L(x(s), x(s)) = 0 for all s as was shown in Example 3. □

4 The Comparison Principle

We proceed with checking the comparison principle for equations of the type f (x) — kH(x, V f (x)) — h(x) = 0. In other words, for subsolutions u and supersolutions v we need to check that u < v. We start with some known results. First of all, we give the main tool to construct sequences xa and ya that converge to a maximising point z e E such that u(z) - v(z) = supz/eE u(z') - v(z'). This result can be found for example as Proposition 3.7 in [12].

Lemma 4 Let E be a compact subset of Rd, let u be upper semi-continuous, v lower semi-continuous and let ^ : E2 ^ R+ be a lower semi-continuous function such that ^(x, y) = 0 if and only ifx = y. For a > 0, let xa, ya e E such that

u(xa) - v(ya) - a^(xa, ya) = sup {u(x) - v(y) - a^(x, y)}.

x ,yeE

Then the following hold

(i) lima^^ a^(xa, ya) = 0.

(ii) All limit points of (xa, ya) are of the form (z, z) and for these limit points we have u(z) - v(z) = supxeE {u(x) - v(x)}.

We say that ^ : E2 ^ R+ is a good penalization function if ^(x, y) = 0 if and only if x = y, it is continuously differentiable in both components and if (Vy))(x) = -(V^(x, •))(y) for all x, y e E. The next two results can be found as Lemma 9.3 in [22]. We will give the proofs of these results for completeness.

Proposition 2 Let (H, D(H)) be an operator such that D(H) = Cx(E) of the form Hf (x) = H(x, V f (x)). Let u be a subsolution and v a supersolution to f (x) -kH(x, V f (x)) - h(x) = 0, for some k > 0 and h e C(E). Let ^ be a good penalization function and let xa, ya satisfy

u(xa) - v(ya) - a^(xa, ya) = sup {u(x) - v(y) - a^(x, y)}.

x ,yeE

Suppose that

liminf H (xa,a(W(; ya))(xa)) - H (ya, a(Vya))(xa)) < 0,

then u < v. In other words, f (x) - kH(x, V f (x)) - h(x) = 0 satisfies the comparison principle.

Proof Fix X > 0 and h e C (E). Let u be a subsolution and v a supersolution to

f (x) — XH(x, V f (x)) — h(x) = 0. (4.1)

We argue by contradiction and assume that S := supxeE u(x) — v(x) > 0. For a > 0, let xa, ya be such that

u(xa) — v(ya) — a^(xa, ya) = sup {u(x) — v(y) — a^(x, y)}.

x ,yeE

Thus Lemma 4 yields a^(xa, ya) ^ 0 and for any limit point z of the sequence xa, we have u(z) — v(z) = supxeEu(x) — v(x) = S > 0. It follows that for a large enough,

u(xa) — v(ya) > JS.

For every a > 0, the map ®a(x) := v(ya) + a^(x, ya) is in C 1(E) and u(x) — ®a(x) has a maximum at xa. On the other hand, &a( y) := u(xa) — a^(xa, y) is also in C1 (E) and v(y) — ®a(y) has a minimum at ya .As u is a sub- and v a super solution to (4.1), we have

u ( x a ) — h ( x a )

■ < H(xa,a(VV(■, ya))(xa))

^ —Xh(^ > H(ya, —a(W(xa, ■ ))(ya))

= H(ya,a(VV(■, ya))(xa))

where the last equality follows as ^ is a good penalization function. It follows that for a large enough, we have

S u ( x a ) — v( y a )

0 < _ < .±a)-^ (4.2)

2X ~ X

u (xa) — h(xa) v(ya) — h(ya) 1

= -X---X- + X — ya))

< H(xa, a(V■ , ya))(xa)) — H(ya, a(V■ , ya))(xa)) + 1 (h(xa) — h(ya))

As h is continuous, we obtain lima^TO h(xa) — h(ya) = 0. Together with the assumption of the proposition, we find that the liminf as a ^wof the third line in (4.2) is bounded above by 0, which contradicts the assumption that S > 0. □

The next lemma gives additional control on the sequences xa, ya.

Lemma 5 Let (H, D(H)) be an operator such that D(H) = C1 (E) of the form Hf (x) = H (x, V f (x)). Let u be a subsolution and v a supersolution to f (x )—X H (x, V f (x ))—h(x) = 0,forsome a > 0 andh e C (E).Let^ be a good penalization function and let xa, ya satisfy

u(xa) — v(ya) — a^(xa, ya) = sup {u(x) — v(y) — a^(x, y)}.

x , ye E

Then we have that

supH (ya, a(V■ , ya))(xa)) < w. (4.3)

Proof Fix X > 0, h e C (E) and let u and v be sub- and super-solutions to f (x) — XH(x, f (x)) — h(x) = 0. Let ^ be a good penalization function and let xa, ya satisfy

u(xa) — v(ya) — a^(xa, ya) = sup {u(x) — v(y) — a^(x, y)}.

x , ye E

As ya is such that

v(ya) - (u(xa) - ^(xa, ya)) = inf v(y) - (u (xa) - V(xa, y)) ,

and v is a super-solution, we obtain

v(ya) - h(ya)

H (ya, -a(VV(xa, •))(ya)) < ^\ ^

As V is a good penalization function, we have -(VV(xa, •))(ya) = (V^(-, ya))(xa). The boundedness of v now implies

1 II v - h ||

sup H (ya, a(Vya))(xa)) < ~ (v(ya) - h(ya)) < --- < TO.

4.1 One-Dimensional Ehrenfest Model

To single out the important aspects of the proof of the comparison principle for Eq. (2.5), we start by proving it for the d = 1 case of Theorem 1.

Proposition 3 Let E = [-1, 1] and let

H(x, p) = v+(x) [e2p - 1] + v-(x) [e-2p - 1], where v+, v- are continuous and satisfy the following properties:

(a) v+ (x) = 0 for all x or v+ satisfies the following properties:

(i) v+(x) > 0 for x = 1.

(ii) v+ (1) = 0 and there exists a neighbourhood U\ of 1 on which there exists a decomposition v+(x) = v+,-f(x)v+^(x) such that is decreasing and where is continuous and satisfies v+,^(1) = 0.

(b) v- (x) = 0 for all x or v- satisfies the following properties:

(i) v-(x) > 0 for x = -1.

(ii) v+(-1) = 0 and there exists a neighbourhood U- of 1 on which there exists a decomposition v-(x) = v-,^(x)v-i\$(x) such that v-,f is increasing andwhere v-,\$ is continuous and satisfies v-(-1) = 0.

Let k > 0 and h e C (E). Then the comparison principle holds for f (x) - k H (x, V f (x)) -h(x) = 0.

Proof Fix k > 0, h e C (E) and pick a sub- and super-solutions u and v to f (x) -kH(x, V f (x)) - h(x) = 0. We check the condition for Proposition 2. We take the good penalization function V(x, y) = 2-1(x - y)2 and let xa, ya satisfy

a 2 i a

u(xa) - v(ya) --|xa - ya I = sup u(x) - v(y) -- |x - y| .

2 x ,yeE 1 2 '

We need to prove that

liminf H (xa,a(xa - ya)) - H (ya, a (xa - ya)) < 0. (4.4)

By Lemma 4, we know that a |xa - ya |2 ^ 0 as a ^ to and any limit point of (xa , ya) is of the form (z, z) for some z such that u(z) - v (z) = maxz/eE u (z') - v (z'). Restrict a to the

sequence a e N and extract a subsequence, which we will also denote by a, such that a — x xa and ya converge to some z. The rest of the proof depends on whether z = — 1, z = 1 or z e (-1, 1).

First suppose that z e (-1, 1). By Lemma 5, we have

sup v+(ya) [e2a(xa-ya) - 1] + v-(ya) [e-2a(x°-ya) - 1] < X.

As ec - 1 > -1, we see that the limsup of both terms of the sum individually are bounded as well. Using that ya — z e (-1, 1), and the fact that v+, v- are bounded away from 0 on a closed interval around z, we obtain from the first term that supa a (xa - ya) < x and from the second that supa a(y a - xa) < X. We conclude that a(xa - ya) is a bounded sequence. Therefore, there exists a subsequence a(k) such that a(k)(xa(k) - ya(k)) converges to some po. We find that

liminf H(xa, a(xa - ya)) - H(ya, a(xa - ya))

< lim H(xa(k),a(xa(k) - ya(k)) - H(ya(k),a(xa(k) - ya(k)))

= H(z, po) - H(z, po) = 0.

We proceed with the proof in the case that xa, ya —^ z = — 1. The case where z = 1 is proven similarly. Again by Lemma 5, we obtain the bounds

v+(ya) \e2a(Xa-ya) - 1] < (X>, sup v-(ya) [e-2a(x«-ya) - ^ < œ. (4.5)

As v+ is bounded away from 0 near — 1, we obtain by the left hand bound that supa a (xa — ya) < <Xi. As in the proof above, it follows that if a\xa — ya | is bounded, we are done. This leaves the case where there exists a subsequence of a, denoted by a(k), such that a(k)(ya(k) — xa(k)) ^ x. Then clearly, e2a(k)(Xa(k)—ya(k)) — 1 is bounded and contains a converging subsequence. We obtain as in the proof where z e (—1, 1) that

liminf H(Xa,a(Xa — ya)) — H(ya,a(Xa — ya))

= limixf [v+(Xa) — v+(ya)] [e2a(Xa—ya) — 1]

+ [v— (Xa) — v—(ya)] [e2a(ya —Xa) — 1]

< liminf [v—(Xa(k)) — v—(ya(k))] \e2a(k)(ya(k)—Xa(k)) — Л . k^x L J

Note that as a(k)(ya(k) — Xa(k)) ^ x, we have ya(k) > Xa(k) > — 1, which implies v—(ya(k)) > 0. Also for k sufficiently large, ya(k), Xa(k) e U—1. Thus, we can write

[v-(xa(k)) - v-(y«(k))] [e2a(k)(y«(k)-xa(k)) - l]

-(y«(k)) [e2a(k)(ya(k)-Xa(k)) - ^ .

V-,î(Xa(k)) v-,\$(x«(k)) _ 1

.V-,t(ya(k)) V-,\$(ya(k)) By the bound in (4.5), and the obvious lower bound, we see that the non-negative sequence

uk := v-(ya(k)) [e2a^ya(k)-xa(k)^ - 1]

contains a converging subsequence u# ^ c. As ya(k) > xa(k) and v- ,i is increasing:

limsup 1(xa(k)) V-. t (-M.)) , ^limsup Vh!^) (lim V-!^) k V-.i(ya(k))V-.t (ya(k)) V. k V-.l(ya(k))/\ k V-,t(ya(k)) )

< V-.t(-D

" V-.t(-1)

As a consequence, we obtain

'V-(Xa(k))

lim inf

(yarn) [e2a(kKy«(k)-Mk)) - ij

< flimsuJt(Xa(k)) ^(Xa(k)) - l]) fliminf uk,) < 0. V k L^-,t(ya(k))v-,\$(ya(k)) \) \ k' )

.V-(ya(k))

'v-,tfa(k)) v-,\$(xa(k))

.v-,t(ya(k)) V-,\$(ya(k)) This concludes the proof of (4.4) for the case that z = -1. □

4.2 Multi-dimensional Ehrenfest Model

Proof of Theorem 3 Let u be a subsolution and v a supersolution to f (x ) - k H (x, V f (x )) -h(x) = 0. As in the proof of Proposition 3, we check the condition for Proposition 2. Again, for a g N let xa, ya satisfy

a 2 i a 21

u(xa) - V(ya) --|xa - ya | = sup U(x) - v(y) -- |x - y| .

2 x 2 J

and without loss of generality let z be such that xa, ya ^ z.

Denote with xaj and ya,i the i th coordinate of xa respectively ya. We prove

liminf H (xa,a(xa - ya)) - H (ya, a(xa - ya))

= limœf Z f [v+ (xa) - V+ (ya)] [ea(xa-i-yai} - l]

+ [v- (xa) - V-(ya)] [ea(ya-i -xa-i) - l]

by constructing a subsequence a(n) ^ to such that the first term in the sum converges to 0. From this sequence, we find a subsequence such that the second term converges to zero, and so on.

Therefore, we will assume that we have a sequence a(n) ^ to for which the first i - 1 terms of the difference of the two Hamiltonians vanishes and prove that we can find a subsequence for which the i th term

[v+ (Xa) - V+ (ya)] [ea(Xa.i-ya i) - l] + [v- (-a) - V-(ya)] [ea(ya • i --a. i) - l] (4.6)

vanishes. This follows directly as in the proof of Proposition 3, arguing depending on the situation zi e (-1, 1), Zi = -1 or zi = -1. □

4.3 Mean Field Markov Jump Processes on a Finite State Space

The proof of Theorem 4 follows along the lines of the proofs of Proposition 3 and Theorem 3. The proof however needs one important adaptation because of the appearance of the difference pb - pa in the exponents of the Hamiltonian.

Naively copying the proofs using the penalization function ^(p, v) = 1 ^a(p(a) — v(a))2 one obtains by Lemma 5, for suitable sequences pa and va, that

sup v(a, b, va) \ea((pa(b)—va(b))—(pa(a)—va(a))) — i"| < ^^

a L -I

One sees that the control on the sequences a(va(a) — pa(a)) obtained from this bound is not very good, due to the compensating term a(pa (b) — va (b)).

The proof can be suitably adapted using a different penalization function. For x e R, let x— := x A 0 and x + = x V 0. Define ^(p, v) = 2 Xa((p(a) — v(a))—)2 = 2 £a((v(a) — p(a))+)2. Clearly, ^ is differentiable in both components and satisfies (V^(-, v))(p) = — (V ^(p, ■))(v). Finally, using the fact that ^ p(i) = X> v(i) = 1, we find that ^(p, v) = 0 implies that p = v. We conclude that ^ is a good penalization function. The bound obtained from Lemma 5 using this ^ yields

sup v(a, b, va) \ea((p«(b)—v«(b))——(p«(a)—v«(a))—) — l] < x. a

We see that if (pa(b) — va(b)) — (pa (a) — va(a)) ^ x it must be because a(va(a) — pa(a)) ^ x. This puts us in the position to use the techniques from the previous proofs.

Proof of Theorem 4 Set ^(p, v) = 1 ((p(a) — v(a))—)2, as above. We already noted that ^ is a good penalization function.

Let u be a subsolution and v be a supersolution to f (p) — XH(p, V f (p)) — h(p) = 0. For a e N, pick pa and va such that

u(pa) — v(va) — a^(pa,va) = sup {u(p) — v(v) — a^(p,v)}

Furthermore, assume without loss of generality that pa,va ^ z for some z such that u (z) — v(z) = supz/eE u(z') — v(z'). By Proposition 2, we need to bound

H(pa,a(V&(., va))(pa)) — H(va, a(V®(pa, •))(pa))

= ^ [v(a, b, pa) — v(a, b, va)] \ea((pa(b)—va(b))-— (pa(a)—va(a))-) — ij . (4 7) a,b

As in the proof of Theorem 3, we will show that each term in the sum above can be bounded above by 0 separately. So pick some ordering of the ordered pairs (i, j), i, j e {1,...,n} and assume that we have some sequence a such that the liminfof the first k terms in Eq. (4.7) are bounded above by 0. Suppose that (i, j) is the pair corresponding to the k + 1th term of the sum in (4.7).

Clearly,if v(i, j,n) = 0foralln then we are done. Therefore, we assume that v(i, j,n) = 0 for all n such that n(i) > 0.

In the case that pa, va ^ n *,wheren *(i) > 0, we know by Lemma 5,usingthatv(i, j, •) is bounded away from 0 on a neighbourhood of n *, that

a((Pa(j)-Va(j)) -(pa(i)-Va(i)) ) _ j

Picking a subsequence a(n) such that this term above converges and using that n ^ v(i, j, n) is uniformly continuous, we see

liminf [v(i, j, Ha) - v(i, j, va)] \ea((H°(j)-v«(j))--(h*(1)-v*(i))-) - ll a^TO L J

= lim [v(i, j,Ha(n)) - v(i, j,Va(n))]

n^TO L

ea(n)[{pa(n)U )-va(n) (j )y-(Pa(n)(> )-Va(n)(i))~^ _ 1 = 0

For the second case, suppose that Ha (i), va (i) ^ 0. By Lemma 5, we get

sup v(i, j, va) \ea(Mj)-Va(j))--(^a(i)-Va(i))-) - ^ < (4.8)

a L -I

First of all, if supa a ((pa(j) - va(j))- - (Ha(i) - va(i))- < to, then the argument given above also takes care of this situation. So suppose that this supremum is infinite. Clearly, the contribution (Ha(j) - va(j))- is negative, which implies that supa a (va(i) - pa(i))+ = to. This means that we can assume without loss of generality that

a(va(i) - Ha(i)) ^TO, va(i) > Ha(i)■ (4.9)

We rewrite the term a = i, b = j in Eq. (4.7) as

„a((pa(j )-va(j))-

v(i, j, Ha) _ 1

j(i, j, Ma) |^a((Ma(j )-va(j)) -(Ha(i )-va(i)) ) - lj

. v(i, j, va)

The right hand side is bounded above by (4.8) and bounded below by -1, so we take a subsequence of a, also denoted by a, such that the right hand side converges. Also note that for a large enough the right hand side is non-negative. Therefore, it suffices to show that

. fv(i, j, Ha) 1 liminf- < 1,

a^TO v(l, j, va)

which follows as in the proof of Proposition 3. □

Acknowledgments The author is supported by The Netherlands Organisation for Scientific Research (NWO), Grant No. 600.065.130.12N109. The author thanks Frank Redig and Christian Maes for helpful discussions. Additionally, the author thanks anonymous referees for suggestions that improved the text.

References

1. Adams, A., Dirr, N., Peletier, M., Zimmer, J.: Large deviations and gradient flows. Philos. Trans. R. Soc. Lond. A 371, 20120341 (2013)

2. Atar, R., Dupuis, P.: Large deviations and queueing networks: methods for rate function identification. Stoch. Process. Appl. 84(2), 255-296 (1999). doi:10.1016/S0304-4149(99)00051-4

3. Borkar, V.S., Sundaresan, R.: Asymptotics of the invariant measure in mean field models with jumps. Stoch. Syst. 2(2), 322-380 (2012). doi:10.1214/12-SSY064

4. Boualem, D., Ingemar, K.: The rate function for some measure-valued jump processes. Ann. Probab. 23(3), 1414-1438 (1995). http://www.jstor.org/stable/2244879

5. Budhiraja, A., Dupuis, P., Fischer, M.: Large deviation properties of weakly interacting processes via weak convergence methods. Ann. Probab. 40(1), 74-102 (2012). doi:10.1214/10-AOP616

6. Budhiraja, A., Dupuis, P., Fischer, M., Ramanan, K.: Limits of relative entropies associated with weakly interacting particle systems. Electron J Probab 20(80), 1-22 (2015a). doi:10.1214/EJP.v20-4003. http:// ejp.ejpecp.org/article/view/4003

7. Budhiraja, A., Dupuis, P., Fischer, M., Ramanan, K.: Local stability of Kolmogorov forward equations for finite state nonlinear Markov processes. Electron. J. Probab. 20(81), 1-30 (2015b). doi:10.1214/EJP. v20-4004. http://ejp.ejpecp.org/article/view/4004

8. Comets, F.: Nucleation for a long range magnetic model. Ann. Inst. H. Poincaré Probab. Stat. 23(2), 135-178 (1987)

9. Comets, F.: Large deviation estimates for a conditional probability distribution. Applications to random interaction Gibbs measures. Probab. Theory Relat. Fields 80(3), 407-432 (1989)

10. Crandall, M.G.: A generalization of Peano's existence theorem and flow invariance. Proc. Am. Math. Soc. 36, 151-155 (1972)

11. Crandall, M.G., Liggett, T.M.: Generation of semi-groups of nonlinear transformations on general banach spaces. Am. J. Math. 93(2), 265-298 (1971)

12. Crandall, M.G., Ishii, H., Lions, P.L.: User's guide to viscosity solutions of second order partial differential equations. Bull. Am. Math. Soc. New Ser. 27(1), 1-67 (1992). doi:10.1090/S0273-0979-1992-00266-5

13. Pra, Dai: P., den Hollander, F.: Mckean-vlasov limit for interacting random processes in random media. J. Stat. Phys. 84(3-4), 735-772 (1996). doi:10.1007/BF02179656

14. Dawson, D.A., Gärtner, J.: Large deviations from the McKean-Vlasov limit for weakly interacting diffusions. Stochastics 20(4), 247-308 (1987)

15. Dembo, A., Zeitouni, O.: Large Deviations Techniques and Applications, 2nd edn. Springer, New York (1998)

16. Deng, X., Feng, J., Liu, Y.: A singular 1-D Hamilton-Jacobi equation, with application to large deviation of diffusions. Commun. Math. Sci. 9(1), 289-300 (2011)

17. Dupuis, P., Ellis, R.S.: The large deviation principle for a general class of queueing systems. I. Trans. Am. Math. Soc. 347(8), 2689-2751 (1995). doi:10.2307/2154753

18. Dupuis, P., Ishii, H., Soner, H.M.: A viscosity solution approach to the asymptotic analysis of queueing systems. Ann. Probab. 18(1), 226-255 (1990). http://www.jstor.org/stable/2244236

19. Dupuis, P., Ramanan, K., Wu, W.: Large deviation principle for finite-state mean field interacting particle systems. Preprint (2016). arXiv:1601.06219

20. Ermolaev, V., Külske, C.: Low-temperature dynamics of the Curie-Weiss model: periodic orbits, multiple histories, and loss of Gibbsianness. J. Stat. Phys. 141(5), 727-756 (2010). doi:10.1007/ s10955-010-0074-x

21. Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence. Wiley, Hoboken (1986)

22. Feng, J., Kurtz, T.G.: Large Deviations for Stochastic Processes. American Mathematical Society, Providence (2006)

23. Feng, S.: Large deviations for empirical process of mean-field interacting particle system with unbounded jumps. Ann. Probab. 22(4), 2122-2151 (1994)

24. Freidlin, M., Wentzell, A.: Random Perturbations of Dynamical Systems, 2nd edn. Springer, Berlin (1998)

25. Kraaij, R.: Large deviations of the trajectory of empirical distributions of Feller processes on locally compact spaces. Preprint (2014). arXiv:1401.2802

26. Léonard, C.: Large deviations for long range interacting particle systems with jumps. Ann. Inst. H. Poincaré (B) Probab. Stat. 31(2), 289-323 (1995)

27. Mielke, A., Peletier, M., Renger, D.: On the relation between gradient flows and the large-deviation principle, with applications to Markov chains and diffusion. Potential Anal. 41(4), 1293-1327 (2014). doi:10.1007/s11118-014-9418-5

28. Stroock, D.W., Varadhan, S.R.S.: Multidimensional Diffusion Processes. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 233. Springer, Berlin (1979)

29. van Enter, A., Fernández, R., den Hollander, F., Redig, F.: A large-deviation view on dynamical Gibbs-non-Gibbs transitions. Moscow Math. J. 10, 687-711 (2010)