Large-Time Behavior of Finite-State Mean-Field Systems With Multiclasses

Published Online:https://doi.org/10.1287/stsy.2022.0100

Abstract

We study in this paper large-time asymptotics of the empirical vector associated with a family of finite-state mean-field systems with multiclasses. The empirical vector is composed of local empirical measures characterizing the different classes within the system. As the number of particles in the system goes to infinity, the empirical vector process converges toward the solution to a McKean-Vlasov system. First, we investigate the large deviations principles of the invariant distribution from the limiting McKean-Vlasov system. Then, we examine the metastable phenomena arising at a large scale and large time. Finally, we estimate the rate of convergence of the empirical vector process to its invariant measure. Given the local homogeneity in the system, our results are established in a product space.

Funding: This research was supported by Discovery Grant of the Natural Sciences and Engineering Research Council of Canada [NSERC 315660] and by Carleton University.

1. Introduction

Interacting particle systems with multiclasses, widely encountered in a variety of domains going from statistical physics, chemistry, communication networks, and biology to finance, have recently attracted the interest of many researchers, and several models have been proposed to understand their large-scale behavior. See, for example, Graham (2008), Collet (2014), Collet et al. (2016), Chong and Klüppelberg (2019), Knöpfel et al. (2020), Meylahn (2020), and Nguyen et al. (2020) and the references therein for an overview of recent advances on the subject. In multiclass systems, the particles come from different subpopulations, within which they are homogeneous, and thus, the entire system is heterogeneous but composed of homogeneous subpopulations. Thence, one can average over the local symmetries within the different classes to describe mean-field interactions through local empirical measures. Thus, the entire system is characterized by an empirical vector composed of the local empirical measures.

The focus of the current article is on a particular family of mean-field multiclass models describing the evolution of block-structured networks with dynamically changing multicolor nodes. The state-space here is a finite set of colors, and the particles are identified as the nodes of the network. This class of models was proposed in Dawson et al. (2020) to describe the dynamic of various physical phenomena, and the large-scale asymptotics were established. In particular, a multiclass propagation of chaos was proven to hold together with a law of large numbers, implying the convergence of the empirical vector toward the solution to a McKean-Vlasov system of equations as the total number of particles N in the system goes to infinity. Moreover, these authors studied the large deviations principle for the empirical vector process over finite time intervals.

We propose in this article to study the large-time behavior of the family of models introduced in Dawson et al. (2020). Our motivation comes from the interesting characteristics of these systems as well as the importance of their large-time behavior for many applications. Notice that numerous works on the large-time behavior of various systems of interacting particles exist in the literature. See, for example, Cox and Greven (1990), Dawson and Greven (1993; 1999), Dawson et al. (1995), Greven and den Hollander (2007), Döring and Mytnik (2013), and Kuehn (2015) and references therein. Therefore, our current contribution aims to be the continuation of the aforementioned references. The approach taken in this document is summarized as follows.

First of all, let us mention that the propagation of chaos and the law of large numbers established in Dawson et al. (2020) are valid over finite time intervals. Thence, on any finite time horizon (not too large), one could use the McKean-Vlasov limit system as an approximation for the large N-particle system because it is classical in the mean-field literature. However, when time tends to infinity, these results are no longer necessarily true, and care should be taken in using this approximation. Indeed, as we detail throughout this article, the validity of the approximation is intimately linked to the critical points of the McKean-Vlasov limit system and its stability. Intuitively, if the McKean-Vlasov limit system has several ω-limit sets, one can wonder which of these sets characterizes the large-time behavior of the large N-particle system.

As a starting point to tackle this problem, we study in Section 4 the asymptotics of the invariant measure of the empirical vector. In particular, we establish, under mild conditions, the large deviations principles for the invariant measure in two different cases, first when there exists a unique asymptotically stable equilibrium to the McKean-Vlasov system (Theorem 4) and then when the McKean-Vlasov system has multiple ω-limit sets (Theorem 5). More precisely, Theorem 4 states that when the McKean-Vlasov system has a unique globally asymptotically stable equilibrium ξ0, the value at a given state ξ of the rate function that governs the large deviations principle of the invariant measure is given by the minimum cost of transporting the system state from the globally asymptotically stable equilibrium ξ0 to ξ across all the possible paths in any time duration. Theorem 5 gives a generalization to the case where the McKean-Vlasov system has multiple ω-limit sets. To this end, one relies on the classical hypothesis of Friedlin and Wentzell (2012). Note that the large deviations principles of the invariant distribution have been established for interacting diffusions in Dawson and Gärtner (1989) and for finite-state mean-field systems on complete graphs in Borkar and Sundaresan (2012). We adopt here the control theory approach introduced in Biswas and Borkar (2011) for small noise diffusions and extended in Borkar and Sundaresan (2012) to interacting jump processes on complete graphs. Therefore, we further extend this approach to the heterogeneous case with block-structured interaction graphs.

Next, we investigate the metastable phenomena, in the sense of Friedlin and Wentzell’s (2012) small noise stochastic systems, emerging when the McKean-Vlasov limiting system has several ω-sets. Namely, in the case of multiple attractors, the empirical vector process, which is associated with a large but finite number of particles N, would transit between these attractors when the time is large. One then aims to estimate the most probable order in which these transitions occur and the average time spent in the neighborhood of each of the ω-limit sets. Understanding these phenomena is of great practical interest, and hence, our motivation. We describe in Section 5 the metastable phenomena in more detail and give important estimates. For this, we adopt the classical approaches of Freidlin and Wentzell (2012, chapter 6) and Hwang and Sheu (1990). The main ingredients are the large deviation properties of the empirical vector process over finite time periods established in Section 3, and the main tool is the Freidlin-Wentzell quasipotential derived from the rate function characterizing the large deviations principle. Subsequently, we develop in Theorem 7 an estimate of the time required for the empirical vector process to converge to its invariant measure. We find out that when the time is of the order exp{N(Λ+δ)}, for all δ>0 and Λ being an appropriate constant, the empirical vector process is very close to its invariant measure. Interestingly, this coincides with the timescale found in Hwang and Sheu (1990) for diffusion processes and in Borkar and Sundaresan (2012) for finite-state mean-field systems on complete graphs. We underline that the metastable phenomena in the Section 5 are studied under Assumption 2. Note, however, that if these assumptions are not imposed, things are more complicated, and this is not pursued here. The reader may consult Zhou et al. (2012), Bouchet et al. (2016), and Tang et al. (2017) and the references therein for discussions and examples.

It is worthwhile to mention that, although the methodology used in the current work follows the one in Borkar and Sundaresan (2012) and Yasodharan and Sundaresan (2019) based on the small-noise large deviations of diffusion processes introduced in Hwang and Sheu (1990) and Freidlin and Wentzell (2012), we emphasize that our results are established for empirical vectors and thus on product spaces. In particular, the multiclass structure of the system breaks down the homogeneity and global interaction hypothesis made in Borkar and Sundaresan (2012) and Yasodharan and Sundaresan (2019). Thus, one cannot directly rely on the results obtained in Borkar and Sundaresan (2012) and Yasodharan and Sundaresan (2019) because the global empirical measures in our current model are not expected to satisfy the law of large numbers, nor is the large deviations principle established for the global empirical measure. Our strategy to overcome the difficulties arising from the heterogeneity is through a finer-grain analysis of each local empirical measure describing each subclass.

The rest of this paper is organized as follows. In Section 2, we revisit the family of models introduced in Dawson et al. (2020). One may also consult Dawson et al. (2020; section 2) for a full detailed description together with some examples. Section 3 is dedicated to the large deviations properties of the empirical vector process over finite time intervals. We first recall the principal results of Dawson et al. (2020) and then introduce some additional results used in the following sections. Then, we prove in Section 4 our first set of the main results. Namely, Theorem 4 gives the large deviations principle for the empirical measures when the McKean-Vlasov system has a unique globally asymptotically stable equilibrium, and Theorem 5 gives the large deviations principle of the invariant measure when there are multiple ω-limit sets. In addition, we recall some important concepts from the Friedlin-Wentzell large deviations theory. We then investigate in Section 5 the metastability of the N-particles system. Based on a set of results, we provide estimates of the metastable transitions. Finally, Theorem 7 gives the time required for the empirical vector process to converge toward its invariant measure.

Because the results of Sections 4 and 5 rely on the Freidlin-Wentzell program described in Freidlin and Wentzell (2012, chapter 6), we give in Appendix A the generalization of some of these results to our current setting. Finally, to facilitate the reading, we leave the lengthy proofs of some technical results in Appendix B.

2. The Setting

Consider a graph G=(V,Ξ) composed of r blocks C1,,Cr of sizes N1,,Nr, respectively, where V is the set of the nodes and Ξ is the set of the edges. Denote by |V|=N1++Nr=N the total number of the nodes in the network. Moreover, suppose that each block Cj is a clique, that is, all the Nj nodes of the same block are connected. We divide the nodes of each block Cj into two sets:

  • The central nodes Cjc: connected to all the other nodes of the same block but not to any node from the other blocks. We set |Cjc|=Njc.

  • The peripheral nodes Cjp: connected to all the other nodes of the same block and all the peripheral nodes of the other blocks. We set |Cjp|=Njp.

Also, we denote by Nc (resp. Np) the total number of central (resp. peripheral) nodes in the graph. Notice that an example of such a graph is shown in Figure 1. Let Z={1,2,,K}N be a finite set of K colors. Suppose that each node of the graph G=(V,Ξ) is colored by one of the K colors at each time. For each 1jr and nCjc (resp. nCjp), denote by (Xn(t),t0) the stochastic jump process that describes the evolution of the color of the node n through time. Let (Z,E) be the directed graph where EZ×Z\{(z,z)|zZ} describes the set of admissible jumps. In addition, whenever (z,z)E, a node colored by z is allowed to jump from z to z at a rate that depends on the current state of the node and the state of its neighbors (adjacent nodes). To characterize these neighborhoods, we introduce, for each block 1jr, the following local empirical measures describing, respectively, the state of the central and the peripheral nodes of the j-th block at time t,

μjc,N(t)=1NjcnCjcδXn(t) andμjp,N(t)=1NjpnCjpδXn(t),(2.1)
and taking values in the set M1(Z) of probability measures over Z, endowed with the topology of weak convergence. The random dynamic in each block 1jr is thus summarized as follows:
  • The central nodes dynamic: Each central node nCjc jumps from color z to z, with (z,z)(Z,E), at rate

    λz,zc(μjc,N(t),μjp,N(t)),(2.2)
    which depends on its current state and the states of its neighbors through the empirical measures μjc,N(t) and μjp,N(t).

  • The peripheral nodes dynamic: Each peripheral node nCjp jumps from color z to z, with (z,z)(Z,E), at rate

    λz,zp(μjc,N(t),μ1p,N(t),,μrp,N(t)),(2.3)
    which depends on its state and the states of its neighbors through the local empirical measures μjc,N(t),μ1p,N(t),,μrp,N(t).

Remark 1.

Notice that the rate functions λz,zc and λz,zp depend on the number of nodes Njc and Njp within each category, but we omit this dependency to not overload the notations, because they do not play a direct role in the study conducted in this paper. In particular, the dependency is not only through the empirical measures μjc,N and μjp,N but also through the proportions of nodes of the different categories. For example, one possible dependency is described in Dawson et al. (2020) where we suppose the existence of some measurable functions γz,zj,c:ZR+ and γz,zj,p:ZR+ such that

  • For any probability measures ν,μM1(Z) and any real numbers 0<a1,a2<1 with a1+a2=1,

    λz,zj,c(ν,μ,a1,a2)=a1Zγz,zj,c(x)ν(dx)+a2Zγz,zj,p(x)μ(dx).

  • For any ν,μ1,,μrM1(Z) and any real numbers 0<a,b1,,br<1 such that a+b1++br=1,

    λz,zj,p(ν,μ1,,μr,a,b1,,br)=aZγz,zj,c(x)ν(dx)+b1Zγz,zj,p(x)μ1(dx)++brZγz,zj,p(x)μr(dx).

In such a case, the rate functions write as

λz,zj,c(μjc,N(t),μjp,N(t),NjcNj,NjpNj)=NjcNj1NjcnCjcγz,zj,c(Xn(t))+NjpNj1NjpnCjpγz,zj,p(Xn(t)),
and
λz,zj,p(μjc,N(t),μ1p,N(t),,μrp,N(t),NjcNjc+Np,N1pNjc+Np,,NrpNjc+Np)=NjcNjc+Np1NjcnCjcγz,zj,c(Xn(t))+N1pNjc+Np1N1pnC1pγz,z1,p(Xn(t))++NrpNcj+Np1NrpnCrpγz,zr,p(Xn(t)).

We make the following assumptions throughout the paper.

Figure 1. A Graph Composed of 4 Blocks With Different Numbers of Central (Gray) and Peripheral (Red) Nodes
Assumption 1.

  1. The directed graph (Z,E) is irreducible.

  2. The rate functions λz,zc and λz,zp are Lipschitz and uniformly bounded away from zero, that is, there exists c > 0 such that for all (z,z)E,λz,zc(·)c and λz,zp(·)c.

  3. For each block 1jr, there exist pjc,pjp,αj(0,1) such that, as N,

    NjNαj,NjpNjpjp,NjcNjpjc,pjp+pjc=1, andjαj=1.(2.4)

Remark 2.

Given the compactness of the state-space Z, the space M1(Z) of probability measures over Z is also compact by Prokhorov’s theorem. Therefore, the rate functions λz,zc and λz,zp are continuous because Lipschitz, and uniformly bounded from above, that is, there exists a constant C< such that for all (z,z)E, we have λz,zc(·)C and λz,zp(·)C.

3. Large Deviations of the Empirical Measures

This section gathers large deviations results of the empirical vector process over finite time intervals. We start by introducing some additional notations that will be used in the sequel. Denote by D([0,T],Z) the Skorokhod space of càdlàg functions defined on [0,T] with values in Z and by M1(D([0,T],Z)) the set of the probability measures over it. Denoting by XN=(Xn,Xm,nCjc,mCjp,1jN)D([0,T],ZN) the full description of the N particles over the finite time interval [0,T], we let MN(M1(D([0,T],Z)))2r be the vector of “historical” empirical measures defined by

MN=(M1c,N,M1p.N,,Mrc,N,Mrp,N)=(1N1cnC1cδXn,1N1pnC1pδXn,,1NrcnCrcδXn,1NrpnCrpδXn),(3.1)
where Mjc,N (resp. Mjp,N) is the historical empirical measure of the central (resp. peripheral) nodes of the j-th block. With a slight abuse of notations, denote by GN the mapping that takes the full description XN to the empirical measures vector MN, that is,
GN:(Xn,1nN)D([0,T],ZN)MN.

Thus, MN=GN(XN). Denote by PzNN the law of XN with initial condition zN=(zn,zm,nCjc,mCjp,1jr). Note that the distribution of MN depends on the initial condition only through its empirical vector defined by

νN=(νN1,c,νN1,p,,νNr,c,νNr,p)=(1N1cnC1cδzn,1N1pnC1pδzn,,1NrcnCrcδzn,1NrpnCrpδzn).(3.2)

Define by PνNN=PzNNGN1 the distribution of MN, which is the pushforward of PzNN under the mapping GN.

Recalling (2.1), consider the (M1(Z))2r-valued empirical vector process defined as

μN:t[0,T]μN(t)=(μ1c,N(t),μ1p,N(t),,μrc,N(t),μrp,N(t)).

Notice that μN(0)=νN, and μN(t) is the projection πt(MN), at time t, of MN, that is,

μN=π(MN)=π(GN(XN)).

Denote by pνNN the distribution of μN. The flow μN takes values in the product space (D([0,T],M1(Z)))2r. Also, denote by Pzn the n-th particle’s law with initial condition zn in the case of noninteraction, that is, when all of the particles are independent of each other and the color of each node changes with a constant rate equal to 1 for all allowed transitions (z,z)E, and all other transition rates are zero. Thus, the law of the entire noninteracting system is given by PzN0,N=n=1NPzn. Moreover, denote by PνN0,N=PzN0,NGN1 the distribution of the corresponding historical empirical vector MN, where νN is the initial empirical vector. Therefore, the Radon-Nikodym derivative dPνNN/dPνN0,N at any Q=(Q1c,Q1p,,Qrc,Qrp)(M1(D([0,T],Z)))2r is given by (see Dawson et al. (2020), equation (4.10)),

dPνNNdPνN0,N(Q)=exp{j=1r[NjcD([0,T],Z)h1(x,π(Qjc),π(Qjp))Qjc(dx)+NjpD([0,T],Z)h2(x,π(Qjc),π(Q1p),,π(Qrp))Qjp(dx)]}=exp{Nh(Q)},(3.3)
with
h(Q)=j=1r[NjcND([0,T],Z)h1(x,π(Qjc),π(Qjp))Qjc(dx)+NjpND([0,T],Z)h2(x,π(Qjc),π(Q1p),,π(Qrp))Qjp(dx)],(3.4)
where, for any η,ρ1,,ρr in D([0,T],M1(Z)),
h1(x,η,ρj)=0tT𝟙{xtxt}log(λxt,xtc(η(t),ρj(t)))0T(z:(xt,z)Eλxt,zc(η(t),ρj(t))1)dt,(3.5)
and
h2(x,η,ρ1,,ρr)=0tT𝟙{xtxt}log(λxt,xtp(η(t),ρ1(t),,ρr(t))(3.6)
0T(z:(xt,z)Eλxt,zp(η(t),ρ1(t),,ρr(t))1)dt.(3.7)

Equip the Skorokhod space D([0,T],M1(Z)) with the metric

ρT(μ,ν)=sup0tTρ0(μt,νt),μ,νD([0,T],M1(Z)),(3.8)
where ρ0(α,β), for α,βM1(Z), is a metric on M1(Z) that generates the weak topology on M1(Z). Moreover, define by ρ02r(·,·) the product metric that generates the weak topology on the product space (M1(Z))2r. Furthermore, let the product space (D([0,T],M1(Z)))2r be equipped with the product topology induced by the product metric ρT2r=max{ρ1T,,ρ2rT}, where ρkTρT for each 1k2r, with ρT being introduced in (3.8).

For any ξ=(ξ1c,ξ1p,,ξrc,ξrp)(M1(Z))2r, define the rate matrices

Aξj,c=(λz,zc(ξjc,ξjp))(z,z)Z×Z andAξj,p=(λz,zp(ξjc,ξ1p,ξrp))(z,z)Z×Z,  for 1jr(3.9)
where λz,zc(ξjc,ξjp)=zzλz,zc(ξjc,ξjp) and λz,zp(ξjc,ξ1p,,ξrp)=zzλz,zp(ξjc,ξ1p,,ξrp). Assuming that the initial condition μN(0)=νN converges weakly to some ν(M1(Z))2r, then from the law of large numbers (cf. Dawson et al. 2020, corollary 3.1), one can deduce that, as N, the sequence (μN,N1) converges weakly toward the solution μ of the following McKean-Vlasov system of equations
{μ˙jc(t)=Aμ(t)j,c*μjc(t),μ˙jp(t)=Aμ(t)j,p*μjp(t),μjc(0)=νjc,μjp(0)=νjp,1jr,(3.10)
where for a given matrix, A,A* is its adjunct/transpose, and μ˙(t)=tμ(t). Note that the Lipschitz property of the functions λz,zc and λz,zp guarantees that (3.10) is well-posed.

Denote by τ the log-Laplace transform of the centered Poisson distribution with parameter 1 given by τ(u)=euu1, and let τ* be its Legendre transform defined by

τ*(u)={(u+1)log(u+1)u ifu>1,1 ifu=1,+ ifu<1.(3.11)

Define, for any θM(Z),

|θ|μ(t)j,c  =supΦ:ZR{zZθ(z)·Φ(z)(z,z)Eτ(Φ(z)Φ(z))·μjc(t)(z)·λzzc(μjc(t),μjp(t))},|θ|μ(t)j,p=supΦ:ZR{zZθ(z)·Φ(z)(z,z)Eτ(Φ(z)Φ(z))·μjp(t)(z)·λzzp(μjc(t),μ1p(t),,μrp(t))},
and let us introduce, for each ν(M1(Z))2r, and according to Dawson and Gärtner (1987, equation (4.9), the functional S(μ|ν) defined from (D([0,T],M1(Z)))2r to [0,] by setting
S[0,T](μ|ν)=j=1r[αjpjc0T|μ˙jc(t)Aμ(t)j,c*μjc(t)|μ(t)dt+αjpjp0T|μ˙jp(t)Aμ(t)j,p*μjp(t)|μ(t)dt](3.12)
if μ(0)=ν and μjc,μjp are absolutely continuous in the sense of Dawson and Gärtner (1987, definition 4.1) for all 1jr, and S[0,T](μ|ν)=+ otherwise.

Finally, we introduce some spaces and topologies of interest related to the large deviations principle of the sequence of probability measures (PνNN,N1) associated with the sequence of vectors of “historical” empirical measures (MN,N1). Although this result is not presented in the current paper (cf. Dawson et al. 2020, theorem 4.2), these spaces are used in the sequel and thus are introduced here to facilitate the reading. First, consider the Polish space (X,d), where

X={xD([0,T],Z)|0tT𝟙xtxt<+,and for each t(0,T] with xtxt, we have (x(t),x(t))ε},
and the metric d is defined by
d(x,y)=dSko(x,y)+|φ(x)φ(y)|,x,yX,(3.13)
with φ(x)=0tT𝟙xtxt denoting the number of jumps and dSko standing for the Skorokhod complete metric (see Billingsley 1999, section 12). For this topology, the function φ is continuous, and two paths are close to each other if they have the same number of jumps and if they are Skorokhod-close (cf. Léonard 1995a, p. 299). The continuity of the function φ is essential to establish the LDP of (PνNN,N1); see, for example, Léonard (1995a) for a detailed development. Moreover, for any function f:XR, define
fφ=supxXf(x)1+φ(x),(3.14)
and denote
Cφ(X)={f|f:XR is continuous and fφ<},(3.15)
M1,φ(X)={QM1(X)|XφdQ<+}.(3.16)

We endow the set M1,φ(X) with the weak* topology σ(M1,φ(X),Cφ(X)), that is, the weakest topology under which QNQ as N+ if and only if

XfdQNXfdQ for each fCφ(X).

3.1. Large Deviations Over Finite Time Intervals

We recall here the large deviations principle for the sequence of probability measures (pνNN,N1) over finite time intervals.

Theorem 1.

Suppose that νNν weakly. The sequence of probability measures (pνNN,N1) obeys a large deviations principle in the space (D([0,T],M1(Z)))2r, with speed N, and rate function S[0,T](μ|ν) given by (3.12).

Moreover, if a path μ=(μjc,μjp,1jr)(D([0,T],M1(Z)))2r satisfies S[0,T](μ|ν)<, then, for 1jr,μjc and μjp are absolutely continuous, and there exist rate matrices Lj,c(t)=(lz,zj,c(t),(z,z)E) and Lj,p(t)=(lz,zj,p(t),(z,z)E), with t[0,T], such that

{μ˙jc(t)=Lj,c(t)*μjc(t),μ˙jp(t)=Lj,p(t)*μjp(t),1jr,t[0,T],(3.17)
and
j=1rαj[pjc0T((z,z)E(μjc(t)(z))λz,zc(μjc(t),μjp(t))τ*(lz,zj,c(t)λz,zc(μjc(t),μjp(t))1))dt+pjp0T((z,z)E(μjp(t)(z))λz,zp(μjc(t),μ1p(t),,μrp(t))τ*(lz,zj,p(t)λz,zp(μjc(t),μ1p(t),,μrp(t))1))dt]<.(3.18)

In such a case, there exist unique rate matrices L¯j,c(t) and L¯j,p(t) (up to almost everywhere equality with respect to j=1rαj[pjc((μjc(t)(z))λz,zc(μjc(t),μjp(t))dtdzdz+pjp((μjp(t)(z))λz,zp(μjc(t),μ1p(t),,μrp(t)))dtdzdz]) such that

j=1rαj[pjc0Tinfϕ:ZR{((z,z)E(μjc(t)(z))λz,zc(μjc(t),μjp(t))e{ϕ(z)ϕ(z)}τ*(l¯z,zj,c(t)/λz,zc(μjc(t),μjp(t))e{ϕ(z)ϕ(z)}1))}dt+pjp0Tinfϕ:ZR{((z,z)E(μjp(t)(z))λz,zp(μjc(t),μ1p(t),,μrp(t))e{ϕ(z)ϕ(z)}×τ*(l¯z,zj,p(t)/λz,zp(μjc(t),μ1p(t),,μrp(t))e{ϕ(z)ϕ(z)}1))}dt]=0,(3.19)
and the good rate function S[0,T](μ|ν) is given by the the infimum, achieved by L¯j,c(t) and L¯j,p(t), of the left-hand side of (3.18) overall rate matrices Lj,c(t) and Lj,p(t) satisfying (3.17).

Conversely, if a path μ=(μjc,μjp,1jr)(D([0,T],M1(Z)))2r satisfies the following: μ is absolutely continuous, μ(0)=ν, and there exist time-varying rate matrices Lj,c(t) and Lj,p(t) such that μ satisfies (3.17), (3.18), and (3.19), then the good rate function S[0,T](μ|ν) evaluated at μ is given by the left-hand side of (3.18).

Proof.

See Dawson et al. (2020, theorem 4.2) for the proof of the first statement. The converse statement follows by a simple generalization of Léonard (1995b, theorem 7.1). □

Remark 3.

  • The action functional S characterizes the difficulty of the passage of μN near μ in the time interval [0,T]. Indeed, according to Theorem 1, the probability of such a passage behaves like exp(NS[0,T](μ|ν)) as N+.

  • Observe from (3.18) that if the rate function S[0,T](μ|ν)=0, then μ must be the solution to the McKean-Vlasov system (3.10) with initial condition μ(0)=ν.

The following result states the uniform large deviations principle for (pνNN,N1) with respect to the initial condition ν over compact sets.

Corollary 1.

For any compact set K(M1(Z)))2r, any closed set F(D([0,T],M1(Z)))2r, and any open set G(D([0,T],M1(Z)))2r, we have

limsupN1NlogsupνKpνN(μNF)infνKinfμFS[0,T](μ|ν),(3.20)
and
liminfN1NloginfνKpνN(μNG)supνKinfμGS[0,T](μ|ν).(3.21)

Proof.

See Dembo and Zeitouni (2010, corollary 5.6.15). □

3.2. Large Deviations at Initial and Terminal Times

Fix T > 0. Recall that pνNN is the distribution of the empirical process μN(D([0,T],M1(Z)))2r, with initial conditions given by the empirical vector μN(0)=νN. Let μN(T) be the empirical measure at time T, and let pνN,TN be its distribution. The next result states the large deviations principle for the sequence (pνN,TN,N1).

Theorem 2.

Suppose that νNν weakly. The sequence of probability measures (pνN,TN,N1) obeys a large deviations principle in the space (M1(Z))2r with speed N and good rate function

ST(ξ|ν)=inf{S[0,T](μ|ν):μ(0)=ν,μ(T)=ξ}.(3.22)

Moreover, ST(ξ|ν) is bounded for all ξ,ν(M1(Z))2r, and its infimum is achieved.

Proof.

Recall that the space (D([0,T],M1(Z)))2r is equipped with the product topology induced by the product metric ρT2r=max{ρ1T,,ρ2rT}, where, for all 1k2r,

ρkT(μ,ν)=sup0tTρ0(μt,νt),μ,νD([0,T],M1(Z)).

Thus, it is easy to see that the application μ(D([0,T],M1(Z)))2rμ(T)(M1(Z))2r is continuous. Therefore, a simple application of the contraction principle (cf. Dembo and Zeitouni 2010, theorem 4.2.1) proves the validity of the large deviations principle. In addition, because ST(ξ|ν) is a good rate function, its infimum is achieved over closed sets. Finally, the boundedness follows from Lemma 1 below. □

We next state some useful technical results.

Lemma 1.

The following statements hold:

  1. There exists a constant C1(T)<+ such that, for any ξ,νM1(Z)2r, there is a piecewise linear and continuous path μ, with μ(0)=ν and μ(T)=ξ, having constant velocity in each linear segment and satisfying S[0,T](μ|ν)C1(T).

  2. For any ξ,ν(M1(Z))2r, we have ST(ξ|ν)C1(T).

  3. There exists a constant C3 such that, for each ε>0, there exists a δ(0,ε) such that ρ02r(ν,ξ)<δ implies that Sε(ξ|ν)C3ε.

Proof.

See B.1. □

Lemma 2.

Let, for 1jr,Lj,c(t) and Lj,p(t) be rate matrices such that the solution μ:[0,T](M1(Z))2r to the system

{μ˙jc(t)=Lj,c(t)*μjc(t),μ˙jp(t)=Lj,p(t)*μjp(t),1jr,t[0,T],
with μ(0)=ν satisfies S[0,T](μ|ν)<+. Then there exists a constant K<+ such that
S[0,T](μ|ν)j=1r[αjpjc0T((z,z)E(μjc(t)(z))lz,zj,c(t))dt+αjpjp0T((z,z)E(μjp(t)(z))lz,zj,p(t))dt]KT

Proof.

See B.2. □

Lemma 3.

Let, for 1jr,Lj,c(t) and Lj,p(t) be rate matrices such that the solution μ:[0,T](M1(Z))2r to the system

{μ˙jc(t)=Lj,c(t)*μjc(t),μ˙jp(t)=Lj,p(t)*μjp(t),1jr,t[0,T],
with μ(0)=ν having S[0,T](μ|ν)<+ and μ(T)=ξ. Let 0<β<+ be a time scaling and T=T/β. Consider the path {μ˜(t)=μ(βt)|t[0,T]} having μ˜(t)=ν and μ˜(T)=ξ. Then, μ˜ satisfies
{μ˜˙jc(t)=L˜j,c(t)*μ˜jc(t),μ˜˙jp(t)=L˜j,p(t)*μ˜jp(t),1jr,t[0,T],
where L˜j,c(t)=βLj,c(βt), and L˜j,p(t)=βLj,p(βt) for 1jr. Furthermore, the scaled path μ˜:[0,T](M1(Z))2r satisfies
S[0,T](μ˜|ν)S[0,T](μ|ν)+|1β|βCT|E|+|logβ|j=1r[αjpjc0T((z,z)E(μjc(t)(z))lz,zj,c(t))dt+αjpjp0T((z,z)E(μjp(t)(z))lz,zj,p(t))dt].(3.23)

Proof.

See B.3. □

Lemma 4.

The mapping (ν,ξ)ST(ξ|ν) is uniformly continuous.

Proof.

This is a mild generalization of Borkar and Sundaresan (2012, lemma 3.3). Fix T > 0, 0<ε<T/4, and let δ(0,ε). From Lemma 1 there exists a constant C3 such that, for any ν,ξ with ρ02r(ν,ξ)<δ, we have Sε(ξ|ν)εC3. Let (ν1,ξ1),(ν2,ξ2) be two points in the space (M1(Z))2r×(M1(Z))2r equipped with the metric ρ¯ defined by

ρ¯((ν1,ξ1),(ν2,ξ2))=max{ρ02r(ν1,ν2),ρ02r(ξ1,ξ2)},
and suppose that ρ¯((ν1,ξ1),(ν2,ξ2))<δ. Thus it suffices to show that ST(ξ1|ν1) and ST(ξ2|ν2) are close to each other. First, note that ρ02r(ν1,ν2)<δ and ρ02r(ξ1,ξ2)<δ. Therefore, from Lemma 1 there exists a path going from ν1 to ν2 with cost Sε(ν2|ν1)C3ε in time ε and from ξ2 to ξ1 with cost Sε(ξ1|ξ2)C3ε in time ε. Moreover, denote by μ the minimum cost path from ν2 to ξ2 in time T with cost ST(ξ2|ν2), and then consider the path from ν1 to ξ1 as follows:
  • Traverse the path from ν1 to ν2 in time [0,ε] with cost at most C3ε.

  • Consider the path μ˜:[0,T2ε](M1(Z))2r given by μ˜(t)=μ(αt) with α=T/(T2ε), where μ is the optimal [0,T]-path μ from ν2 to ξ2. Therefore, travel from ν2 to ξ2 in the duration [ε,Tε] along the path μ˜.

  • Traverse the path from ξ2 to ξ1 in time [0,ε] with cost at most C3ε.

Thus the minimum cost for traversal from ν1 to ξ1 is at most the sum of the previous paths. Hence, by Lemmas 2 and 3, one obtains

ST(ξ1|ν1)2C3ε+S[0,T](ξ2|ν2)+2Cε|E|+(logTT2ε)(S[0,T](ξ2|ν2)+KT).

Note that loguu1 for u > 0. Thus, using again Lemma 1 leads to

ST(ξ1|ν1)2C3ε+S[0,T](ξ2|ν2)+2Cε|E|+(TT2ε1)(C1(T)+KT).

Now, obbserve that

ε<T/4TT2ε1=TεT2ε4εT,
from which we deduce that
ST(ξ1|ν1)S[0,T](ξ2|ν2)+εC4(T),
with C4(T)=2C3+2C|E|+4T(C1(T)+KT). Finally, reversing the roles of (ν1,ξ1) and (ν2,ξ2) gives to us
|ST(ξ1|ν1)ST(ξ2|ν2)|C4(T)ε,
which concludes the proof. □

Denote by 0N the law of the initial empirical measure vector μN(0)=νN, and let 0,TN denote the joint law of (μN(0),μN(T)). We next establish the large deviations principle for the sequence (0,TN,N1).

Theorem 3.

Suppose that the sequence (0N,N1) satisfies the large deviations principle with speed N and good rate function s:(M1(Z))2r[0,+]. Then, the sequence of joint laws (0,TN,N1) satisfies the large deviation principle with speed N and good rate function

S0,T(ξ,ν)=s(ν)+ST(ξ|ν).(3.24)

Proof.

Here, 0,TN is the joint distribution of (μN(0),μN(T)),0N is the distribution of μN(0)=νN, and pνNN,T is the conditional distribution of μN(T) given μN(0). Thus one can write

d0,TN(ν,ξ)=d0N(ν)×dpνN,TN(ξ).

Because both the sequences (0,TN,N1) and (pνNN,T,N1) obey the large deviations principle, one can apply Feng and Kurtz (2006, proposition 3.25) in order to derive the rate function corresponding to the large deviations principle of the sequence ((μN(0),μN(T)),N1) in the product space. To this end, we first verify that the conditions of application of Feng and Kurtz (2006, proposition 3.25) are satisfied. Let νNν weakly. By Theorem 2, the sequence of laws of the terminal measure (pνN,TN,N1) satisfies the large deviations principle with speed N and good rate function ST(ξ|ν). Moreover, recall that pνN,T=PνNNπT1. From Dawson et al. (2020, lemma 4.6) we have that for any α>0,

limsupN1NlogM1,φ(X)××M1,φ(X)exp{Nα|h|}dPνN0,N<,(3.25)
where PνN0,N is the distribution of the historical empirical vector MN in the noninteracting case, with νN as the initial empirical vector, and the space M1,φ(X) is introduced in (3.16). Now, denote by Cb((M1(Z))2r) the space of continuous and bounded functions on (M1(Z))2r. Then, using (3.25) and the Radon-Nikodym derivative (3.3), one can easily verify that, for any fCb((M1(Z))2r) and α>0,
limsupN1Nlog(M1(Z))2reNα|f|dpνN,TN<.

Moreover, using Varadhan’s lemma (see Léonard 1995a, proposition 2.5) we obtain, for every fCb((M1(Z))2r),

limN1Nlog(M1(Z))2reNfdpνN,TN=supξ(M1(Z))2r[f(ξ)ST(ξ|ν)].(3.26)

Furthermore, by defining

Λ(f|ν)=supξ(M1(Z))2r[f(ξ)ST(ξ|ν)],(3.27)
the Bryc’s Inverse Varadhan lemma (see Dembo and Zeitouni 2010, theorem 4.4.2) gives
ST(ξ|ν)=supfCb((M1(Z))2r))[f(ξ)Λ(f|ν)].

One can observe that, for any fCb((M1(Z))2r), the mapping ν(M1(Z))2rΛ(f|ν)R is continuous. Indeed, for any fCb((M1(Z))2r), define the mapping

η:(ν,ξ)(M1(Z))2r×(M1(Z))2r[f(ξ)ST(ξ|ν)]R.

Because f is continuous, and ST(ξ|ν) is also continuous by Lemma 4, the mapping η(·,·) is jointly continuous. Let νNν weakly, and for each N, let ξN denote a point where the supremum in (3.27), corresponding to νN, is attained. This is consistent because the space (M1(Z))2r is compact. Thus Λ(f|νN)=η(νN,ξN) for each N. Moreover, by the same compactness argument, the sequence ((νN,ξN),N1) has a convergent subsequence that converges to (ν,ξ) for some ξ(M1(Z))2r. Let ((νN,ξN),N1) denote this subsequence. Therefore, (νN,ξN)(ν,ξ) as N+. By the continuity of η we have, as N+,

Λ(f|νN)=η(νN,ξN)η(ν,ξ).

From the definition of ξN, one can observe that, for any ξ,η(νN,ξ)η(νN,ξN). Hence, by the continuity of η

η(ν,ξ)=limNη(νN,ξ)limsupNη(νN,ξN)=η(ν,ξ).

Thus Λ(f|ν)=η(ν,ξ), from which we deduce that Λ(f|ν) is continuous because η(ν,ξ) is jointly continuous. Thus, the mapping ν(M1(Z))2rΛ(f|ν)R is indeed continuous.

Now, notice that when there are N particles in the system, the initial empirical measure μN(0)=νN takes values in the product space (M1N(Z))2r, where

M1N(Z)={1Nn=1Nδan|aN=(an,1nN)ZN},
which is a compact subset of M1(Z). Using Theorem 1 and the continuity of ν(M1(Z))2rΛ(f|ν)R, one can prove that the convergence in (3.26) is uniform for ν over compact subsets of (M1(Z))2r, namely,
limN+supν(M1N(Z))2r|1Nlog(M1(Z))2reNαfdpνN,TNΛ(f|ν)|=0,
for any fCb((M1(Z))2r) (see Borkar and Sundaresan 2012, lemma 8.2) for detailed proof. Finally, one has to verify that the sequence (0,TN,N1) is exponentially tight. Because the sequence (μN(0),μN(T)) takes values in a product space, it is enough to verify that each marginal distribution is exponentially tight. This is in fact straightforward because, by the compactness of the space (M1(Z))2r, the exponential tightness of the sequences (0N,N1) and (0,TN,N1) is implied by the goodness of the rate functions ST(μ|ν) and s(ν) (see Dembo and Zeitouni 2010, exercise 1.2.19).

We are now in a position to apply Feng and Kurtz (2006, proposition 3.25). Indeed, we have shown that the sequence (0,TN,N1) is exponentially tight. Moreover, the convergence in convergence in (3.26) is uniform for ν in compact subsets of (M1(Z))2r. Furthermore, the function Λ(f|ν) is continuous in ν. Hence, because (0N,N1) satisfies the large deviations principle with good rate function s(ν), then (0,TN,N1) satisfies the large deviations principle with good rate function given by (3.24). This concludes the proof. □

4. Large Deviations of the Invariant Measure

By Assumption 1, the graph (Z,E) of the allowed transitions is irreducible. Moreover, the state space Z is finite; therefore, for each fixed total number of particles N, there exists a unique invariant measure for the Markov process XN=(Xn,Xm,nCjc,mCjp,1jr). Hence, there is a unique invariant measure, denoted by N, for the (M1(Z))2r-valued Markov process μN. The goal of this section is to investigate the large deviations properties of the sequence (N,N1) under two separate scenarios. First, we consider the case where the limiting McKean-Vlasov system (3.10) has a unique globally asymptotically stable equilibrium. Then, we treat the general case with multiple ω-limit sets.

4.1. Unique Globally Asymptotically Stable Equilibrium

We first establish the large deviations principle for the invariant measure (N,N1) in the case where the limiting McKean-Vlasov system has a unique globally asymptotically stable equilibrium ξ0.

Theorem 4.

Suppose that Assumption 1 holds true. Moreover, suppose that the McKean-Vlasov system (3.10) has a unique globally asymptotically stable equilibrium ξ0. Then, the sequence (N,N1) satisfies a large deviations principle with speed N, and a good rate function s given by

s(ξ)=infμ^j=1r[αjpjc0+((z,z)E(μ^jc(t)(z))λz,zc(μ^jc(t),μ^jp(t))τ*(l^z,zj,c(t)λz,zc(μ^jc(t),μ^jp(t))1))dt+αjpjp0+((z,z)E(μ^jp(t)(z))λz,zp(μ^jc(t),μ^1p(t),,μ^rp(t))×τ*(l^z,zj,p(t)λz,zp(μ^jc(t),μ^1p(t),,μ^rp(t))1))dt],(4.1)
where the infimum is over all the paths μ^ that are solutions to the reversed-time system
{μ^˙jc(t)=L^j,c(t)*μ^jc(t),μ^˙jp(t)=L^j,p(t)*μ^jp(t),1jr,(4.2)
for some family of rate matrices L^j,c and L^j,p, with initial condition μ(0)=ξ, terminal condition limtμ(t)=ξ0, and μ(t)(M1(Z))2r for all t0.

The rest of this section is dedicated to the proof of Theorem 4. The proof is based on the control-theoretic approach introduced in Biswas and Borkar (2011) for small-noise diffusions and in Borkar and Sundaresan (2012) for finite-state mean-field systems on complete graphs. We proceed through several lemmas. We start by establishing a subsequential large deviations principle.

Lemma 5.

Let (N1) be a sequence of natural numbers going to +. Then, there exists a subsequence (Nk,k1) such that (Nk,Nk1) satisfies a large deviations principle with speed Nk and a good rate function s verifying

s(ξ)=infν(M1(Z))2r[s(ν)+ST(ξ|ν)] for every T>0.(4.3)

Moreover, s0, and there exists some ν*(M1(Z))2r such that s(ν*)=0.

Proof.

The space Z is compact since it is finite, and then M1(Z) is also compact. Hence, the product space (M1(Z))2r is also compact. Moreover, the space (M1(Z))2r endowed with the product metric ρ02r(·,·) is a metric space, and thus it has a countable basis. Therefore, there exists a sequence Nk0 such that (Nk,Nk1) satisfies the weak large deviations principle in (M1(Z))2r (Dembo and Zeitouni 2010, lemma 4.1.23). Moreover, because (M1(Z))2r is compact, (Nk,Nk1) satisfies the strong large deviations principle with a good rate function s:(M1(Z))2r[0,] and speed Nk (Dembo and Zeitouni 2010, lemma 1.2.18).

Fix an arbitrary T > 0. Recall that 0N is the probability measure of the initial empirical measure vector μN(0). Set 0N=N. Then, by Theorem 3, the sequence of joint laws (0,TNk,Nk1) satisfies the large deviations principle along the subsequence (Nk,k1) with speed Nk and good rate function S0,T(ξ,ν)=s(ν)+ST(ξ|ν). Using the continuity of the projection and the contraction principle (Dembo and Zeitouni 2010, theorem 4.2.1), the sequence of the terminal probability distributions (TNk,Nk1) satisfies a large deviations principle with the good rate function

infν(M1(Z))2rS0,T(ξ,ν)=infν(M1(Z))2r[s(ν)+ST(ξ|ν)].

Because N is the invariant measure and 0N=N, one has TN=N. Thus, by the uniqueness of the rate function, we deduce that

infν(M1(Z))2rS0,T(ξ,ν)=s(ξ).

Finally, because every rate function is nonnegative, we have s0. In addition, with s being a good rate function, it attains its minimum, and thus, there exists some ν* such that s(ν*)=0. This concludes the proof. □

Notice that Equation (4.3) has multiple solutions. The trivial s0 is one of them. To see this, take the McKean-Vlasov path μ of duration T given by (3.10) starting at some initial condition ν and ending at ξ; then, ST(ξ|ν)=0, and the right-hand side of (4.3) vanishes when s0. Therefore, one shall identify more conditions satisfied by the rate function s.

Observe from (3.22) that (4.3) is equivalent to

s(ξ)=infν(M1(Z))2r{s(ν)+infμ[S[0,T](μ|μ(0)):μ(0)=ν,μ(T)=ξ]} for every T>0.=infμ|μ(T)=ξ{s(μ(0))+S[0,T](μ|μ(0))}, for every T>0.(4.4)

Hence, one can see (4.3) as a Bellman equation associated with an optimal control problem, with s being the corresponding value function of a minimization problem over path space, with paths defined on [0,mT], for m1, and ending at ξ. Therefore, one must determine the optimal control problem for which Equation (4.3) is the dynamic programming equation and ξ is the terminal condition. Because the terminal condition is fixed, we shall define translated and reversed-time paths that start from ξ at time 0. In particular, for m1 and a path μ(D([0,mT],M1(Z)))2r satisfying

{μ˙jc(t)=Lj,c(t)*μjc(t),μ˙jp(t)=Lj,p(t)*μjp(t),1jr,t[0,mT],(4.5)
with Lj,c(t) (resp. Lj,p(t)) being the rate matrix associated with the time-varying rates (lz,zj,c(t),(z,z)E) (resp. (lz,zj,p(t),(z,z)E)), the corresponding translated and reversed path μ^ satisfies the following reversed-time dynamical system
{μ^˙jc(t)=L^j,c(t)*μ^jc(t),μ^˙jp(t)=L^j,p(t)*μ^jp(t),1jr,t[0,mT],(4.6)
with initial condition μ^(0)=ξ, where
μ^(t)=μ(mTt),L^j,c(t)=Lj,c(mTt),L^j,p(t)=Lj,p(mTt),
for t[0,mT]. The latter quantities are defined where time flows in the opposite direction regarding the direction under the McKean-Vlasov dynamics (3.10). Thus, one can consider the set of rate matrices L^(t)=(L^j,c(t),L^j,p(t),1jr) as the control at time t when the state is μ^(t). Define
r(μ^(t),L^(t),t)=j=1r[αjpjc((z,z)E(μ^jc(t)(z))λz,zc(μ^jc(t),μ^jp(t))τ*(l^z,zj,c(t)λz,zc(μ^jc(t),μ^jp(t))1))+αjpjp((z,z)E(μ^jp(t)(z))λz,zp(μ^jc(t),μ^1p(t),,μ^rp(t))τ*(l^z,zj,p(t)λz,zp(μ^jc(t),μ^1p(t),,μ^rp(t))1))],(4.7)
therefore, the total cost over [0,mT] is
0mTr(μ^(t),L^(t),t)dt,
which is simply S[0,mT](μ|μ(0)) given by (3.18), as can be verified using a simple change of variable tmTt. Thence, Equation (4.3) is equivalent to
s(ξ)=infL^{s(μ^(mT))+0mTr(μ^(t),L^(t),t)dt} for every m1,(4.8)
which is the Bellman equation associated with the optimal control problem
minL^0mTr(μ^(t),L^(t),t)dt,m1,
subject to
{μ^˙jc(t)=L^j,c(t)*μ^jc(t),μ^˙jp(t)=L^j,p(t)*μ^jp(t),1jr,t[0,mT],m1,(4.9)
and μ^(0)=ξ. The next lemma establishes the existence of one optimal path μ^ of infinite duration starting at ξ.

Lemma 6.

For each ξ(M1(Z))2r, there exists a path μ^=(μ^1c,μ^1p,,μ^rc,μ^rp):[0,+)(M1(Z))2r and families of rate matrices L^j,c(t) and L^j,p(t) defined on [0,) such that, for t[0,),

{μ^˙jc(t)=L^j,c(t)*μ^jc(t),μ^˙jp(t)=L^j,p(t)*μ^jp(t),1jr,(4.10)
with initial condition μ^(0)=ξ, and
s(ξ)=s(μ^(mT))+0mTr(μ^(t),L^(t),t)dt, for all m1.(4.11)

Proof.

Let μ^=(μ^1c,μ^1p,,μ^rc,μ^rp):[0,)(M1(Z))2r be an infinite duration path, and let ψm be its restriction to the finite interval [0,mT] given by

μ^ψmμ^=μ^(m):[0,mT](M1(Z))2r.

Equip the space of infinite duration paths with the following metric:

ρ(μ^,ν^)=m=12m(ρmT2r(ψmμ^,ψmν^)1).

One can easily observe that the restriction ψm is continuous for all m. Moreover, define the reversed restriction by

μ(m)(t)=μ^(m)(mTt),t[0,mT].

For any B[0,), consider the sets

Γ(B)={μ^:[0,)(M1(Z))2r|supm1S[0,mT](μ(m)|μ(m)(0))B},Γm(B)={η^:[0,mT](M1(Z))2r|S[0,mT](η|η(0))B}.

Thus Γ(B) is the set of infinite duration paths μ^, with the corresponding restrictions μ(m) on time intervals [0,mT] having the costs bounded by B, for any m1. On the other hand, the set Γm(B) comports the paths η^ of duration [0,mT], with corresponding reversed path η(t)=η^(mTt) having cost bounded by B. We next prove that the set Γ(B) is compact for any B[0,).

First, observe that Γ(B) is a subset of a metric space; thus it is enough to prove that it is sequentially compact. Take an infinite sequence (μ^n,n1)Γ(B) and the corresponding restriction sequence (ψmμ^n,n1)Γm(B). Note that the sets Γm(B), for m1, are compact. Indeed, with S[0,mT] being a good rate function, the corresponding level set {η:[0,mT](M1(Z))2r|S[0,mT](η|η(0))B} is compact, and then, because η^(t)=η(mTt) for each t[0,mT], we have that Γm(B) is compact because it is a continuous image of a compact. Therefore, one can find an infinite subset V1N such that (ψ1μ^n,nV1)Γ1(B) converges. Moreover, one can take a further subsequence represented by the infinite subset V2V1 such that (ψ2μ^n,nV2)Γ2(B) converges. We can continue this procedure for all m1 and eventually take the subsequence along the diagonal. This subsequence converges for every interval [0,mT]. Take μ^(t), its pointwise limit for every t. The restriction ψmμ^Γm(B) and the corresponding μ(m) satisfy S[0,mT](μ(m)|μ(m)(0))B, and thus, μ^Γ(B). This guarantees that Γ(B) is sequentially compact and thus compact.

Fix ξ(M1(Z))2r. From Lemma 5, there exists ν* such that s(ν*)=0, and then, by Lemma 1,

s(ξ)ST(ξ|ν*)C1(T).(4.12)

Take in the sequel B=C1(T). Starting from any location ν(M1(Z))2r, the minimum cost SmT(ξ|ν) of transporting the system from ν to ξ in mT units of time is also bounded by C1(T). Indeed, consider the path consisting of traversing the McKean-Vlasov path with initial condition ν in (m1)T units of time; the corresponding cost is zero. Then, go to ξ in T units of time. The cost of the last traversal is bounded by B=C1(T), as stated by Lemma 1. Now, if we consider the translated and reversed time paths μ^ that start from ξ at time 0, they have a cost at most B and stay within (M1(Z))2r for the duration [0,mT]. Let

Γm*=ν(M1(Z))2r{μ^:[0,mT](M1(Z))2r|μ(t)=μ^(mTt),μ(0)=ν,μ(mT)=ξ,S[0,mT](μ|ν)=SmT(ξ|ν)}
be the subset of Γm consisting of the collection of all minimum cost reversed and translated paths μ^ on [0,mT], starting from ξ to every location in (M1(Z))2r. Thanks to the arguments above, the set Γm* is not empty for all m1, and the minimum cost SmT(ξ|ν) is at most B for every ν.

Next, we prove that Γm* is compact. To this end, and because Γm* is a subset of a compact set, it suffices to show that it is closed. Let μ^ be a point of the closure of Γm*, and then one can find a sequence (μ^(k),k1)Γm* such that limkμ^(k)=μ^. By definition of Γm*, we have μ^(0)=ξ. In addition, set μ^(mT)=ν for some ν(M1(Z))2r. Consider the corresponding translated and reversed paths (μ(k),k1) and μ. Therefore, using the lower semicontinuity property of the good rate function S[0,mT](·|ν), we obtain

S[0,mT](μ|ν)liminfkS[0,mT](μ(k)|μ(k)(0))=liminfkSmT(ξ|μ(k)(0))=SmT(ξ|ν),
where the first equality follows from the definition of Γm*, and the last equality is found using the continuity of the rate function SmT in its arguments (cf. Lemma 4). On the other hand, by definition, SmT(ξ|ν) is the minimum cost of transporting the system from ν to ξ in mT units of time; we then deduce that the path μ must satisfy S[0,mT](μ|ν)=SmT(ξ|ν) and thus μ^Γm*. Hence, Γm* is closed and thus compact.

We are now in the position to conclude the proof. Given that Γm* is nonempty and closed, by the continuity of the restriction ψm, the image set ψm1Γm* is nonempty and closed. Moreover, because Γ(B) is compact, the intersection ψm1Γm*Γ(B) is also compact. Furthermore, note that ψm+11Γm+1*ψm1Γm*. Indeed, take an optimal path μ^ψm+11Γm+1* that starts from ξ and passes by ν at time (m+1)T, and by ν at time mT then, its restriction to the interval [0,mT] is necessarily optimal (if not, μ^ would not be optimal on [0,(m+1)T]). Therefore, μ^ψm1Γm*, and thus (ψm1Γm*,m1) is a nested decreasing sequence of subsets. Hence, (ψm1Γm*Γ,m1) is in turn a nested decreasing sequence of nonempty, compact, and closed subsets, and thus, by Cantor’s intersection theorem, its intersection is not empty. Take μ^m1(ψm1Γm*Γ) and let η(m)(t)=μ^(mT+Tt), for m1 and t[0,T], be its reversal restriction on the interval [mT,mT+T], and let η(0)(t)=μ^(Tt) t[0,T] be the reversal restriction of μ^ on [0,T]. Thus S[0,T](η(m)|η(m)(0))B< for all m0. Thence, from Theorem 1, there exist families of rate matrices (Lj,c(m)(t),t[0,T]) and (Lj,p(m)(t),t[0,T]) such that η(m)=(η1(m),c,η1(m),p,,ηr(m),c,ηr(m),p) satisfies (3.17) on [0,T] with initial condition η(m)(0). Define for all m0,L^j,c(mT+t)=Lj,c(m)(Tt) and L^j,p(mT+t)=Lj,p(m)(Tt) for t[0,T]. Thus, the rate matrices L^j,c and L^j,p are defined on [0,) such that μ^ satisfies (4.10) on [0,) with initial condition μ^(0)=ξ. The equality in (4.11) follows because the path μ^ satisfies (4.8) on any interval [0,mT] by the principle of optimality. This concludes the proof of the lemma. □

Next, we show that the optimal path given in Lemma 6 must end up in an invariant set of the dynamics given by the time-reversed McKean-Vlasov system.

Lemma 7.

Let

Ω=t>0{μ^(t),t>t}¯
be the ω-limit set of the path μ^ given in Lemma 6. Then, Ω is contained in an ω-limit set of the reversed-time McKean-Vlasov system
{μ^˙jc(t)=Aμ(t)^j,c*μ^jc(t),μ^˙jp(t)=Aμ^(t)j,p*μ^jp(t),1jr,t0.(4.13)

Proof.

The path μ^ given in Lemma 6 remains in (M1(Z))2r and satisfies the dynamics (4.10) with initial condition μ^(0)=ξ for some ξ(M1(Z))2r. Moreover, notice that the integral term in (4.11) is increasing with m because the integrand is nonnegative. Hence, because the equality is valid for all m1, the term s(μ^(mT)) must decrease as m increases. But we know from Lemma 1 and (4.12) that s[0,C1(t)], and then there exists s* such that ss* as m.

Take a subsequence (μ^(mkT),mk1) of (μ^(mT),m1) and let ξ be its limit. Moreover, denote by ν the limit of the subsequence (μ^(mkT+T),mk1), and consider the path of duration T given by

μ(mk)(t)=μ^(mkT+Tt),t[0,T].

Thus the following convergence,

(μ(mk)(0),μ(mk)(T))(ν,ξ),
holds as k. In addition, both s(μ(mk)(0)) and s(μ(mk)(T))) go to s* as k because (4.11) is valid for all m1. Therefore, taking limits in (4.11) as k with both μ^(mkT+T) and μ^(mkT), we deduce that
limsupkmkTmkT+Tr(μ^(t),L^(t),t)dt=0,
which, by a simple change of variable tmkT+Tt, gives in turn
limsupkS[0,T](μ(mk)|μ(mk)(0))=0.

By the nonegativity of the rate function ST, one further finds

limkST(μ(mk)(T)|μ(mk)(0))=0.

In addition, Lemma 4 tells us that the rate function ST is uniformly continuous in both its arguments. Thence, we deduce that ST(ξ|ν)=0. This means that the path, say μ, that goes from ν to ξ in T units of time with no cost S[0,T](μ|ν)=ST(ξ|ν)=0, is necessarily the McKean-Vlasov path that satisfies (3.10) on [0,T], with initial condition μ(0)=ν and terminal condition μ(T)=ξ (see Remark 3). Hence, the reversed-time path μ¯(t)=μ(Tt) satisfies (4.13) for t[0,T] with initial condition μ¯(0)=ξ. This proves that Ω, the ω-limit set of μ^, is contained in an ω-limit set of the reversed-time McKean-Vlasov dynamics (4.13). The lemma is proven. □

The following result proves that the rate function s vanishes at the equilibrium point ξ0.

Lemma 8.

If the McKean-Vlasov system (3.10) has a unique globally asymptotically stable equilibrium ξ0, then s(ξ0)=0.

Proof.

Consider the Mckean-Vlasov dynamics (3.10) with initial condition μ(0)=ν* satisfying s(ν*)=0 (see Lemma 5). Because ξ0 is the unique asymptotically stable equilibrium, limtμ(t)=ξ0. Moreover, the McKean-Vlasov path μ has no cost, that is, ST(μ(T)|ν*)=0 for each T > 0. Therefore, from Equation (4.3), one obtains

s(μ(T))s(ν*)+ST(μ(T)|ν*)=s(ν*).

Taking the limit as T, and using the lower semicontinuity of s, one gets

0s(ξ0)liminfTs(μ(T))s(ν*)=0,
and hence, s(ξ0)=0. □

Finally, the next result gives the unique form of the rate function.

Lemma 9.

If the McKean-Vlasov system (3.10) has a unique globally asymptotically stable equilibrium ξ0, then the solution to (4.3) and (4.11) is unique and is given by (4.1).

Proof.

From Lemma 7, the ω-limit set Ω of the path μ^ given in Lemma 6 is contained in an ω-limit set of the reversed-time McKean-Vlasov dynamics (4.13), which is both positively and negatively invariant. Moreover, the path μ^ stays within (M1(Z))2r (see the proof of Lemma 6), and thus, Ω(M1(Z))2r. Because (M1(Z))2r is compact and Ω is closed being an ω-limit set, then it is nonempty, compact, and connected. But by the assumption that the forward McKean-Vlasov system (3.10) possesses a unique globally asymptotically stable equilibrium ξ0, ξ0 is thus the unique nonempty, compact, connected set in (M1(Z))2r that is both positively and negatively invariant for the dynamics in (4.13). Thus we necessarily have Ω={ξ0}. Therefore, letting m in (4.11), we obtain, by lower semicontinuity of the rate function s,

s(ξ)s(ξ0)+0r(μ^(t),L^(t),t)dt.(4.14)

But from Lemma 8, we have s(ξ0)=0, and then

s(ξ)0r(μ^(t),L^(t),t)dt.(4.15)

Finally, applying (4.3) shows that s(ξ) is upper bounded by the right-hand side of (4.1), and thus the equality holds. The uniqueness follows because the rate function is unique (Dembo and Zeitouni 2010, section 4.1.1). □

Proof of Theorem 4.

We are now ready to conclude the proof of Theorem 4. Take an arbitrary sequence of positive numbers going to +. From Lemma 5, there exists a subsequence (Nk,k1) such that (Nk,Nk1) satisfies the large deviations principle with speed Nk and a good rate function s that satisfies equation (4.3). Moreover, from Lemma 9, the rate function s is uniquely determined by Equation (4.1). Therefore, for every sequence, there exists a further subsequence (Nk,k1) such that (Nk,Nk1) satisfies the large deviations principle with speed Nk and the same good rate function s given by (4.1). Hence, because the rate function s corresponding to the subsequence (Nk,Nk1) satisfying a large deviations principle does not depend on this subsequence, one can conclude that the sequence of probability measures (N,N1) satisfies the large deviations principle with speed N and good rate function s defined by (4.1). □

4.2. Multiple ω-Limit Sets

We consider now the general case where the McKean-Vlasov system (3.10) admits multiple ω-limit sets. To this end, we rely on the classical Freidlin-Wentzell program (cf. Freidlin and Wentzell 2012). The same strategy was adopted in Borkar and Sundaresan (2012) for finite-state mean-field systems on complete graphs. We begin by introducing the central concepts.

First, recall the important notion of quasipotential V:(M1(Z))2r×(M1(Z))2r[0,) defined, for any ν,ξ(M1(Z))2r, by

V(ξ|ν)=inf{S[0,T](μ|ν):μ(0)=ν,μ(T)=ξ,T>0}.(4.16)

Roughly speaking, V(ξ|ν) measures the difficulty for the empirical vector process to move from ν to ξ in a finite time interval.

Lemma 10.

The mapping (ν,ξ)V(ξ|ν) is uniformly continuous.

Proof.

Replacing the metric ρ0(·,·) by the product metric ρ0r(·,·), the proof of (Borkar and Sundaresan 2012, lemma 3.4) holds verbatim. □

Using the Freidlin-Wentzell quasipotential, we define the following equivalence relation on (M1(Z))2r:

νξ ifV(ξ|ν)=V(ν|ξ)=0.(4.17)

We make throughout the section the following Freidlin-Wentzell assumptions (Freidlin and Wentzell 2012, chapter 6, section 2).

Assumption 2.

In (M1(Z))2r, there exist a finite number of compact sets K1,K2,,Kl such that:

  1. For any two points ν1 and ν2 belonging to the same compact, we have ν1ν2.

  2. For each ij,ν1Ki and ν2Kj imply ν1ν2.

  3. Every ω-limit set of the McKean-Vlasov system (3.10) lies completely in one of the compact sets Ki.

For any compacts Ki and Kj,ij, let us introduce

V(Ki,Kj)=inf{S[0,T](μ|μ(0)):μ(0)Ki,μ(T)Kj,T>0},(4.18)
which represents the minimum cost of going from the compact Ki to Kj in a finite time interval. Next, define the minimum cost of going from Ki to Kj without touching the other compact sets Kk,ki,j by
V˜(Ki,Kj)=inf{S[0,T](μ|μ(0)):μ(0)Ki,μ(T)Kj,μ(t)ki,jKk for all 0tT,T>0},(4.19)
and use the convention that if there are no such paths, we set V˜(Ki,Kj)=+.

Definition 1.

Let L be a finite set, and let WL be a subset of L. An oriented graph consisting of edges (m, n) (mL/W,nL,nm) is called a W-graph if it satisfies the following conditions:

  1. Every point mL/W is the initial point of exactly one edge;

  2. There are no closed cycles in the graph.

The second condition above can be replaced by the following condition. For any point mL/W, there exists a sequence of edges leading from it to some point nW. Denote by G(W) the set of W-graphs. Take L={1,2,,l} the indices corresponding to the compact sets K1,K2,,Kl given in Assumption 2, and we define the following quantity,

W(Ki)mingG{i}(i,j)gV˜(Ki,Kj)=mingG{i}(i,j)gV(Ki,Kj),(4.20)
where G{i} is the W-graph corresponding to W = i with i{1,,l}. The second equality holds by (Freidlin and Wentzell 2012, chapter 6, lemma 4.1). We now state the main result of this section.

Theorem 5.

Suppose that both Assumptions 1 and 2 hold true. Then the sequence (N,N1) satisfies the large deviations principle with speed N and a good rate function s given by

s(ξ)=inf1llinfμ^[sl+j=1r[αjpjc0+((z,z)E(μ^jc(t)(z))λz,zc(μ^jc(t),μ^jp(t))τ*(l^z,zj,c(t)λz,zc(μ^jc(t),μ^jp(t))1))dt+αjpjp0+((z,z)E(μ^jp(t)(z))λz,zp(μ^jc(t),μ^1p(t),,μ^rp(t))×τ*(l^z,zj,p(t)λz,zp(μ^jc(t),μ^1p(t),,μ^rp(t))1))dt]],(4.21)
where sl=W(Kl)minlW(Kl) with W(Kl) given by (4.20), and the second infimum is over all μ^ that are solutions to the dynamical system
{μ^˙jc(t)=L^j,c(t)*μ^jc(t),μ^˙jp(t)=L^j,p(t)*μ^jp(t),1jr,(4.22)
for some family of rate matrices L^j,c and L^j,p, with initial condition μ(0)=ξ, terminal condition limtμ(t)Kl, and μ(t)(M1(Z))2r for all t0.

Proof of Thereom 5.

Again, the proof is split into several lemmas.

Lemma 11.

Assume that Assumption 2 holds true. The rate function s satisfies the following assertions:

  • There exists ξ0 in some compact Ki0, with 1i0l, that satisfies s(ξ0)=0;

  • The rate function s is constant on each of the compacts K1,,Kl, that is, for all ξKi,s(ξ)=si, for some nonnegative real numbers s1,s2,,sl.

Proof.

Let μ be the McKean-Vlasov path given by (3.10) and starting at some ν* with s(ν*)=0. Note that the existence of such a point is guaranteed by Lemma 5. Take ξ0(M1(Z))2r such that limtμ(t)=ξ0. By Assumption 2, ξ0Ki0 for some 1i0l. Using the same arguments as in the proof of Lemma 8, the first statement follows.

Fix 1il and let ν,ξKi. Thus νξ. Hence, by (4.16) and (4.17), for any ε>0, there exists T > 0 and a path of length T starting at ν and ending at ξ such that ST(ξ|ν)ε. Consequently, using (4.3), one obtains

s(ξ)s(ν)+ST(ξ|ν)s(ν)+ε.

Reversing the roles of ν and ξ, one gets

s(ν)s(ξ)+ε.

Combining the two last inequalities leads to |s(ν)s(ξ)|ε. Letting ε0, we obtain s(ξ)=s(ν), which proves the second statement. □

Lemma 12.

Assume that Assumption 2 holds true. Then, the rate function s, the solution to equations (4.3) and (4.11), is uniquely given by (4.21).

Proof.

Using the same arguments as in the proof of Lemma 9 together with Assumption 2, one can conclude that the ω-limit set Ω of the path μ^ given in Lemma 6 is contained in some compact Kl, with l1,,l. Therefore, letting m in Equation (4.11), s(μ^(mT))sl for some l{1,,l}, which gives that s(ξ) is lower bounded by the right-hand side of (4.21). The upper bound is obtained by Equation (4.3), and thus the proof follows. □

Remark 4.

Using Lemma 11, Theorem 8, and the definition of the large deviations principle, it is easy to see that the values s1,,sl of the rate function s at the compact sets Ki are given by W(Ki)miniW(Ki), with W(Ki) defined by (4.20).

Proof of Theorem 5.

Take an arbitrary sequence of positive numbers going to +. From Lemma 5, there exists a subsequence (Nk,k1) such that (Nk,Nk1) satisfies the large deviations principle with speed Nk and a good rate function s that satisfies Equation (4.3). Moreover, from Lemma 12, the rate function s is uniquely determined by Equation (4.21), where sl=W(Kl)minlW(Kl) for 1ll. Therefore, for every sequence, there exists a further subsequence (Nk,k1) such that (Nk,Nk1) satisfies the large deviations principle with speed Nk, and the same good rate function s given by (4.21). Hence, because the rate function s of the subsequence (Nk,Nk1) satisfying a large deviations principle does not depend on this subsequence, we conclude that the sequence of probability measures (N,N1) satisfies the large deviations principle with speed N, and good rate function s defined by (4.21). □

5. Metastability and Convergence to the Invariant Measure

We study in this section the metastable phenomena that occur when the total number N of particles in the system as well as the time t are large. First, let us briefly summarize the main results of the previous sections and their consequences.

From the law of large numbers (cf. Dawson et al. 2020, corollary 3.1), as N and for converging initial conditions μN(0)=νNν, the sequence (μN,N1) converges weakly and uniformly over any finite time interval [0,T] toward the deterministic solution μ of the McKean-Vlasov system in (3.10) with initial condition ν. This suggests that, when N and over any finite time interval [0,T], one can approximate the trajectories of the empirical vector process μN by the solution to the McKean-Vlasov system in (3.10) with initial condition ν.

Moreover, given that the graph of allowed transitions (Z,E) is irreducible, there is a unique invariant measure N for μN. Therefore, for each N, the distribution of μN converges toward N as t. Thence, the large N behavior is described by the large deviations properties of the invariant measure N established in Theorems 4 and 5. Thence, the natural question one might ask is whether we can interchange the N and t limits, namely

limtlimNμN(t)=?limNlimtμN(t).

This classical question is related to the limiting behavior of the McKean-Vlasov system (3.10). In particular, two distinct cases must be considered. The most simple situation is when the McKean-Vlasov system (3.10) has a unique globally asymptotically stable equilibrium ξ0(M1(Z))2r. In this case, one can prove that the unique invariant measure N of the empirical process vector μN converges toward the point mass δξ0 as N. Moreover, because N is unique, it is independent of the initial condition. This leads to a justification of interchange of the limits N and t. A detailed discussion of this scenario is given in Benaïm and Le Boudec (2008).

The second and more complicated case, which we are interested in here, is when the McKean-Vlasov system (3.10) has multiple ω-limit sets, depending on the initial condition. In this case, starting at a given ν(M1(Z))2r and letting t, the solution to the McKean-Vlasov system in (3.10) goes to an ω-limit set corresponding to this initial condition. Moreover, recalling that the Birkhoff center of the solution μ to the McKean-Vlasov system (3.10) is the closure of the set of recurrent points, that is, the set of points ν(M1(Z))2r such that νω(ν), it is well known that the support of any limit point of N, as N, is a compact subset of the Birkhoff center of μ. See, for example, Benaïm and Le Boudec (2008, Theroem 3). Therefore, most of the time, for large but finite N, the empirical vector process μN(t) remains close to the Birkhoff center of μ. However, the difficulty here is that the Birkhoff center contains multiple ω-limit sets, stable equilibrium, and/or limit cycles, depending on the initial condition. Thence, metastable phenomena are likely to arise. Here is an example.

Let the initial condition μN(0)=νN converge weakly to a given ν(M1(Z))2r as N. Then, on any finite time horizon, for a large but finite N, the empirical vector process μN would track the solution of the McKean-Vlasov Equation (3.10) starting at ν with a high probability. Therefore, as t becomes large, μN would enter a neighborhood of the ω-limit set of (3.10) corresponding to the initial condition ν. However, because N is finite, the process can exit the basin of attraction of this ω-limit set and likely remains in a neighborhood of another ω-limit set for a large amount of time before transiting again to the next one, and so on. This is an example of metastability. The goal of this section is thus to study such phenomena. The main ingredient is the large deviations properties developed in Sections 3 and 4.

The metastable phenomena were first studied for diffusion processes with a small-noise parameter. The two main references are Freidlin and Wentzell (2012, chapter 6), in which the authors studied these phenomena under the hypothesis summarized in Assumption 2, and Hwang and Sheu (1990), where slightly more general assumptions have been made. More recently, an extension to finite-state mean-field models on complete graphs was established in Yasodharan and Sundaresan (2019). We propose in this section an extension of the aforementioned results to mean-field models with jumps on block-structured graphs detailed in Section 2. The main idea is to consider the empirical vector process μN(t) as a small-noise perturbation of the deterministic solution μ to the McKean-Vlasov system (3.10). Here, N1 plays the role of the small-noise parameter ε considered in Hwang and Sheu (1990) and Freidlin and Wentzell (2012) in the sense that, as N,ε0, we recover the “nonperturbed” McKean-Vlasov equation (3.10). Thence, under Assumption 2, one considers an embedded Markov chain Zn, for which the state space is the union of small neighborhoods of the compact sets Ki,1il and whose transitions probabilities allow us to estimate the exit and entering times of the empirical vector process μN in the neighborhood of the compact sets Ki, thus describing the metastability of the finite N-particles system.

5.1. Metastable Phenomena Estimates

Let us introduce some additional notations. For a set A(M1(Z))2r, let [A]δ denote the open δ-neighborhood of A and [A]¯δ denote its closure. Moreover, let the stopping time τA=inf{t>0|μN(t)A} denote the first exit time from A. Recall Assumption 2 and let r0 and r1 be two positive numbers such that 0<r0<12mini,jρ02r(Ki,Kj) and 0<r1<r0, where we recall that ρ02r(·,·) is the product metric that equips the product space (M1(Z))2r. Denote by C=(M1(Z))2ri=1l[Ki]r0 the set (M1(Z))2r from which we delete the r0-neighborhoods of Ki,i=1,,l, and let Γi=[Ki]r0¯ be the closure of [Ki]r0. Furthermore, denote by γi=[Ki]r1 the r1-neighborhood of Ki, and γ=i=1lγi. Consider the following stopping times:

τ0=0,σn=inf{tτn|μN(t)C},τn=inf{tσn1|μN(t)γ},
and consider the embedded Markov chain Zn=μN(τn) defined at hitting times of small neighborhood of the stable limit sets Ki,i=1,,l. The one-step transition probabilities of Zn are given by
P(ν,γj)=Pν(Znγj)=Pν(μN(τn)γj),
when Zn1=νγi. The upper and lower bound estimates of these transition probabilities are given in Lemma 23 and play a central role in the remainder of this section.

We first give an estimate of the stopping time τ1 of the first reentrance into the r1-neighborhood of one of the compact Ki. Note that similar results were established in Hwang and Sheu (1990, lemma 1.3) for small-noise diffusion processes, and in Yasodharan and Sundaresan (2019, lemma 3.6) for complete interaction mean-field systems with jumps.

Lemma 13.

Given ε>0 and r0 small enough, there exists N01 such that for any NN0 we have

Eντ1exp{Nε}, for any νγ¯.(5.1)

Proof.

First, notice that Eντ1=Eνσ0+Eν[τ1σ0]. By Lemma 20, there exists δ>0 and N01 such that for all r0δ,νγ and NN0, we have

Eνσ0<exp{Nε}.

Moreover, Eν[τ1σ0]=Eν[EμN(σ0)τF], where F=(M1N(Z))2rγ¯. Because the compact set F does not contain any ω-limit set, Corollary 3 allows us to deduce that there exists a constant κ>0 such that EμN(σ0)τFκ, and thus Eν[τ1σ0]κ. Taking N large enough gives (13). □

Let L={1,2,,l} be the indices corresponding to the compact sets K1,K2,,Kl given in Assumption 2. For any WL, introduce the following stopping times:

τ^W=inf{t>0:μN(t)iWγi},τ¯W=inf{t>0:μN(t)iL/Wγi}.

For a W-graph g, set V˜(g)=(m,n)gV˜(Km,Kn). For iL/W and jW, let Gi,j(W) denote the set of W-graphs in which there is a sequence of arrows leading from i to j. For any subset WL, define

Ii(W)min{V˜(g):gG(W)}min{V˜(g):gG(W{i}) orgGi,j(W{j}),ij,jLW}.

The next lemma gives upper and lower bound estimates for the mean entrance time into small neighborhoods of a set of compacts indexed by WL, starting from the neighborhood of a given compact Ki, with iW. Similar estimates have been obtained in Hwang and Sheu (1990, part I, lemma 1.6) and Yasodharan and Sundaresan (2019, lemma 3.10) for small-noise diffusion processes and finite-state mean-field systems on complete graphs, respectively.

Lemma 14.

Let WL, and let iLW. Given ε>0, there exists δ>0 and N01 such that for any r0δ,νγi and NN0, we have

exp{N(Ii(W)ε)}Eν[τ^W]exp{N(Ii(W)+ε)}.

Proof.

By the strong Markov property, one obtains

Eν[τ^W]=Eν[τv]=m=1E[𝟙v=mτm]=m=1mE[𝟙v=mEμN(τm1)[τ1]],
where v is the hitting time of the Markov chain Zn into the set γW=iWγi. Moreover, using Lemma 13, for sufficiently small r0 and sufficiently large N, we obtain
Eν[τ^W]exp{Nε}m=1mE[𝟙v=m].

Notice that the sum term in the last inequality corresponds to the expectation of the number of steps from ν until the first entrance in iWγi. Thus using the upper bound estimate given in Freidlin and Wentzell (2012, chapter 6, lemma 3.4) we find

Eν[τ^W]exp{N(Ii(W)+ε)}.

Furthermore, Lemma 21 allows us to deduce that, for all sufficiently small r0 and sufficiently large N,

Eν[τ1]exp{Nϵ}
for all νγ. Hence, using the lower bound estimate in Freidlin and Wentzell (2012, chapter 6, lemma 3.4), we deduce that
Eν[τ^W]exp{N(Ii(W)ε)}
for all νγi and sufficiency large N. The lemma is proven. □

Define

Ii,j(W)min{V˜(g):gGi,j(W)}min{V˜(g):gG(W)}.

The following result gives the estimate of the probability that the first entry of μN into a neighborhood of a set WL takes place via a given compact set Kj, with jW, starting from a neighborhood of Ki, with iLW.

Lemma 15.

Let WL,iLW and jW. For any ε>0, there exists δ>0 such that for any 0<r0<δ, sufficiently large N, and all νγi we have

exp{N(Iij(W)+ε)}Pν(μN(τ^W)γj)exp{N(Iij(W)ε)}.

Proof.

This follows by applying (Freidlin and Wentzell (2012, chapter 6, lemma 3.3) and making use of the estimate in (A.3). □

We now introduce the important notion of cycle, which, roughly speaking, describes how the process runs through its lifetime. Indeed, as explained above, for large but finite N, and over large time intervals, there are passages of the process μN between the neighborhoods of the compact sets Ki. The cycles then describe the most probable order in which the trajectories of μN traverse these neighborhoods and the time required to go from one compact to another. Notice nevertheless that the notion of cycle used here was introduced in Hwang and Sheu (1990), which is slightly different from the classical Freidlin and Wentzell notion of cycle (Freidlin and Wentzell (2012)).

Recall the definition of V˜(Ki,Kj) in (4.19), and set V˜(Ki)=minjiV˜(Ki,Kj). From the estimate in (A.3) of the one-step transition probabilities of the Markov chain Zn, one can notice that, starting from a neighborhood of a given compact Ki, the most likely set that will be visited by the process μN, for large enough N, is the one that reaches the minimum V˜(Ki). Denote by ij if V˜(Ki)=V˜(Ki,Kj). This gives us an oriented graph structure where the nodes are given by the set L={1,,l}, and the edges are given by the relation ij, for i,jL. We refer to this graph by L. Moreover, for i,jL, we say that ij if there exists a sequence of arrows leading from i to j, that is, if there exists i1,i2,,in in L such that ii1i2inj.

Definition 2.

A cycle π in L is a subgraph of L satisfying the following:

  1. iπ and ij imply jπ,

  2. For any ij in π, ij and ji.

For proof of the existence of cycles in L, one can consult Hwang and Sheu (1990, lemma A1). Next, we describe the decomposition of the set L into a hierarchy of cycles. Setting L0=L, the cycles of rank 1, or the 1-cycles, are defined as

L1{π|π is a cycle in L0}{iL0|i is not in any cycle}.

We use the superscript 1 to refer to the 1-cycles, namely π1. For π11,π21L1 two 1-cycles, with π11π21, let V^(π11)max{V˜(K)|Kπ11} and

V˜(π11,π21)V^(π11)+min{V˜(K,K)V˜(K)|Kπ11,Kπ21},V˜(π11)min{V˜(π11,π21):π21L1,π21π11}.

We say that π11π21 if V˜(π11)=V˜(π11,π21), and π11π21 if there is a sequence of arrows leading from π11 to π21. This gives a cycle of second order, or a 2-cycle, and we use the notation π2 to denote them. In this way, V˜(π1) represents the exit rate from a cycle π11, as specified by Lemma 16 below.

By recurrence, assuming that we have defined up to m-cycles, we set

Lm={πm|πm is a cycle in Lm1}{πm1Lm1|πm1 is not in any m -cycle}.

For π1m,π2mLm,π1mπ2m, let V^(π1m)max{V˜(πm1)|πm1π1m} and

V˜(π1m,π2m)V^(π1m)+min{V˜(π1m1,π2m1)V˜(π1m1)|π1m1π1m,π2m1π2m},V˜(π1m)min{V˜(π1m,π2m):π2mLm,π2mπ1m}.

We say that π1mπ2m if V˜(π1m)=V˜(π1m,π2m), which gives us the (m+1)-cycle. We keep going until we reach a given m for which the set of m-cycle is a singleton. From now on, we will use, with a slight abuse of notation, the notation πk to refer to both the k-cycle πk and the set of elements of L constituting it. Recall that for WL,γW=iWγi. Before stating some important results about cycles, we first introduce an example to help the reader have a clear picture of this notion.

Example 1.

Let the set of indices be L={1,2,,8}, and consider the matrix corresponding to the values of V˜(Ki,Kj), for i,jL

(02467612860189111315570101189115102003489101112701816217111391108689148134010151297101150)

Set L0=L. Using the definition above, we find three 1-cycles, π11={1,2,3}, characterized by the edges 12,23, and 31,π21={4,5}, characterized by the edges 45, and 54, and finally, π31={6,7,8}, characterized by the edges 68,87 and 76. Thus L1={π11,π21,π31}.

Now, in order to find the 2-cycles, we use again the construction above. Straightforward computations give V^(π11)=5,V˜(π11,π21)=9,V˜(π11,π31)=8. Thus, we deduce that π11π13. Moreover, we obtain V^(π31)=6,V˜(π31,π11)=7,V˜(π31,π21)=8, and thus, π31π11. Finally, we find V^(π21)=7,V˜(π21,π11)=9,V˜(π21,π31)=8, from which we deduce that π21π31. Hence, we have L2={{π11,π31},{π21}}, which represents the collection of 2-cycles. Denote by π12={π11,π31},π22={π21} the two elements of L2. Now, in order to identify the set of 3-cycles, we find again by simple calculations of the following quantities V^(π12)=8, and V˜(π12,π22)=10. Moreover, V^(π22)=7 and V˜(π22,π12)=8. Therefore, π12π22 and π22π12, which gives us the unique 3-cycle π3={π12,π22}, the only element of L3. Now, we stop, because L3 is a singleton. See Figure 2 for an illustration.

The next result gives an estimate of the mean exit time from a cycle.

Figure 2. The Hierarchy of Cycles in Example 1
Lemma 16.

Let πk be a k-cycle, and let iπk. Moreover, denote by W=Lπk the set of compacts not contained in πk. Then, given ε>0, there exist δ>0 and N01 such that for any r1δ,νγi and NN0, we have

exp{N(V˜(πk)ε)}Eν[τ^W]exp{N(V˜(πk)+ε)}.

Proof.

We have, from Hwang and Sheu (1990, lemma A3) and Hwang and Sheu (1990, corollary A4), that Ii(W)=V˜(πk). Using this together with Lemma 14 leads to the result. □

The next result gives an estimate of the probability of going from one k-cycle to another without passing by any other element of Lk.

Lemma 17.

Let π1k,π2k be two distinct k-cycles, and let iπ1k. Moreover, denote W=Lπ1k. Then, given ε>0, there exist ρ>0 and N01 such that, for all r1ρ,νγi, and NN0, we have

exp{N(V˜(π1k,π2k)V˜(π1k)+ε)}Pν(μN(τ^W)γπ2k)exp{N(V˜(π1k,π2k)V˜(π1k)ε)}.

Proof.

From Lemma 15 we have, for each jπ2k and large enough N,

exp{N(Ii,j(W)+ε)}Pν(μN(τ^W)γj)exp{N(Ii,j(W)ε)}.

Therefore, summing over the disjoint compacts Ki we obtain

jπ2kexp{N(Ii,j(W)+ε)}Pν(μN(τ^W)γπ2k)jπ2kexp{N(Ii,j(W)ε)}.

From the sums above, we select the term decreasing more slowly than the remaining ones, which gives us

exp{N(min{Ii,j(W):jπ2k}+ε)}Pν(μN(τ^W)γπ2k)exp{N(min{Ii,j(W):jπ2k}ε)}.

Finally, from Hwang and Sheu (1990, lemma A5), we have that min{Iij(W):jπ2k}=V˜(π1k,π2k)V˜(π1k), which leads to the stated result. □

5.2. Convergence to the Invariant Measure

As aforementioned, there exists, under Assumption 1, a unique invariant measure N for the empirical vector process μN. Thus, the distribution of μN converges, as time t, toward N. However, one might investigate the corresponding rate of convergence. Therefore, using the results from the previous section, we show that, when the time is of order exp{(Λ+δ)N}, with δ>0 and Λ a suitable constant detailed above, the empirical measure is very close to its invariant measure N. Interestingly, despite the heterogeneity introduced by the block structure, a similar constant appears in the case of small-noise diffusion processes (Hwang and Sheu 1990, lemma 1.3) and in the case of homogeneous mean-field systems with jumps in Yasodharan and Sundaresan (2019, lemma 3.6). Before stating our main result, let us introduce further notations and intermediate results.

Let i0L be such that min{V˜(g):gG(i0)}=min{V˜(g):gG(i),iL}. Moreover, define

Λmin{V˜(g):gG(i),iL}min{V˜(g):gG(i,j),i,jL,ij}.

Let PT(ν,·)=Pν(μN(T)·) denote the transition probability kernel associated with the empirical process μN. The next result gives a lower bound for the transition probability PT(ν,Ki0) of reaching a small neighborhood of Ki0 when T is of order exp{N(Λδ0)} for some δ0>0.

Theorem 6.

Given ε>0, there exist δ0>0, r > 0, and N01 such that, for all r1r, NN0, and ν(M1(Z))2r, we have

PT0(ν,γi0)exp{Nε},
where T0=exp{N(Λδ0)}. Furthermore, there exist ν0(M1(Z))2r and β>0 such that, for all NN0 and ν[ν0]r1,
PT0(ν,γi0)exp{Nβ}.

Proof.

Replacing the space M1(Z) by the product space (M1(Z))2r together with the corresponding metrics, the proof given in Yasodharan and Sundaresan (2019, theorem 3.21) adapted from Hwang and Sheu (1990, theorem 2.3, part I) holds verbatim. □

Corollary 2.

Under the conditions of Theorem 6, for all ν(M1(Z))2r,ξγi0, and N sufficiently large, we have

PT0(ν,ξ)exp{2Nε}.

Proof.

The proof follows verbatim the proof given in Yasodharan and Sundaresan (2019, corollary 3.22). □

We state now the main result of this section, which gives the time scale at which the empirical vector converges toward its invariant measure.

Theorem 7.

There exists a constant Λ0 such that, for any δ>0, there exist ε>0 and N01 such that, for all ν(M1(Z))2r and NN0,

|Eν[f(μN(T))]fdN|fexp{exp(Nε)},
where T=exp{N(Λ+δ)} and f is any bounded and measurable function on (M1(Z))2r.

Proof.

Let ε>0, and let T0, δ0, r, r1, and N01 be as in the statement of Theorem 6. By Corollary 2 we have that, for any ν(M1(Z))2r and ξ[Ki0]r1,

PT0(ν,ξ)exp{2Nε}.(5.2)

Moreover, by the Markov property and using Corollaries 2 and 1, we have that, for any ν(M1(Z))2r,ξ[Ki0]r1, and some fixed t,

PT0(ν,ξ)ν[Ki0]PT0t(ν,ν)Pt(ν,ξ)exp{2Nε}infν[Ki0]Pt(ν,ξ)exp{2Nε}exp{Nsupν[Ki0]St(ξ|ν)},(5.3)
for sufficiently large N. Notice that, thanks to (5.2) and because ST(ξ,ν) is bounded for all ν,ξ(M1(Z))2r, one can find a positive function U(ξ) such that U(ξ)=0 for ξ[Ki0]r1, and U(ξ)supν[Ki0]St(ξ|ν) for ξ[Ki0]r1.

Define πN(ξ)=cNexp{NU(ξ)} such that U(ξ)=0 for ξ[Ki0]r1, and

PT0(ν,ξ)cNexp{NU(ξ)}
for all ν(M1(Z))2r,ξ[Ki0], and sufficiently large N, where cN is a constant chosen such that πN is a probability measure on the product space (M1(Z))2r. Moreover, set QT0(ν,·)=PT0(ν,·)/πN(·). Hence, by (5.2), QT0(ν,ξ)1 for any ν,ξ(M1(Z))2r. Let f be a bounded measurable function on (M1(Z))2r. Therefore, for any ν1,ν2(M1(Z))2r and sufficiently large N, we have
Eν1(f(μN(T0)))Eν2(f(μN(T0)))=(M1(Z))2rf(ξ)PT0(ν1,dξ)(M1(Z))2rf(ξ)PT0(ν2,dξ)=(M1(Z))2rf(ξ)QT0(ν1,dξ)πN(dξ)(M1(Z))2rf(ξ)QT0(ν2,dξ)πN(dξ)=(M1(Z))2rf(ξ)(QT0(ν1,dξ)exp{2Nε})πN(dξ)(M1(Z))2rf(ξ)(QT0(ν2,dξ)exp{2Nε})πN(dξ)supξ(M1(Z))2rf(ξ)(1exp{2Nε})infξ(M1(Z))2rf(ξ)(1exp{2Nε})=(1exp{2Nε})|supξf(ξ)infξf(ξ)|.(5.4)

Thence we find,

supν1,ν2|Eν1(f(μN(T0)))Eν2(f(μN(T0)))|(1exp{2Nε})f.(5.5)

Hence, by repeating the previous steps k times using the Chapman-Kolmogorov property given that μN is Markov, we find

supν1,ν2|Eν1(f(μN(kT0)))Eν2(f(μN(kT0)))|(1exp{2Nε})kf,(5.6)
from which we deduce that
supν|Eν(f(μN(kT0)))N,f|(1exp{2Nε})kf.(5.7)

Choose k=exp{N(δ0+δ)}. Thus, kT0=exp{N(δ+Λ)}. Moreover, using the property (1+xn)nexp{x} as n, one obtains for large k

supν|Eν(f(μN(kT0)))N,f|exp{exp{N(2ε+δ0+δ)}}f.(5.8)

Choosing ε small enough such that ε=2ε+δ0+δ>0, one finally obtains

supν|Eν(f(μN(T)))N,f|exp{exp{Nε}}f,(5.9)
for large enough N, with T=exp{N(δ+Λ)}. The theorem is proven. □

6. Conclusion and Discussion

We have addressed in this paper the large-time behavior of the empirical measure vector associated with a family of finite-state mean-field models with multiclasses. In particular, we have established the large deviations principle for the invariant measure when the McKean-Vlasov limiting system has a unique asymptotically stable equilibrium and when there are multiple ω-limits sets. Also, we established various metastability phenomena estimates together with the speed of convergence of the empirical measure vector to its invariant measure. These results are of interest for various real-world applications ranging from engineering systems to the spread of infectious diseases. In particular, the multispecies setting represented by the block graph structure can be used as a model for various phenomena.

Many interesting questions remain nevertheless open and are worthwhile to explore. For instance, for the family of block graphs analyzed in the current paper, the degree of each node is O(N). An interesting extension is to consider other scaling regimes for the degree of the nodes. For example, the number of neighbors of the peripheral nodes could grow as O(N). Even though it is sublinear in N, there could be a strong interaction. It would be interesting to study the large-time behavior of the vector empirical measure process in such cases.

The asymptotic analysis conducted in the current paper is on the vector of empirical measures. However, one might be interested to study the large deviation of the global empirical measure. Given the heterogeneity of the particles composing the global empirical measure, the latter is not a Markov process. Yet from the large deviations of the vector of empirical measures, one can use the contraction principle to deduce the large deviations principle for the sequence of global empirical measures. The question then is to understand the rate function. Another interesting question is to find criteria for the uniqueness of stationary distribution of the global empirical measure.

A natural extension of the current work is to consider the case of countable state spaces. Notice that if one replaces the finite space Z by a countable state space E={0,1,2,}, the corresponding set M1(E) of probability measures over E is no longer compact or finite-dimensional. Therefore, one has to impose stronger conditions on the rate functions to study the asymptotics of the system. For instance, the large deviations principle of the empirical measures has been established in Feng (1994) and Léonard (1995a) under different assumptions on the Levy kernels governing the jumps. However, the large deviations principle for the family of invariant measures is not available in the general countable state-space context and thus remains an open problem. In a recent contribution, Yasodharan and Sundaresan (2021), sufficient conditions have been established for a class of interacting particle systems on countable state space under which the sequence of invariant measures satisfies the large derivation principle with a rate function governed by the Freidlin-Wentzell quasipotential. Nonetheless, the proofs in Yasodharan and Sundaresan (2021) hold only under specific conditions on the transition graph and the forward transition rates. Also, the results in Yasodharan and Sundaresan (2021) are restricted to the case where the limiting McKean-Vlasov system has a unique globally asymptotically stable equilibrium and do not hold when there are multiple ω-limit sets. Thus, the latter case remains open to exploration. In particular, the Freidlin-Wentzell approach for studying large deviations of the invariant measures used in the current paper is not directly applicable in the case of countable state space because it requires the uniform large deviations principle over open subsets of M1(E), which is not available. Consequently, one cannot use this approach to study the related exit problems and metastability phenomena. It is then a challenging open question. Of course, these challenges are heightened in the multiclasses context considered in the current paper due to the technicalities arising from the product space setting.

Acknowledgments

The authors thank the anonymous referees for having read the paper with great care and having made several very useful suggestions that improved the exposition.

Appendix A: Freidlin-Wentzell program

We give here generalizations to our setting of a series of lemmas introduced in Freidlin and Wentzell (2012) in the case of diffusion processes and generalizations in Borkar and Sundaresan (2012) in the case of jump processes in one homogeneous population. These results play an important role in the study of the large-time behavior of the system. Because this is a slight generalization, we will give full proofs only when needed and refer to the previous references otherwise.

Lemma 18

(Freidlin and Wentzell 2012, chapter 6, lemma 1.2). For any ε>0 and any compact set K(M1(Z))2r, there exists a T0 such that for any ν,ξK there exists a function μ(t), with t[0,T], satisfying μ(0)=ν,μ(T)=ξ,TT0 with S[0,T](μ|ν)V(ξ|ν)+ε.

Proof.

The proof of Borkar and Sundaresan (2012, lemma A.1) holds verbatim by replacing the metric ρ0(·,·) by the product metric ρ02r(·,·). □

Lemma 19

(Freidlin and Wentzell 2012, chapter 6, lemma 1.6). Let all points of a compact set K(M1(Z))2r be equivalent to each other, but not to any other point in (M1(Z))2r. Then, for any ε>0,δ>0, ν, ξK, there exist a T > 0 and a function μ(t) defined on [0,T], with μ(0)=ν,μ(T)=ξ,μ(t)[K]δ for all t[0,T], and S[0,T](μ|ν)<ε.

Proof.

Using Lemma 1, the proof follows verbatim the proof of Borkar and Sundaresan (2012, lemma A.2). □

Let A(M1(Z))2r, and define the stopping time

τA=inf{t>0|μN(t)A},
which gives the first exit time from A. The law of this exit time depends on N and νN through the law pνNN of μN.

Lemma 20

(Freidlin and Wentzell 2012, chapter 6, lemma 1.7). Let all points of a compact set K(M1(Z))2r be equivalent to each other, and let K(M1(Z))2r. For any ε>0, there exists a δ>0 such that, for all sufficiently large N and all ν[K]δ, we have

Eτ[K]δ<eNε,(A.1)
where the expectation is with respect to the measure pνN.

Proof.

Using Corollary 1, the proof of Borkar and Sundaresan (2012, lemma A.3) holds verbatim by replacing the metric ρ0(·,·) by the product metric ρ02r(·,·). □

Lemma 21

(Freidlin and Wentzell 2012, chapter 6, lemma 1.8). Let K be an arbitrary compact subset of (M1(Z))2r, and let G be a neighborhood of K. For any ε>0, there exists a δ>0 such that, for all sufficiently large N and all ν belonging to [K]¯δ, we have

Eν[[0,τG]𝟙[K]¯δ(μN(t))]eεN,(A.2)
where the expectation is with respect to the measure pνN.

Proof.

The proof of Borkar and Sundaresan (2012, lemma A.4) holds verbatim by replacing the metric ρ0(·,·) by the product metric ρ02r(·,·). □

Lemma 22

(Freidlin and Wentzell 2012, chapter 6, lemma 1.9). Let K be a compact subset of (M1(Z))2r not containing any ω-limit set entirely. Then, there exist positive constants c and T0 such that, for all sufficiently large N, any T>T0, and any νK, we have

pνN{τK>T}eNc(TT0).

Proof.

The proof of Borkar and Sundaresan (2012, lemma A.5) holds verbatim by replacing the metric ρ0(·,·) by the product metric ρ02r(·,·). □

Corollary 3.

Let K be a compact set not containing any ω-limit set entirely. There exists a positive integer N0 and a positive constant c such that for NN0 and any νK, we have

E[τK]T0+1/(cN0)
where the expectation is with respect to the measure pνN.

Proof.

See Freidlin and Wentzell (2012, chapter 6, p. 149). □

Recall that r0 and r1 are positive numbers such that 0<r0<12mini,jρ0r(Ki,Kj) and 0<r1<r0. We denote by C=(M1(Z))2ri=1l[Ki]r0 and let Γi=[Ki]r0¯ be the closure of [Ki]r0 for i=1,,l. Moreover, we denote by γi=[Ki]r1 the r1-neighborhood of Ki and γ=i=1lγi. Moreover, recall the following stopping times τ0=0,σn=inf{tτn|μN(t)C} and τn=inf{tσn1|μN(t)γ}, and consider the embedded Markov chain of states at hitting times of neighborhood of the stable limit sets Zn=μN(τn). Let

pN(ν,γj¯)=pνN(Znγi¯),
when Zn1=ν is the one-step transition probability of Zn.

Lemma 23

(Freidlin and Wentzell 2012, chapter 6, lemma 2.1). For any ε>0, there is a small enough r0>0 such that for any r2 satisfying 0<r2<r0, there is an r1 satisfying 0<r1<r2 such that for all sufficiently large N, for all ν[Ki]r2, the one-step transition probabilities of Zn satisfy

exp{N(V˜(Ki,Kj)+ε)}pN(ν,γj¯)exp{N(V˜(Ki,Kj)ε)}.(A.3)

Proof.

Replacing the space M1(Z) by the product space (M1(Z))2r endowed with the product norm ρ02r, the proof of Borkar and Sundaresan (2012, lemma A.6) holds verbatim. □

Finally, the next result gives the limiting behavior of the empirical measure vector μN when we first let t go to infinity and then let N go to infinity.

Theorem 8

(Freidlin and Wentzell 2012, chapter 6, theorem 4.1). Assume that Assumption 2 holds true. Then, for any ε>0, there exists r1>0, which can be chosen arbitrarily small, such that the N-measure of the r1-neighborhood γi of the compact Ki satisfies

exp{N(W(Ki)miniW(Ki)+ε)}N(γi)exp{N(W(Ki)miniW(Ki)ε)}
for all sufficiently large N.

Proof.

Choose small positive 0<r1<r2<r0 such that the inequalities in (A.3), (A.1), and (A.2) are satisfied for sufficiently large N with ε/4l replacing ε. One can notice that the Markov chain Zn is irreducible and thus has an invariant measure. By Freidlin and Wentzell (2012, chapter 6, lemma 3.2), and by selecting the exponential terms that decrease more slowly, when N is large enough, the values of the normalized invariant measure ϑN of the chain Zn lie in the interval

exp{N(W(Ki)miniW(Ki)±l12lε)}.

Recall the following formula, which expresses, up to a factor, the invariant measure N of the process μN in terms of the invariant measure ϑN of the chain Zn on γ (see Freidlin and Wentzell 2012, chapter 6, equation (4.1)):

N(B)=γϑN(dν)Eν[0τ1𝟙B(μN(t))dt],(A.4)
where the expectation is with respect to the measure pνN with starting conditions ν. Using this formula we find, for any γi, with i=1,,l,
N(γi)=γϑ(dν)E[0τ1𝟙γi(μN(t))dt]=γiϑ(dν)E[0τ1𝟙γi(μN(t))dt].

Using the estimates in (A.2) and (A.1), we find that

exp{N(W(Ki)miniW(Ki)+2l14lε)}N(γi)exp{N(W(Ki)miniW(Ki)2l14lε)}.(A.5)

By summing over i=1,,l, we get

N((M1(Z))2r)exp{N(2l14lε)}.(A.6)

Using again the formula (A.4) together with the definition of the stopping times σn and τn, we find

N(M1((Z))2r)=γϑN(dν)Eν[τ1]=γϑN(dν)(Eν[σ0]+Eν[EμN(σ0)[τ1]])supνγEν[σ0]+supxCEx[τ1].

By inequality (A.1), we find that supνγEν[σ0]<exp{Nε4l}, and by Corollary 3 we have that supxCEx[τ1] is bounded above by some constant. Using this together with the lower bound in (A.6), we obtain, by dividing N(γi) in (A.5) by N((M1(Z))2r), the lower and upper bounds for the normalized measure N of the r1-neighborhood γi. The theorem is proven. □

Appendix B: Technical Proofs

We give here the proof of some technical results.

B.1. Proof of Lemma 1

This is a mild generalization of Borkar and Sundaresan (2012, lemma 3.2) to the multi-populations case. We prove each of the three assertions, respectively.

  1. Let us ignore for the moment the E constraint by supposing that all possible transitions are allowed. Let ξ,ν(M1(Z))2r with μ(0)=ν and μ(T)=ξ, and consider the constant velocity path given by

    μ(t)=(1tT)ν+tTξ,t[0,T],(B.1)
    from which we can see that
    μ˙(t)=ξνT,t[0,T],(B.2)
    a constant velocity. Note that (B.1) can be rewritten as follows. For all 1jr and t in [0,T]
    μjc(t)=(1tT)νjc+tTξjc,(B.3)
    μjp(t)=(1tT)νjp+tTξjp.(B.4)

    Now we construct rate matrices Lj,c(t)=(lz,zj,c(t))z,zZ and Lj,p(t)=(lz,zj,p(t))z,zZ that ensure the traversal of this constant velocity path. Note that there is conservation of mass between the initial and terminal states, and thus for all 1jr,zνjc(z)=zξjc(z) and zνjp(z)=zξjp(z). Therefore, on can construct mass transport parameters gz,zj,c and gz,zj,p such that for any two states z,zZ with νjc(z)>ξjc(z) (resp. νjp(z)>ξjp(z)) and z with νjc(z)<ξjc(z) (resp. νjp(z)<ξjp(z)), the quantity gz,zj,c (resp. gz,zj,p) is the fraction of the excess of mass νjc(z)ξjc(z) (resp. νjp(z)ξjp(z)) that goes from z to z. In particular, the coefficients gz,zj,ι for ι{c,p} satisfy, for all 1jr, the following conditions:

    gz,zj,ι[0,1] for all z,zZ,(B.5)
    gz,zj,ι=0 if νjι(z)ξjι(z) or νjι(z)ξjι(z),(B.6)
    z:νjι(z)<ξjι(z)gz,zj,ι=1 if νjι(z)>ξjι(z),(B.7)
    and
    z:νjι(z)>ξjι(z)[νjι(z)ξjι(z)]gz,zj,ι=ξjι(z)νjι(z) if νjι(z)<ξjι(z).(B.8)

    The first condition follows from the definition of the fractions gz,zj,ι. The second attests that no mass is transferred from a state with no mass excess, and no mass is received by a state with mass excess. The third point tells us that there is no mass destruction, and the last point stipulates that no mass is created. By using these mass transfer parameters, we construct the rate matrices Lj,c(t) and Lj,p(t) as follows. The diagonal elements are given, for ι{c,p}, by

    lz,zj,ι(t)=(νjι(z)ξjι(z))T(μjι(t)(z)),(B.9)
    for all zZ that satisfy νjι(z)>ξjι(z) and lz,zj,ι(t)=0 otherwise. The off-diagonal elements are given by
    lz,zj,ι(t)=lz,zj,ι(t)gz,zj,ι,(B.10)
    if νjι(z)>ξjι(z) and zz, and lz,zj,ι(t)=0 if νjι(z)ξjι(z), for any zZ. Using these definitions of the rate matrices Lj,c(t) and Lj,p(t), and the properties of the mass transport coefficients gz,zj,c and gz,zj,p, it is easy to prove that for 1jr and t[0,T] (see Borkar and Sundaresan 2012, p. 360),
    μ˙jc(t)=Lj,c(t)*μjc(t),μ˙jp(t)=Lj,p(t)*μjp(t).

    Let us now evaluate the difficulty of the passage S[0,T](μ|ν) at this constant velocity path μ. Theorem 1 tells us that if S[0,T](μ|ν)<, then S[0,T](μ|ν) is given by (3.18), and this is particularly true if the 2r integral terms in (3.18) are finite. Notice that if, for a given j, μjι(T)=ξjι(z)=0 and νjι(z)>0 for zz, then lz,zj,ι(T) is not bounded. Therefore, we need to provide a bound for (3.18) in the case of the constant velocity path. We start by upper bounding the sums in (3.18) for which the rates lz,zj,ι(t) are strictly positive on [0,T]. To this end we introduce the set

    ϒjι={(z,z)|zz,νjι(z)>ξjι(z),νjι(z)<ξjι(z),gz,zj,ι>0}.

    Thus, from the definition of the Legendre transform τ*, the right-hand side of (3.18) can be written as

    j=1r[αjpjc0T((z,z)ϒjc((μjc(t)(z))lz,zj,c(t)log(lz,zj,c(t)λz,zc(μjc(t),μjp(t)))(μjc(t)(z))lz,zj,c(t)+(μjc(t)(z))λz,zc(μjc(t),μjp(t))))dt+αjpjp0T((z,z)ϒjp((μjp(t)(z))lz,zj,p(t)log(lz,zj,p(t)λz,zp(μjc(t),μ1p(t),,μrp(t)))(μjp(t)(z))lz,zj,p(t)+(μjp(t)(z))λz,zp(μjc(t),μ1p(t),,μrp(t))))dt].(B.11)

    From (B.9) and (B.10), we find that (μjι(t)(z))lz,zj,ι(t)=T1(νjι(z)ξjι(z))gz,zj,ι. Moreover, from Assumption 1, we obtain |logλz,zι(·,·)||logc|+|logC|. Therefore, (B.11) is upper bounded by

    j=1r[αjpjc0T((z,z)ϒjc((T1(νjc(z)ξjc(z))gz,zj,clog((νjc(z)ξjc(z))gz,zj,cT(μjc(t)(z)))+T1(νjc(z)ξjc(z))(|logc|+|logC|+1)+C))dt+αjpjp0T((z,z)ϒjp((T1(νjp(z)ξjp(z))gz,zj,plog((νjp(z)ξjp(z))gz,zj,pT(μjp(t)(z)))+T1(νjp(z)ξjp(z))(|logc|+|logC|+1)+C))dt],(B.12)
    which in turn is bounded by
    j=1r[αjpjc((z,z)ϒjc(νjc(z)ξjc(z))gz,zj,c|log((νjc(z)ξjc(z))gz,zj,c)|(z,z)ϒjcT1(νjc(z)ξjc(z))gz,zj,c0Tlog(μjc(t)(z))dt+νjcξjc|logT|+νjcξjc(|logc|+|logC|+1)+CTK2)+αjpjp((z,z)ϒjp(νjp(z)ξjp(z))gz,zj,p|log((νjp(z)ξjp(z))gz,zj,p)|(z,z)ϒjpT1(νjp(z)ξjp(z))gz,zj,p0Tlog(μjp(t)(z))dt+νjpξjp|logT|+νjpξjp(|logc|+|logC|+1)+CTK2)],(B.13)
    with · referring to the total variation distance. Observe that for x[0,1], the function x|logx| is upper bounded, say by Ϝ>0. Moreover, for a fixed z, z:zzgzzj,ι=1. Therefore, the terms (z,z)ϒjι(νjι(z)ξjι(z))gz,zj,ι|log((νjι(z)ξjι(z))gz,zj,ι)| are bounded by
    z:νjι(z)>ξjι(z)(νjι(z)ξjι(z))|log(νjι(z)ξjι(z))|(z:(z,z)ϒjιgz,zj,ι)+(z,z)ϒjι(νjι(z)ξjι(z))gz,zj,ι|loggz,zj,ι|z:νjι(z)>ξjι(z)(νjι(z)ξjι(z))|log(νjι(z)ξjι(z))|+νjιξjιϜ.(B.14)

    On the other hand, using the change of variable u=μjι(t)(z) and then (B.2), one obtains

    0Tlog(μjι(t)(z))dt=T(ξjι(z)νjι(z))1νjι(z)ξjι(z)logudu=T(ξjι(z)νjι(z))1[uloguu]νjι(z)ξjι(z).(B.15)

    Therefore, (B.12) is upper bounded by

    j=1r[αjpjc(z:νjc(z)>ξjc(z)(νjc(z)ξjc(z))|log(νjc(z)ξjc(z))|+νjcξjcϜ+(z,z)ϒjc|ξjc(z)logξjc(z)νjc(z)logνjc(z)|+νjcξjc+νjcξjc|logT|+νjcξjc(|logc|+|logC|+1)+CTK2)+αjpjp(z:νjp(z)>ξjp(z)(νjp(z)ξjp(z))|log(νjp(z)ξjp(z))|+νjpξjpϜ+(z,z)ϒjp|ξjp(z)logξjp(z)νjp(z)logνjp(z)|+νjpξjp+νjpξjp|logT|+νjpξjp(|logc|+|logC|+1)+CTK2)]j=1r(αjpjcC(T)+αjpjpC(T)),(B.16)
    where C(T) and C(T) are two constants that do not depend on νjι and ξjι for any ι{c,p} and 1jr.

    Let us now consider the case where the pairs (z,z)ϒjι, that is, for which lz,zj,ι=0. Using τ(1)=1, the corresponding integral terms in (3.18) become

    0T(z,z)ϒjcμjc(t)(z))λz,zc(μjc(t),μjp(t))dtK2CT,0T(z,z)ϒjcμjp(t)(z))λz,zp(μjc(t),μ1p(t),,μrp(t))dtK2CT.(B.17)

    Combining this with (B.16) gives S[0,T](μ|ν)j=1r(αjpjcC¯(T)+αjpjpC¯(T)) for some positive constants C¯ and C¯ that do not depend on νjι and ξjι.

    Finally, let us consider the case where only transitions in E are allowed. Because the directed graph (Z,E) is irreducible, the Markov chain (μ(t),t0) is also irreducible, and thus there exists a finite sequence of intermediate points through which one can move from ν to ξ in m=m(|Z|,E)<+ steps

    ν=ν(0)ν(1)ν(m)=ξ.

    Therefore, one can construct a piecewise linear path μ with constant velocities on each of the m segments such that each segment is covered in time duration T/m. Indeed, define for each k=0,,m1 the constant velocity path

    μk+1(t)=(1tmT)ν(k)+tmTν(k+1),t[kT/m,(k+1)T/m],
    and take μ(t)=μk+1(t) for t[kT/m,(k+1)T/m]. Hence,
    S[0,T](μ|ν)C1(T)=mj=1r(αjpjcC¯(T/m)+αjpjpC¯(T/m)),
    which completes the proof of the first assertion.

  2. This follows immediately from the previous result and (3.22).

  3. Fix ε>0 and take T=ε in (B.16). We can always find a δ(0,ε) such that, if ρ02r(ν,ξ)<δ, then (B.16) is bounded by

    j=1r[αjpjc(6ε+CK2ε)+αjpjp(6ε+CK2ε)].(B.18)

Combining this with (B.17) gives that, for any ν,ξ such that ρ02r(ν,ξ)<δ,

S[0,ε](ξ|ν)j=1r[αjpjc(6ε+2CK2ε)+αjpjp(6ε+2CK2ε)].(B.19)

The result then follows from (3.22). □

B.2. Proof of Lemma 2

We generalize Borkar and Sundaresan (2012, lemma 7.1). From Theorem 1, because S[0,T](μ|ν)<+, the rate function S[0,T](μ|ν) is given by (3.18). Moreover, we can verify that τ*(u1)=uloguu+1ue+1 for all u0. Using this together with (3.18) gives to us

S[0,T](μ|ν)j=1r[αjpjc0T((z,z)E(μjc(t)(z))λz,zc(μjc(t),μjp(t))(lz,zj,c(t)λz,zc(μjc(t),μjp(t))e+1))dt+αjpjp0T((z,z)E(μjp(t)(z))λz,zp(μjc(t),μ1p(t),,μrp(t))(lz,zj,p(t)λz,zp(μjc(t),μ1p(t),,μrp(t))e+1))dt]j=1r[αjpjc0T((z,z)E(μjc(t)(z))lz,zj,c(t))dt+αjpjp0T((z,z)E(μjp(t)(z))lz,zj,p(t))dt]j=1r[αjpjc(e1)CT|E|]+j=1r[αjpjp(e1)CT|E|],
which completes the proof. □

B.3. Proof of Lemma 3

We generalize Borkar and Sundaresan (2012, lemma 7.2). By construction, we have that μ˜=μ(0)=ν and μ˜(T)=μ(βT)=μ(T)=ξ. Fix 1jr. Using μ˙jc(t)=Lj,c(t)*μjc(t) we find that, for all t[0,T],

μ˜˙jc(t)=dμ˜jc(t)dt=dμjc(βt)dt=βμ˙jc(βt)=βLj,c(βt)*μjc(βt)=βLj,c(βt)*μ˜˙jc(t),
from which we deduce that L˜j,c(t)=βLj,c(βt). Using the exact same steps leads to L˜j,p(t)=βLj,p(βt). Let us now evaluate the rate function S[0,T](μ˜|ν) associated with the path μ˜:[0,T](M1(Z))2r. From (3.18), we have
S[0,T](μ˜|ν)=j=1r[αjpjc0T((z,z)E(μ˜jc(t)(z))λz,zc(μ˜jc(t),μ˜jp(t))τ*(l˜z,zj,c(t)λz,zc(μ˜jc(t),μ˜jp(t))1))dt+αjpjp0T((z,z)E(μ˜jp(t)(z))λz,zp(μ˜jc(t),μ˜1p(t),,μ˜rp(t))τ*(l˜z,zj,p(t)λz,zp(μ˜jc(t),μ˜1p(t),,μ˜rp(t))1))dt]=j=1r[αjpjc0T((z,z)E(μjc(βt)(z))λz,zc(μjc(βt),μjp(βt))×τ*(βlz,zj,c(βt)λz,zc(μjc(βt),μjp(βt))1))dt+αjpjp0T((z,z)E(μjp(βt)(z))λz,zp(μjc(βt),μ1p(βt),,μrp(βt))×τ*(βlz,zj,p(βt)λz,zp(μjc(βt),μ1p(βt),,μrp(βt))1))dt].(B.20)

From (3.11), and using the properties of the log function, we can easily verify that

τ(βu1)=β(ulogβ+τ*(u1)+1ββ),u0.

Therefore, we find

S[0,T](μ˜|ν)=j=1r[αjpjc0T((z,z)E(μjc(βt)(z))λz,zc(μjc(βt),μjp(βt))×β{lz,zj,c(βt)λz,zc(μjc(βt),μjp(βt))(logβ)+τ*(lz,zj,c(βt)λz,zc(μjc(βt),μjp(βt))1)+1ββ})dt+αjpjp0T((z,z)E(μjp(βt)(z))λz,zp(μjc(βt),μ1p(βt),,μrp(βt))×β{lz,zj,p(βt)λz,zp(μjc(βt),μ1p(βt),,μrp(βt))(logβ)+τ*(lz,zj,p(βt)λz,zp(μjc(βt),μ1p(βt),,μrp(βt))1)+1ββ})dt].(B.21)

Introducing the change of variables βtt, we obtain

S[0,T](μ˜|ν)=S[0,T](μ|ν)+j=1r[1ββαjpjc0T((z,z)E(μjc(t)(z))λz,zc(μjc(t),μjp(t)))dt+(logβ)αjpjc0T((z,z)E(μjc(t)(z))lz,zj,c(t))dt+1ββαjpjp0T((z,z)E(μjp(t)(z))λz,zp(μjc(t),μ1p(t),,μrp(t)))dt+(logβ)αjpjp0T((z,z)E(μjp(t)(z))lz,zj,p(t))dt].(B.22)

Finally, using Assumption 1, we find (3.23). □

References

  • Benaïm M, Le Boudec J-Y (2008) A class of mean field interaction models for computer and communication systems. Perform. Eval. 65(11–12):823–838.Google Scholar
  • Billingsley P (1999) Convergence of Probability Measures (John Wiley & Sons, New York).Google Scholar
  • Biswas A, Borkar V (2011) Small noise asymptotics for invariant densities for a class of diffusions: A control theoretic view (with erratum). Preprint, submitted, https://arxiv.org/abs/1107.2277.Google Scholar
  • Borkar V, Sundaresan R (2012) Asymptotics of the invariant measure in mean field models with jumps. Stoch. Syst. 2(2):322–380.LinkGoogle Scholar
  • Bouchet F, Gawȩdzki K, Nardini C (2016) Perturbative calculation of quasi-potential in non-equilibrium diffusions: A mean-field example. J. Stat. Phys. 163:1157–1210.Google Scholar
  • Chong C, Klüppelberg C (2019) Partial mean field limits in heterogeneous networks. Stochastic Process. Appl. 129:4998–5036.Google Scholar
  • Collet F (2014) Macroscopic Limit of a bipartite Curie-Weiss model: A dynamical approach. J. Stat. Phys. 157:1309–1319.Google Scholar
  • Collet F, Formentin M, Tovazzi D (2016) Rhythmic behavior in a two-population mean-field Ising model. Phys. Rev. E. 94:042139.Google Scholar
  • Cox J, Greven A (1990) On the long term behavior of some finite particle systems. Probab. Theory Related Fields 85:195–237.Google Scholar
  • Dawson D, Gärtner J (1987) Large deviations from the McKean-Vlasov limit for weakly interacting diffusions. Stochastics 20(4):247–308.Google Scholar
  • Dawson D, Gärtner J (1989) Large deviations, free energy functional and quasipotential for a mean field model of interacting diffusions. Mem. Amer. Math. Soc. 78(398).Google Scholar
  • Dawson D, Greven A (1993) Hierarchical models of interacting diffusions: Multiple time scale phenomena, phase transition, and pattern of cluster-formation. Probab. Theory Related Fields 96:435–473.Google Scholar
  • Dawson D, Greven A (1999) Hierarchically interacting Fleming-Viot processes with selection and mutation: Multiple space time scale analysis and quasi-equilibria. Electron. J. Probab. 4:1–81.Google Scholar
  • Dawson D, Greven A, Vaillancourt J (1995) Equilibria and quasi-equilibria for infinite collections of interacting Fleming-Viot processes. Trans. Amer. Math. Soc. 347(7):2277–2360.Google Scholar
  • Dawson D, Sid-Ali A, Zhao Y (2020) Propagation of chaos and large deviations in mean-field models with jumps on block-structured networks. Preprint, submitted December 4, https://arxiv.org/abs/2012.02870.Google Scholar
  • Dembo A, Zeitouni O (2010) Large Deviations Techniques and Applications, 2nd ed. (Springer, New York).Google Scholar
  • Döring L, Mytnik L (2013) Longtime Behavior for Mutually Catalytic Branching with Negative Correlations, vol. 38 (Springer Proceedings in Mathematics & Statistics, Boston).Google Scholar
  • Feng J, Kurtz T (2006) Large Deviations for Stochastic Processes (Mathematical Surveys and Monographs, American Mathematical Society).Google Scholar
  • Feng S (1994) Large deviations for empirical process of mean-field interacting particle system with unbounded jumps. Ann. Probab. 22(4):2122–2151.Google Scholar
  • Freidlin M, Wentzell A (2012) Random Perturbations of Dynamical Systems, 3rd ed. (Springer, Berlin-Heidelberg).Google Scholar
  • Graham C (2008) Chaoticity for multiclass systems and exchangeability within classes. J. Appl. Probab. 45:1196–1203.Google Scholar
  • Greven A, den Hollander F (2007) Phase transitions for the long-time behavior of interacting diffusions. Ann. Probab. 35(4):1250–1306.Google Scholar
  • Hwang C, Sheu S (1990) Large-time behavior of perturbed diffusion Markov processes with applications to the second eigenvalue problem for Fokker-Planck operators and simulated annealing. Acta Appl. Math. 19:253–295.Google Scholar
  • Knöpfel H, Löwe M, Schubert K, Sinulis A (2020) Fluctuation results for general block spin Ising models. J. Stat. Phys. 178(1):1175–1200.Google Scholar
  • Kuehn C (2015) Multiple Time Scale Dynamics (Springer International Publishing, Switzerland).Google Scholar
  • Léonard C (1995a) Large deviations for long range interacting particle systems with jumps. Annales de l’I.H.P. Probabilités et Statistiques, Tome 31 31(2):289–323.Google Scholar
  • Léonard C (1995b) On large deviations for particle systems associated with spatially homogeneous Boltzmann type equations. Probab. Theory Related Fields 101:1–44.Google Scholar
  • Meylahn JM (2020) Two-community noisy Kuramoto model. Nonlinearity 33(4):1847–1880.Google Scholar
  • Nguyen DT, Nguyen S, Du N (2020) On mean field systems with multi-classes. Discrete Contin. Dyn. Syst. 40(2):683–707.Google Scholar
  • Tang Y, Yuan R, Wang G, Zhu X, Ao P (2017) Potential landscape of high dimensional nonlinear stochastic dynamics with large noise. Sci. Rep. 7(15762):1157–1210.Google Scholar
  • Yasodharan S, Sundaresan R (2019) Large time behaviour and the second eigenvalue problem for finite state mean-field interacting particle systems. Preprint, submitted September 9, https://arxiv.org/abs/1909.03805.Google Scholar
  • Yasodharan S, Sundaresan R (2021) A sufficient condition for the quasipotential to be the rate function of the invariant measure of countable-state mean-field interacting particle systems. Preprint, submitted October 25, https://arxiv.org/abs/2110.12640.Google Scholar
  • Zhou J, Aliyu M, Aurell E, Huang S (2012) Quasi-potential landscape in complex multi-stable systems. R. Soc. Interface 9:3539–3553.Google Scholar