On Laws of Large Numbers for Systems with Mean-Field Interactions and Markovian Switching
Son L. Nguyen, George Yin, and Tuan A. Hoang

TL;DR
This paper establishes laws of large numbers for mean-field systems with Markovian switching, where the empirical measure limit is a random measure influenced by the switching process's history.
Contribution
It introduces a novel approach to characterize the limit as a conditional distribution, addressing challenges posed by the coupling and randomness in switching diffusions.
Findings
Law of large numbers for mean-field switching diffusions established.
Limit of empirical measures is a random measure dependent on switching history.
Characterization of the limit via stochastic McKean-Vlasov equations with Markovian switching.
Abstract
Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled by a continuous-time Markov chain. Different from the usual switching diffusions, the systems include mean-field interactions. Our effort is devoted to obtaining laws of large numbers for the underlying systems. One of the distinct features of the paper is the limit of the empirical measures is not deterministic but a random measure depending on the history of the Markovian switching process. A main difficulty is that the standard martingale approach cannot be used to characterize the limit because of the coupling due to the random switching process. In this paper, in contrast to the classical approach, the limit is characterized as the conditional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On Laws of Large Numbers for Systems with Mean-Field Interactions and Markovian Switching
Son L. Nguyen Department of Mathematics, University of Puerto Rico, Rio Piedras campus, San Juan, PR 00936, USA, [email protected]. This research was supported by a seed fund of Department of Mathematics at University of Puerto Rico, Rio Piedras campus.
George Yin Department of Mathematics, Wayne State University, Detroit, MI 48202, USA, [email protected]. This research was supported in part by the Army Research Office.
Tuan A. Hoang Department of Mathematics, Wayne State University, Detroit, MI 48202, USA, [email protected].
Abstract
Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled by a continuous-time Markov chain. Different from the usual switching diffusions, the systems include mean-field interactions. Our effort is devoted to obtaining laws of large numbers for the underlying systems. One of the distinct features of the paper is the limit of the empirical measures is not deterministic but a random measure depending on the history of the Markovian switching process. A main difficulty is that the standard martingale approach cannot be used to characterize the limit because of the coupling due to the random switching process. In this paper, in contrast to the classical approach, the limit is characterized as the conditional distribution (given the history of the switching process) of the solution to a stochastic McKean-Vlasov differential equation with Markovian switching.
Key Words. Mean-field model, Markovian switching process, law of large number, McKean-Vlasov equation.
Mathematics Subject Classification. 60J25, 60J27, 60J60, 93E20.
Running title. LLN for Systems with Mean-Field Interactions and Markovian Switching
1 Introduction
This work focuses on laws of large numbers for a class of stochastic systems involving mean-field interactions and random switching. It is motivated by two lines of recent advances in the study of stochastic systems and applications. One of them is the emerging interests in mean-field models, and the other is the use of regime switching in stochastic systems.
Originated from statistical physics, mean-field models describe stochastic systems containing a large number of particles having weak interactions. To overcome the complexity of interactions due to the large scale of system, all interactions with each particle are replaced by a single averaged interaction (naturally represented by an empirical measure associated to system). One of the first mathematical treatments was the influential work of Dawson [7], which rigorously justified the replacement of a large number of “bodies” by a representative “body” in many-body problems. Also obtained in that paper was phase transition properties. The subsequent work [9] delineates some limit theory for jump mean-field models. Although originally appeared in physics, mean-field models have arisen in many different application areas, including communication networks, mathematical finance, chemical and biological systems, and social sciences. For an extensive list of references to such applications, see [2, 4, 5, 30]. Recently, renewed interest has been shown using mean-field models in game theory, which is originated independently in the work of Huang, Caines, and Malhamé [16, 17], and Lasry and Lions [21]. The mean-field interaction has been used to model the weak interaction between players in large population games and the limiting results are used to construct computable decentralized strategies, leading to substantial progress in the development of mean-field game theory. The book by Bensoussan, Frehse, and Yam [4] provided an illuminating presentation and discussion of certain aspects of mean-field games and mean-field type controls, describing their similarities and differences together with a unified approach for treating them. A more analytic approach can be found in the book by Kolokoltsov [19]. It has been seen that mean-field models and mean-field games enjoy a wide range of applications and potential applications in economics, social networks, cyber physical systems, and other branches of sciences and engineering; see [4, 15, 16, 17, 26, 32, 33] and references therein.
Along another line, the so-called hybrid systems have gained increasing popularity due to their ability to handle numerous real-world applications in which discrete and continuous dynamics coexist and interact. One class of such hybrid systems is switching diffusions. Take for instance, applications in control systems and optimization. One of the most widely used control engineering models in the literature is the so-called linear quadratic Gaussian regulator problem; see [12] for a traditional model. For many new applications in networked systems, it has been found that in addition to the random noise represented by Brownian type of disturbances, there is a source of randomness owing to the presence of random environment that displays pure jump behavior and that can be modeled by a continuous-time Markov chain. As a result, one has a controlled switching diffusion instead of controlled diffusion as in the traditional setup; see [37] for some recent results on switching diffusions and applications. For a wide variety of applications, we mention the work on flexible manufacturing systems [29], approximation to invariant measures [3], controlled piecewise deterministic Markov processes [6], population dynamics [23], business cycle models in random environment [31], stochastic approximation [35] with applications to wireless communication such as spreading code optimization and adaptation in CDMA, Markowitz mean-variance portfolio selection [38], and Lotka-Volterra models in ecology [39], among others. Furthermore, there has been new effort in treating switching diffusions in conjunction with mean-field interactions [34].
Motivated by the aforementioned two aspects, the focus of the current paper lies in the intersection of the mean-field models and the switching diffusion models. We concentrate on large-scale systems with weak interactions in a random environment represented by switching diffusions in which the Markov chains delineate random environment changes not represented by the usual diffusions. Recently, some related works have been considered in [32, 33] for studying mean-field games and social optimality. In this work, we investigate functional laws of large numbers for such systems.
Why should we be so concerned about laws of large numbers and why should such an effort be necessary? Not only is the study interesting from a mathematical point of view, but also it is crucial from a practical consideration. Treating large-scale systems, a main effort is to reduce the computation complexity. Laws of large numbers provide us with an effective machinery to overcome the difficulties. As a motivational example, consider a mean-field game problem with players for a large number . Let , , be the state of player that satisfies the following equation
[TABLE]
where and are appropriate functions, , , are independent -valued Brownian motions, is a continuous-time Markov chain independent of the Brownian motions , denotes the Dirac measure centered at for each , and , , is the control of player taking values in a compact subset of another Euclidean space . Player , , wishes to minimize its own cost
[TABLE]
where is a running cost function and the expectation is taken with . To obtain low complexity strategies, consistent mean-field approximations provide a powerful approach. Consequently, each player only needs to know its own state information and the aggregate effect of the overall population, which may be pre-computed off-line. A crucial step of this approach is to approximate the instantaneous measure of the processes under consideration by a stationary measure as . In order to take such a step, one needs to demonstrate that the system indeed possesses such a limit measure. The law of large numbers of the corresponding systems provides the existence of this limit and helps to characterize it. With the motivation for finding optimal strategies for mean-field models with players and Markovian switching, this work establishes the laws of large numbers for such systems and paves a way for solving the underlying problem.
Regarding law of large numbers, it is worth mentioning that since the pioneering works of Kac [18] and McKean [25], many important results have been obtained for investigating the time evolution of stochastic systems with long range weak interactions. Many variants of such systems have also been examined. For example, in [20], limit theorems were established for a model in which there is a common space noise process that influences the dynamics of each particle. Law of large numbers in a setting where particle evolution depends on independent jumps and switching processes were studied in [1, 27] and [14], respectively. In [8], law of large numbers was studied for a model where the noises are correlated.
One of the novel features of this paper is the limit of the empirical measures is not deterministic but a random measure that depends on the history of the Markovian switching process. In addition, the stochastic McKean-Vlasov equation in the limit is driven by martingales associate with the Markov switching process. As a consequence, there is a main difficulty to characterize the limit using the martingale problem formulation as in [8, 13, 14]. To overcome this difficulty, we use a new approach. Different from the classical work, we characterize the limit as the unique solution to a stochastic McKean-Vlasov equation with Markovian switching, which is represented by the conditional distribution of the solution to a McKean-Vlasov stochastic differential equation with a Markovian switching given the history of the switching process. In contrast, for the problem treated in [14], each particle possess its own switching process and the limit is represented as the distribution of solution to a McKean-Vlasov stochastic differential equation. We note that in [20], Kurtz and Xiong treated interacting particles. In their paper, there is a common space-time Gaussian white noise. They obtained law of large numbers with the conditional distribution in the limit. In their case, the martingale problem approach cannot be used either. Nevertheless, their model contains infinitely many exchangeable particles. Thus ergodic theory can be applied to the system, whereas in our case, we no longer have infinitely many exchangeable particles thus we cannot carry out the study by directly applying the existing ergodic theory.
In networked systems, the discrete component, namely, the random switching process often has a rather large state space. The transition among the states are not of the same speed. Some of them vary rapidly, whereas the others evolve slowly. As illustrated in [29] (see also [36]), the applications demand the consideration of the so-called nearly decomposable structures. Here nearly decomposable is understood in the sense that the switching among different subspaces are still possible although they appear relatively infrequently. Consequently, the large state space is naturally divisible into a number of subspaces so that the transitions in each subspace take place at a fast pace; the transitions from one subspace to another occur slowly. Such a situation leads to the modeling using two-time scales as in [36] by introducing a small parameter into the systems. In this paper, we will also investigate this case. The goal is still to get laws of large numbers. However, in lieu of one parameter , we have two parameters and . The limit is taken to be as , , and .
The rest of the paper is arranged as follows. Section 2 presents the formulation of the problem that we wish to study. Section 3 collects a number of preliminary results of interacting particle systems with Markovian switching. Section 4 demonstrates the law of large numbers for the systems. Section 5 examines systems in which the random switching displays two-time-scale behavior. Finally, an appendix containing the proofs of some technical lemmas is placed at the end of the paper. We remark that this paper is devoted to convergence in the form of law of large numbers. The rates of convergence is an interesting topic for future research. In the literature, some of such attempts can be found in [19] using an analytic approach and [17] using martingale-type estimates. For problems under the setting of this paper, because of the conditional distributions usage, careful thoughts and considerations are needed to treat the rate of convergence issue.
2 Formulation
We consider a mean-field system of particles (with being a large number), described by the following system of stochastic differential equations
[TABLE]
for , where denotes the Dirac measure centered at with , , , , are independent -dimensional standard Brownian motions, and is a Markov chain taking values in a finite state space with a generator Q=\big{(}q_{i_{0}j_{0}}\big{)}_{i_{0},j_{0}\in\mathbb{S}} satisfying the following properties: for and for each .
Throughout this paper, we assume that the Brownian motions , , and the Markov chain are independent and defined on a common complete probability space . Note that the transition rule of the Markov chain satisfies
[TABLE]
for any pair . It is clear that depends on in accordance with (2.1), but to simplify the notation, we omit the index in in what follows.
Notation. Let denote the space of bounded and continuous functions on equipped with the usual supremum norm , the space of all functions in whose partial derivatives up to order are bounded and continuous, and the space of functions whose partial derivatives up to order are continuous with compact support. Denote by the space of all probability measures on . For and , define . We shall use the total variation metric and the bounded Lipschitz metric on given as
[TABLE]
for . It follows from [10] that is a separable and complete metric space, which is topologically equivalent to the space of all probability measures on equipped with the weak topology. Endow with a metric satisfying and if for . Define the following metric on the product space ,
[TABLE]
For a metric space , let be the Borel -field on and denote the space of all probability measures on \big{(}E,\mathcal{B}(E)\big{)} equipped with the weak convergence topology. Let denote the space of all continuous functions equipped with the supremum metric and the space of all càdlàg functions equipped with the usual Skorohod topology. Denote by the subspace of which contains all processes with finite jumps. Since is a discrete set, is a closed subset of . For a given and functions and satisfying and for each , we define and .
Let denote the usual Borel -field on . For any vector or matrix , and denote their usual norms in and , respectively, and and denote their transposes. In addition, the inner product of two vectors is denoted by . In what follows, we frequently use two particular functions defined by and , respectively. For , denote \mathcal{F}^{\alpha}_{t_{-}}=\sigma\big{\{}\alpha(s):0\leq s<t\big{\}} and
[TABLE]
For a random variable on \big{(}\Omega,\mathcal{F},\mathbb{P}\big{)}, we denote by
[TABLE]
in the sense that
[TABLE]
We make the following assumptions.
Assumption A.
- (A1)
For each , and are Lipschitz continuous in that, there is a constant such that
[TABLE]
for all and .
- (A2)
The -valued function satisfies
[TABLE]
for some constant and , and the matrix-valued function is bounded.
Note that in the above and throughout the paper, for notational simplicity, the same notion is used to denote different norms in , or , or . It should, however, be clear from the context which norm is currently used.
It will be shown in the next section that under Assumption (A), for each fixed , system (2.1) has a unique solution \big{(}x_{1}(t),x_{2}(t),\ldots,x_{N}(t)\big{)}. For , , and , define
[TABLE]
Then is a measured-valued process, taking value on the space of probability measures on . We denote by the induced probability measure of \big{(}\mu_{N}(\cdot),\alpha(\cdot)\big{)} on D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)}. It can be shown that concentrates on the set C\big{(}[0,T],\mathscr{M}_{1}\big{)}\times D_{f}\big{(}[0,T],\mathbb{S}\big{)}, a closed subspace of D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)}. Using the notation mentioned thus far, in particular, (2.3) and (2.3), we proceed to derive the following main result. The proof is provided in Section 4, and some preliminary results are given in the next section as preparation.
Theorem 2.1**.**
Assume (A1), (A2), and
[TABLE]
where with . Then \big{(}\mu_{N}(\cdot),\alpha(\cdot)\big{)} converges weakly to a process \big{(}\mu_{\alpha}(\cdot),\alpha(\cdot)\big{)}, where
[TABLE]
and , , is the unique solution of the following stochastic differential equation
[TABLE]
where is a standard Brownian motion independent of .
As mentioned in the introduction, motivated by applications in networked systems where the random switching process often has a large state space and the transition among the states are not at the same speed, we also treat mean-field systems that capture different transition rates (slow and fast) of the switching process by using two-time scale approach. A parameter will be used to depict the difference of transition speeds. It can be shown that the law of large numbers also holds true for this case under some mild conditions similar to those in Theorem 2.1. For clarity of presentation, the formulation of this case will be given in Section 5.
3 Preliminaries
In this section, we provide some preliminary results on weakly interacting systems with Markovian switching. For convenience, we first consider the general switching systems consisting of -particles in without the weak interaction assumption. These systems can be formulated as switching diffusion processes in the larger space . Weakly interacting systems of -particles is then presented in Section 3.2 as a special case.
3.1 General -Particle System with Markovian Switching
Let be -valued random variables defined on that are independent of and . Assume that for . Consider the following stochastic differential equations with Markovian switching
[TABLE]
where \underline{x}(t)=\underline{x}_{N}(t)=\big{(}x_{1}(t),x_{2}(t),\ldots,x_{N}(t)\big{)}\in\big{(}\mathbb{R}^{d}\big{)}^{N}, \underline{b}_{i}(\cdot,\cdot,\cdot):\mathbb{R}\times\big{(}\mathbb{R}^{d}\big{)}^{N}\times\mathbb{S}\to\mathbb{R}^{d}, \underline{\sigma}_{i}(\cdot,\cdot,\cdot):\mathbb{R}\times\big{(}\mathbb{R}^{d}\big{)}^{N}\times\mathbb{S}\to\mathbb{R}^{d\times d} are vector-valued functions, are -valued independent standard Brownian motions, and is a Markov chain with the state space and generator Q=\big{(}q_{i_{0},j_{0}}\big{)}_{i_{0},j_{0}\in\mathbb{S}} given as in the previous section. Assume that for , and , \underline{b}_{i}\big{(}t,\cdot,i_{0}\big{)} and \underline{\sigma}_{i}\big{(}t,\cdot,i_{0}\big{)} satisfy the following Lipschitz and linear growth conditions
[TABLE]
[TABLE]
for any , where is a positive constant. It follows from Theorem 3.3.13 [24] that under (3.2) and (3.3), the system (3.1) has a unique solution.
By virtue of [24, 37], for a function such that for each , V(\cdot,\cdot,i_{0})\in C^{1,2}\big{(}[0,T]\times(\mathbb{R}^{d})^{N}\big{)}, the generator of the general system of particles is defined by
[TABLE]
for \big{(}t,\underline{x},i_{0}\big{)}\in[0,T]\times(\mathbb{R}^{d})^{N}\times\mathbb{S}, where denotes the gradient with respect to , and \underline{a}_{i}\big{(}t,\underline{x},i_{0}\big{)}=\underline{\sigma}_{i}\big{(}t,\underline{x},i_{0}\big{)}\underline{\sigma}^{\prime}_{i}\big{(}t,\underline{x},i_{0}\big{)}\in\mathbb{R}^{d\times d} for each .
Associated with each pair , , the states of the Markov chain , define
[TABLE]
where denotes the usual zero-one indicator function. It follows from Lemma IV.21.12 [28] that the process , , defined by
[TABLE]
is a purely discontinuous and square integrable martingale with respect to , which is null at the origin. The processes and are respectively its optional and predictable quadratic variations. For convenience, we define M_{i_{0}i_{0}}(t)=\big{[}M_{i_{0}i_{0}}\big{]}(t)=\big{\langle}M_{i_{0}i_{0}}\big{\rangle}(t)=0 for each . From the definition of optional quadratic covariations (see Section 1.8 in [22]) we have the following orthogonality relation :
[TABLE]
For any function such that V(\cdot,\cdot,i_{0})\in C^{1,2}\big{(}[0,T]\times(\mathbb{R}^{d})^{N}\big{)} for each , we have the following Itô formula
[TABLE]
It can be seen that we have two martingales. One of them is due to the Brownian motion, whereas the other is resulted from the jump process.
3.2 -Particle Mean-Field Model with Markovian Switching
For \underline{x}=\big{(}x_{1},x_{2},\ldots,x_{N}\big{)}\in(\mathbb{R}^{d})^{N}, denote the associated empirical probability measure on by . Consider the system of particles \underline{x}(t)=\big{(}x_{1}(t),x_{2}(t),\ldots,x_{N}(t)\big{)} described by the mean-field model with Markovian switching
[TABLE]
where
[TABLE]
It is clear that this is a special case of the -particle system given by (3.1) with
[TABLE]
for \big{(}t,\underline{x},i_{0}\big{)}\in[0,T]\times(\mathbb{R}^{d})^{N}\times\mathbb{S}.
Note that implies \big{\langle}\delta_{\underline{x}},\varphi\big{\rangle}={1\over N}\sum_{i=1}^{N}|x_{i}|\leq{1\over\sqrt{N}}|\underline{x}| for any and that
[TABLE]
Under Assumption (A), for and , one can easily prove that the functions and , , defined above satisfy the Lipschitz and linear growth conditions (3.2) and (3.3). This implies that system (2.1) has a unique solution. The following lemma reveals the moment boundedness of the system. In order to keep the continuity of the presentation, its proof is relegated to the Appendix.
Lemma 3.1**.**
Assume (A1), (A2), and that \sup_{N\geq 1}\mathbb{E}\big{\langle}\mu_{N}(0),\psi\big{\rangle}<\infty where for . Then for positive numbers and , , there is a constant independent of such that
[TABLE]
and for ,
[TABLE]
For f(\cdot,i_{0})\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)}, , and \big{(}x,\mu,i_{0}\big{)}\in\mathbb{R}^{d}\times\mathscr{M}_{1}\times\mathbb{S} denote the operator
[TABLE]
where
[TABLE]
Let be a function such that
[TABLE]
for some functions f(\cdot,\cdot,i_{0})\in C^{1,2}\big{(}[0,T]\times\mathbb{R}^{d}\big{)}, . For and defined as in (3.9), and and defined as in (3.4) and (3.12), respectively, we have
[TABLE]
For each element \varsigma\in D_{f}\big{(}[0,T],\mathbb{S}\big{)} that represents a sample path of the switching process , , we denote the corresponding sample path of the associated martingale by a similar way to (3.5) and (3.6) as follow
[TABLE]
where
[TABLE]
Since the sample paths of are in D_{f}\big{(}[0,T],\mathbb{S}\big{)}, for simplicity, we define M_{i_{0}j_{0}}^{\varsigma}(t)=\big{[}M_{i_{0}j_{0}}^{\varsigma}\big{]}(t)=\big{\langle}M_{i_{0}j_{0}}^{\varsigma}\big{\rangle}(t)=0 for \varsigma\in D\big{(}[0,T],\mathbb{S}\big{)}\backslash D_{f}\big{(}[0,T],\mathbb{S}\big{)} and .
For \big{(}\underline{x}(\cdot),\alpha(\cdot)\big{)}\in D\big{(}[0,T],(\mathbb{R}^{d})^{N}\times\mathbb{S}\big{)}, we define the mapping by
[TABLE]
Denote by the induced probability measure of the system \big{(}x_{1}(\cdot),x_{2}(\cdot),\ldots,x_{N}(\cdot),\alpha(\cdot)\big{)}, the solution to (2.1), on D\big{(}[0,T],(\mathbb{R}^{d})^{N}\times\mathbb{S}\big{)}. It follows that
[TABLE]
We have the following lemma.
Lemma 3.2**.**
Under the assumption of Lemma 3.1, the following statements hold:
- (i)
For f(\cdot,\cdot,i_{0})\in C^{1,2}\big{(}[0,T]\times\mathbb{R}^{d}\big{)}, , and \big{(}\eta,\varsigma\big{)}\in D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)} denote
[TABLE]
*Then is a continuous *martingale.
- (ii)
*For f(\cdot,\cdot,i_{0}),g(\cdot,\cdot,i_{0})\in C^{1,2}\big{(}[0,T]\times\mathbb{R}^{d}\big{)}, , the quadratic variational process of the *martingales and has the form
[TABLE]
for , where denotes the gradient with respect to the space variables and is the inner product in .
Proof. Let satisfy
[TABLE]
for functions f(\cdot,\cdot,i_{0}),g(\cdot,\cdot,i_{0})\in C^{1,2}\big{(}[0,T]\times\mathbb{R}^{d}\big{)}, . We put
[TABLE]
and define with replaced by and . In view of the Itô formula (3.8),
[TABLE]
is a continuous -martingle. Since the Brownian motions are independent, from (3.16), we obtain
[TABLE]
One can easily verify the following identities
[TABLE]
Since , a combination of the above facts implies the assertions (i) and (ii).
4 Law of Large Numbers for Mean-Field Models with Markovian Switching
In this section, we present the proof of Theorem 2.1, one of the main result of the paper, establishing the law of large numbers for the mean-field systems with Markovian switching. We use the martingale approach. The weak compactness of the sequence is established in Section 4.1. Its limit is characterized in Section 4.2.
4.1 Weak Compactness of \big{\{}\big{(}\mu_{N}(\cdot),\alpha(\cdot)\big{)}\big{\}}_{N\geq 1}
Lemma 4.1**.**
Under the assumptions of Theorem 2.1, for each there exists a compact set in \big{(}\mathscr{M}_{1},\|\cdot\|_{BL}\big{)} such that
[TABLE]
where K^{\delta}_{\delta}=\big{\{}\mu\in\mathscr{M}_{1}:\inf_{\eta\in K_{\delta}}\|\mu-\eta\|_{BL}<\delta\big{\}}.
Proof. For each , denote B_{\lambda}^{c}=\big{\{}x\in\mathbb{R}^{d}:|x|>\lambda\big{\}} and H_{\lambda}=\big{\{}\mu\in\mathscr{M}_{1}:\mu(B^{c}_{\lambda})=0\big{\}}. Because \big{(}\mathscr{M}_{1},\|\cdot\|_{BL}\big{)} is topologically equivalent to (see Theorem 12 [10]), by Prohorov theorem, is relatively compact in \big{(}\mathscr{M}_{1},\|\cdot\|_{BL}\big{)}. For ,
[TABLE]
Let be the constant given in (3.11). It follows from (4.1) and (3.11) that
[TABLE]
For a fixed , we can choose large enough such that . Take which is compact in \big{(}\mathscr{M}_{1},\|\cdot\|_{BL}\big{)}. For all we have
[TABLE]
This completes the proof.
Lemma 4.2**.**
Under the assumptions of Theorem 2.1, for each positive integer and , there exists a random variable such that
[TABLE]
for all . Furthermore,
[TABLE]
Proof. By the definition of the norm and Cauchy-Schwarz inequality,
[TABLE]
for any integer , and real numbers satisfying . Therefore, by the Dynkin formula,
[TABLE]
It follows from the right-hand side and then the left-hand side of (3.11) that for ,
[TABLE]
Thus, (4.2) implies that
[TABLE]
As a consequence, by Cauchy-Schwarz inequality,
[TABLE]
This inequality and Lemma 3.1 conclude the proof by taking
[TABLE]
The proof is complete.
According to Lemmas 4.1 and 4.2 we obtain the following Proposition.
Proposition 4.3**.**
The sequence \big{\{}\big{(}\mu_{N}(\cdot),\alpha(\cdot)\big{)},N\geq 1\big{\}} is weakly compact in the topology of weak convergence of probability measure on D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)}.
Proof. Let be a compact subset of \big{(}\mathscr{M}_{1},\|\cdot\|_{BL}\big{)} as in Lemma 4.1 and denote . By the compactness of the space , is also a compact set in \big{(}\mathscr{M}_{1}\times\mathbb{S},d\big{)} and . In view of Lemma 4.1, we have
[TABLE]
Since is a Markov chain, there is a constant such that \mathbb{E}\big{(}d_{\mathbb{S}}(\alpha(t+\delta),\alpha(t))\big{|}\mathcal{F}^{\alpha}_{t}\big{)}\leq C\delta for and . Therefore, it follows from the definition of metric and Lemma 4.2 that for each integer and positive number there exists a random variable such that
[TABLE]
where defined in Lemma 4.2 satisfies
[TABLE]
Combining (4.4), (4.5), and (4.6), the Proposition follows by virtue of [11, Theorem 3.8.6].
4.2 Characterization of Limit
Next, we proceed to characterize \big{(}\mu_{\alpha}(\cdot),\alpha(\cdot)\big{)}, the limit of the sequence \big{\{}(\mu_{N}(\cdot),\alpha(\cdot))\big{\}}_{N\geq 1}. We have the following lemma.
Theorem 4.4**.**
Assume (A1), (A2), and that \sup_{N\geq 1}\mathbb{E}\big{\langle}\mu_{N}(0),\psi\big{\rangle}<\infty. Denote by the limit of an arbitrary weakly convergent subsequence of . Then for -almost all \big{(}\eta(\cdot),\varsigma(\cdot)\big{)}\in D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)},
[TABLE]
holds for all test functions f(\cdot,i_{0})\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)}, , and .
Proof. Let be a subsequence of that converges weakly to a probability measure on D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)} as . It suffices to prove that (4.7) holds almost surely for each test function f(\cdot,i_{0})\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)}, . Note from Lemma 3.2 that for each ,
[TABLE]
is a continuous square integrable -martingale with quadratic variational process
[TABLE]
By virtue of Assumption (A2) and Lemma 3.1, there exists a constant independent of such that
[TABLE]
Note that for any , and , concentrates on the set denoted by
[TABLE]
with probability , i.e., \mathscr{P}_{N}\big{(}\mathscr{S}\big{)}=1 for any . For , denote
[TABLE]
It is clear that for every and . Since is a discrete set and , the set \big{\{}(\eta,\varsigma)\in\mathscr{S}_{n}:|M_{f}(t)|\leq\delta\big{\}} is closed in for each . Thus, by Portmanteau Theorem, we have
[TABLE]
By Doob’s submartingale inequality and (4.9),
[TABLE]
Combining (4.10) and (4.11) yields \mathscr{P}\big{(}|M_{f}(t)|=0\big{)}=1, which implies -a.s. The theorem therefore follows from (4.8).
To proceed, we need a result from [27]. Assume the following conditions hold.
- (B1)
and are Lipschitz continuous in that, there is a constant such that
[TABLE]
for all and .
- (B2)
The -valued function satisfies
[TABLE]
for some constant and the -valued function is bounded.
For and denote
[TABLE]
As a consequence of Lemma 9 and equation (8.2) in [27], we have the following theorem.
Theorem 4.5**.**
Assume (B1) and (B2). Then the equation
[TABLE]
has a unique solution in D\big{(}[0,T],\mathscr{M}_{1}\big{)} that is the distribution of the unique solution of
[TABLE]
and is a standard Brownian motion.
We are now in a position to present a result on stochastic McKean-Vlasov equations with Markovian switching.
Theorem 4.6**.**
Assume (A1) and (A2). Then the system of integral equations
[TABLE]
where and for each , has a unique solution in D\big{(}[0,T],\mathscr{M}_{1}\big{)}. Moreover, this solution equals \mathscr{L}\big{(}y(t)\big{|}\mathcal{F}^{\alpha}_{t_{-}}\big{)} for all , where is the unique solution of
[TABLE]
where is a standard Brownian motion independent of .
Since the proof of this theorem is rather long, we give a brief explanation of the main idea. First observe that (4.12) is a special case of (4.13) for the mean-field models with the usual diffusion (i.e., without switching process). To proceed with the case involving Markovian switching, we use Theorem 4.5 to deal with equation (4.13) in the time intervals between the jumps of the Markov chain . We then consider (4.13) at any jump time point by “gluing” the solutions between jump times of the Markov chain and show that the solution obtained in this way indeed satisfies all the requirements.
Proof of Theorem 4.6. The proof is divided into several steps.
Step 1: Show that for each and \varsigma(\cdot)\in D_{f}\big{(}[0,r],\mathbb{S}\big{)}, there exists a unique solution \eta(\cdot)\in D\big{(}[0,r],\mathscr{M}_{1}\big{)} to the equation
[TABLE]
where and for each .
Denote , and for . For each , and , denote , , and . In addition, for , denote
[TABLE]
Then
[TABLE]
Next, we show that on each interval , , a solution to (4.14) satisfies equation (4.12) in Theorem 4.5 with the operator . That is, for ,
[TABLE]
First, we consider the case . For we have M^{\varsigma}_{i_{0}j_{0}}(t)=-\big{\langle}M^{\varsigma}_{\iota_{0}j_{0}}\big{\rangle}(t)=-q_{\iota_{0}j_{0}}t if , and if . Thus it follows from (4.14) and (4.15) that for any and ,
[TABLE]
By taking in (4.14) and noting that \big{\langle}M^{\varsigma}_{\iota_{0}j_{0}}\big{\rangle}(t_{1})=q_{\iota_{0}j_{0}}t_{1} for and \big{[}M^{\varsigma}_{\iota_{0}\iota_{1}}\big{]}(t_{1})=1, we obtain
[TABLE]
which implies that (4.17) also holds for . In view of Theorem 4.5, for any , , which is the unique solution to the following stochastic differential equation
[TABLE]
Likewise, we can show that satisfies (4.16) for any . Hence, according to Theorem 4.5 again, which is the unique solution to the following equation
[TABLE]
As a consequence, for , is the unique solution to the equation
[TABLE]
It is clear that \eta(\cdot)\in C\big{(}[0,r],\mathscr{M}_{1}\big{)}. This completes the Step 1.
Since for each , depends on the history of the switching process for , it is more convenient to consider equation (4.14) for . Similar to Step 1, that we can define a mapping \Lambda_{r}:D_{f}\big{(}[0,r),\mathbb{S}\big{)}\to D\big{(}[0,r),\mathscr{M}_{1}\big{)} that maps each \varsigma(\cdot)\in D_{f}\big{(}[0,r),\mathbb{S}\big{)} to the unique solution \eta(\cdot)\in D\big{(}[0,r),\mathscr{M}_{1}\big{)} to equation (4.14) for . It also follows from Step 1, (4.17), and (4.18) that the unique solution \eta(\cdot)\in D\big{(}[0,r],\mathscr{M}_{1}\big{)} to equation (4.14) for satisfies
[TABLE]
for any value of .
For each , denote the truncation mappings \Pi_{r_{2},r_{1}}^{\mathbb{S}}:D\big{(}[0,r_{2}),\mathbb{S}\big{)}\to D\big{(}[0,r_{1}),\mathbb{S}\big{)} and \Pi_{r_{2},r_{1}}^{\mathscr{M}_{1}}:D\big{(}[0,r_{2}),\mathscr{M}_{1}\big{)}\to D\big{(}[0,r_{1}),\mathscr{M}_{1}\big{)} by
[TABLE]
for all \varsigma\in D\big{(}[0,r_{2}),\mathbb{S}\big{)}, \eta\in D\big{(}[0,r_{2}),\mathscr{M}_{1}\big{)} and . Then we have the following lemma that shows the continuity and consistency of the mapping . To keep the continuity of the flow of presentation, we relegate the proof to the Appendix.
Lemma 4.7**.**
The following assertions hold.
- (i)
The mapping \Lambda_{r}:D_{f}\big{(}[0,r),\mathbb{S}\big{)}\to C\big{(}[0,r),\mathscr{M}_{1}\big{)} is continuous for any .
- (ii)
For any and \varsigma\in D_{f}\big{(}[0,r_{2}),\mathbb{S}\big{)}, the following consistent identity holds
[TABLE]
Next, for , we define \alpha_{r_{-}}:\Omega\to D_{f}\big{(}[0,r),\mathbb{S}\big{)} by for and . Let be the solution to the following equation
[TABLE]
with such that . It follows from Lemma 4.7 that for . Hence, we can define for and obtain
[TABLE]
Step 2: Prove that \Lambda_{r}(\alpha_{r_{-}})(r_{-})=\mathscr{L}\big{(}y(r)\big{|}\mathcal{F}^{\alpha}_{r_{-}}\big{)} for each .
First, we show \Lambda_{r}(\alpha_{r_{-}})(r_{-})=\mathscr{L}\big{(}y(r_{-})\big{|}\mathcal{F}^{\alpha}_{r_{-}}\big{)} for each . Note that according to Step 1, on the set \alpha_{r_{-}}=\varsigma\in D_{f}\big{(}[0,r),\mathbb{S}\big{)} we have \Lambda_{r}(\alpha_{r_{-}})(s)=\mathscr{L}\big{(}y(s)\big{)} for any . Therefore, \Lambda_{r}(\alpha_{r_{-}})(r_{-})=\mathscr{L}\big{(}y(r_{-})\big{)}. As a consequence, for any f\in C_{b}\big{(}\mathbb{R}^{d}\big{)},
[TABLE]
Next, let and be the Borel fields on D\big{(}[0,r),\mathbb{S}\big{)} and D\big{(}[0,r),\mathscr{M}_{1}\big{)}, respectively. For each denote the mappings \pi_{r,s}^{\mathbb{S}}:D\big{(}[0,r),\mathbb{S}\big{)}\to\mathbb{S} and \pi_{r,s}^{\mathscr{M}_{1}}:D\big{(}[0,r),\mathscr{M}_{1}\big{)}\to\mathscr{M}_{1} by
[TABLE]
Then we have
[TABLE]
Hence,
[TABLE]
Since \Lambda_{r}:D_{f}\big{(}[0,r),\mathbb{S}\big{)}\to C\big{(}[0,r),\mathscr{M}_{1}\big{)} is continuous, is \sigma\big{\{}\alpha_{r_{-}}\big{\}}-measurable. In addition, \big{(}\mathscr{M}_{1},\|\cdot\|_{BL}\big{)} is equivalent to the space equipped with the weak topology. Therefore, it follows from (4.22) and (4.23) that
[TABLE]
This implies \Lambda_{r}(\alpha_{r_{-}})(r_{-})=\mathscr{L}\big{(}y(r_{-})\big{|}\mathcal{F}^{\alpha}_{r_{-}}\big{)}. By part (ii) of Lemma 4.7, for any . Thus, by Lemma 4.7(i), for each , we obtain
[TABLE]
Taking in (4.21) we have obtain
[TABLE]
Similar to Lemma 4.7(i), we can show that solution of (4.24) is continuous. This gives \mathscr{L}\big{(}y(s)\big{|}\mathcal{F}^{\alpha}_{s_{-}}\big{)}=\mathscr{L}\big{(}y(s_{-})\big{|}\mathcal{F}^{\alpha}_{s_{-}}\big{)} and satisfies
[TABLE]
The assertion of Step 2 is therefore complete.
It follows from Step 1 and Step 2 (with is replaced by sample path ) that the solution to (4.13) satisfies
[TABLE]
In view of (4.19) and Step 2,
[TABLE]
These imply \mu(s)=\mathscr{L}\big{(}y(s)\big{|}\mathcal{F}^{\alpha}_{s_{-}}\big{)} for all .
Step 3: Prove the uniqueness of the solution of (4.25).
Suppose that are two solutions to equation (4.25) with same initial value . Denote \mu_{i}(s)=\mathscr{L}\big{(}y_{i}(s)\big{|}\mathcal{F}^{\alpha}_{s_{-}}\big{)} for , . Then
[TABLE]
Similar to (A.14), we have
[TABLE]
Thus, by Cauchy-Schwarz and Bulkhoder-Davis-Gundy inequalities, we have
[TABLE]
In view of the Gronwall inequality, \mathbb{E}\big{|}y_{1}(t)-y_{2}(t)\big{|}^{2}=0 for . This implies that a.s.
Proof of Theorem 2.1. Since is the distribution of \big{(}\mu_{N}(\cdot),\alpha(\cdot)\big{)}, \mathscr{P}\big{(}\mathcal{C}\big{)}=\mathbb{P}\big{(}\alpha_{T}\in\mathcal{C}\big{)} for any measurable set \mathcal{C}\subset D\big{(}[0,T],\mathbb{S}\big{)} where \alpha_{T}:\Omega\to D_{f}\big{(}[0,T],\mathbb{S}\big{)} is defined by for and . The convergence \mathscr{L}\big{(}\mu_{N}(0)\big{)}\Rightarrow\delta_{\mu_{0}} in \mathcal{P}\big{(}\mathscr{M}_{1},\|\cdot\|_{BL}\big{)} implies that \mathscr{P}\big{(}\eta(0)=\mu_{0}\big{)}=1.
Let \bar{\Lambda}_{T}:D_{f}\big{(}[0,T],\mathbb{S}\big{)}\to D\big{(}[0,T],\mathscr{M}_{1}\big{)} be the mapping that maps each \varsigma(\cdot)\in D_{f}\big{(}[0,T],\mathbb{S}\big{)} to the unique solution \eta(\cdot)\in D\big{(}[0,T],\mathscr{M}_{1}\big{)} to equation (4.14) (or equivalently, (4.7)) for . Similar to Lemma 4.7 we can show that \bar{\Lambda}_{T}:D_{f}\big{(}[0,T],\mathbb{S}\big{)}\to C\big{(}[0,T],\mathscr{M}_{1}\big{)} is continuous.
Denote \Gamma:D_{f}\big{(}[0,T],\mathbb{S}\big{)}\to D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)} by \Gamma\varsigma=\big{(}\bar{\Lambda}_{T}\varsigma,\varsigma\big{)} and let be the set of all pairs (\eta,\varsigma)\in C\big{(}[0,T],\mathscr{M}_{1}\big{)}\times D_{f}\big{(}[0,T],\mathbb{S}\big{)} satisfying equation (4.7). Since C\big{(}[0,T],\mathscr{M}_{1}\big{)}\times D_{f}\big{(}[0,T],\mathbb{S}\big{)} is a closed subset of D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)},
[TABLE]
Thus, \mathscr{P}\big{(}C\big{(}[0,T],\mathscr{M}_{1}\big{)}\times D_{f}\big{(}[0,T],\mathbb{S}\big{)}\big{)}=1. This together with Theorem 4.4 implies that . According to Step 1 in the proof of Theorem 4.6, \mathcal{S}=\big{\{}\Gamma\varsigma:\varsigma\in D_{f}\big{(}[0,T],\mathbb{S}\big{)}\big{\}}. Therefore, for each measurable set \mathcal{A}\subset D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)} we have
[TABLE]
Since \bar{\Lambda}_{T}\alpha_{T}(s)=\mathscr{L}\big{(}y(s)\big{|}\mathcal{F}^{\alpha}_{s_{-}}\big{)}, where is the unique solution to (4.25), the above identities imply that is the distribution of the process \big{(}\mathscr{L}\big{(}y(s)\big{|}\mathcal{F}^{\alpha}_{s_{-}}\big{)},\alpha(s)\big{)} on D\big{(}[0,T],\mathscr{M}_{1}\times\mathbb{S}\big{)}. This completes the proof.
5 -Particle Mean-Field Models with
Two-Time-Scale Markovian Switching Process
As alluded to in the introduction, this section is devoted to the case that the number of particles , meanwhile, the Markov chain displays weak and strong interactions reflected by use of a small parameter . We require that as and .
5.1 Formulation
We consider a class of mean-field processes, in which the random switching process changes much faster than the continuous state (or the switching process jump change much more frequently). The basic idea is that there are inherent two-time scales. Our interest focuses on the limit behavior of the resulting process. Suppose that is a small parameter and the system of mean-field equations is given by
[TABLE]
where , , , are independent -dimensional standard Brownian motions, and is a Markov chain with state space \mathbb{S}=\big{\{}1,\ldots,m_{0}\big{\}} satisfying
[TABLE]
as , where the generator
[TABLE]
satisfies for and for each .
The model above is motivated by the work of two-time-scale Markov chains [36]. Such two-time scale Markov chains have been used widely, especially in networked systems; see for example, the manufacturing systems given in [29]. It is readily seen that the Markov chain has a fast varying part and a slowly changing part. Suppose
[TABLE]
Then the state space of the underlying Markov chain is decomposable into subspaces. These subspaces are not completely separated. There are weak interactions among the subspaces due to the use of the slowly varying part of the generator . Such a structure is often referred to as nearly decomposable Markov chain.
We relabel the states so that
[TABLE]
with \mathbb{S}_{i}=\big{\{}s_{i1},s_{i2},\ldots,s_{im_{i}}\big{\}} and such that , the generator associated with the subspace for each . Assume that each is irreducible. As a consequence, the corresponding for consist of recurrent states belonging to ergodic classes. Let \nu^{i}=\big{(}\nu_{s_{i1}},\nu_{s_{i2}},\ldots,\nu_{s_{im_{i}}}\big{)} be the stationary distribution corresponding to , , and \tilde{\nu}=\text{diag}\big{[}\nu^{1},\nu^{2},\ldots,\nu^{l}\big{]}\in\mathbb{R}^{l\times m_{0}}. Following the ideas in [36], we aim to reduce the computational complexity. The rationale is that we take advantage of the fast and slow motions and strong and weak interactions of the systems so that we can naturally divide the state space of the switching process into subsystems or groups. Within each subsystem, the states look alike in that they vary at the same speed, and among different subsystems, the variations are relatively slowly. To proceed, we lump the states of the jump component in each into a single state and define
[TABLE]
Denote the state space of by \bar{\mathbb{S}}=\big{\{}1,2,\ldots,l\big{\}}. It follows from [36, Theorem 5.27] that converges weakly to , a Markov chain with the state space and generator defined by
[TABLE]
where 1\!\!1=\text{diag}\big{[}{1\!\!1}_{m_{1}},{1\!\!1}_{m_{2}},\ldots,{1\!\!1}_{m_{l}}\big{]}\in\mathbb{R}^{m_{0}\times l} and {1\!\!1}_{k}=\big{(}1,1,\ldots,1\big{)}^{\prime}\in{\mathbb{R}}^{k}.
For , denote a\big{(}x,\mu,s_{ij}\big{)}=\sigma\big{(}x,\mu,s_{ij}\big{)}\sigma^{\prime}\big{(}x,\mu,s_{ij}\big{)} and
[TABLE]
For simplicity, we assume that the initial values , , are independent of and that are independent of . We make the following assumption.
- (A3)
The matrix-valued function on has a representation where is bounded and there is a constant such that
[TABLE]
for all , and .
For , , , and denote
[TABLE]
Then , , defines a process on the space of probability measures on . Because of the assumption on the initial values of , does not depend on . Let and , respectively, be the metrics on and defined by similar way to and in (2.2). Denote by the induced probability measure of \big{(}\mu_{N}^{\varepsilon}(\cdot),\bar{\alpha}^{\varepsilon}(\cdot)\big{)} on D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)}. We can show that \big{(}\mu_{N}^{\varepsilon}(\cdot),\bar{\alpha}^{\varepsilon}(\cdot)\big{)}\in C([0,T],\mathscr{M}_{1})\times D_{f}([0,T],\bar{\mathbb{S}}), a closed subspace of D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)}.
Theorem 5.1**.**
Assume (A1), (A2), (A3), and
[TABLE]
Then \big{(}\mu_{N}^{\varepsilon}(\cdot),\bar{\alpha}^{\varepsilon}(\cdot)\big{)} converges weakly to process \big{(}\bar{\mu}_{\bar{\alpha}}(\cdot),\bar{\alpha}(\cdot)\big{)} as and satisfying , where
[TABLE]
and , , is the unique solution of the following stochastic differential equation
[TABLE]
where is a standard Brownian motion independent of .
5.2 Weak Compactness and Auxiliary Estimates
For , and denote
[TABLE]
Remark 5.2**.**
It follows from the proof of Lemma 3.1 that for each , , there exists a constant independent of and such that
[TABLE]
and, for ,
[TABLE]
Proposition 5.3**.**
Assume that all the assumptions of Theorem 5.1 hold. Then the sequence is weakly compact in the topology of weak convergence of probability measure on .
Proof. According to inequalities (5.6)-(5.7) and the arguments in Lemma 4.1 and Lemma 4.2, for any there exists a compact set in such that
[TABLE]
and there exists a constant independent of and such that
[TABLE]
Since converges weakly to (see Theorem 7.4 [36]) we obtain the compactness of .
For each function with for , denote the operator associated to (5.1) by
[TABLE]
where
[TABLE]
To approximate this operator for small values of we define for each function such that for ,
[TABLE]
where \bar{Q}g(x)(i)=\sum_{j\in\bar{\mathbb{S}}}\bar{q}_{ij}\big{(}g(x,j)-g(x,i)\big{)}.
Note that for , we can define \mathcal{L}^{\varepsilon}(\mu)f\big{(}x,s_{ij}\big{)} as in (5.8) by taking for and . Similarly, for each , we can define \bar{\mathcal{L}}(\mu)f\big{(}x,i\big{)}=\bar{\mathcal{L}}(\mu)g\big{(}x,i\big{)} where for any and . We have the following approximation. To make the presentation more transparent, its proof is given in the Appendix.
Lemma 5.4**.**
Under Assumption A, for any there is a constant independent of and such that
[TABLE]
5.3 Weak Convergence and Stochastic McKean-Vlasov Equation with Two-Time-Scale Markovian Switching
Similar to (3.6), we define the martingale associated with the limiting Markovian switching process by
[TABLE]
where \big{[}\bar{M}_{ij}\big{]}(t)=\sum_{0\leq s\leq t}{1\!\!1}\big{(}\bar{\alpha}(s_{-})=i\big{)}{1\!\!1}\big{(}\bar{\alpha}(s)=j\big{)} and \big{\langle}\bar{M}_{ij}\big{\rangle}(t)=\int_{0}^{t}\bar{q}_{i_{0}j_{0}}{1\!\!1}\big{(}\bar{\alpha}(s_{-})=i_{0}\big{)}ds. In addition, by a similar way to (3.14), we define sample path of the martingale associated with a sample path \bar{\varsigma}\in D_{f}\big{(}[0,T],\bar{\mathbb{S}}\big{)} of by
[TABLE]
where \big{[}\bar{M}_{ij}^{\bar{\varsigma}}\big{]}(t)=\sum_{0\leq s\leq t}{1\!\!1}\big{(}\bar{\varsigma}(s_{-})=i\big{)}{1\!\!1}\big{(}\bar{\varsigma}(s)=j\big{)} and \big{\langle}\bar{M}_{ij}^{\bar{\varsigma}}\big{\rangle}(t)=\int_{0}^{t}\bar{q}_{ij}{1\!\!1}\big{(}\bar{\varsigma}(s_{-})=i\big{)}ds. In addition, for \bar{\varsigma}\in D\big{(}[0,T],\bar{\mathbb{S}}\big{)}\backslash D_{f}\big{(}[0,T],\bar{\mathbb{S}}\big{)} and define \bar{M}_{ij}^{\bar{\varsigma}}(t)=\big{[}\bar{M}_{ij}^{\bar{\varsigma}}\big{]}(t)=\big{\langle}\bar{M}_{ij}^{\bar{\varsigma}}\big{\rangle}(t)=0.
Proposition 5.5**.**
Assume (A1), (A2), and . Denote by the limit of an arbitrary weakly convergence subsequence as where satisfies as . Then for -almost all (\eta,\bar{\varsigma})\in D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)}, the equation
[TABLE]
holds for any test function , .
Proof. Let be the weak limit on D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)} of a subsequence of as where is satisfies as .
First, we prove that for almost all (\eta,\bar{\varsigma})\in D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)}, (5.13) holds for with . For each denote
[TABLE]
which defines a function on D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)}. We observe that for a fixed pair (\eta,\bar{\varsigma})\in D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)}, if (5.13) holds for any test function such that , , it also holds for any test function such that , . Thus, in order to prove (5.13) holds almost surely for any , it suffices to show that
[TABLE]
Take . Since the set \big{\{}(\eta,\bar{\varsigma}):|\bar{M}_{f}(t)|\leq\delta\big{\}} is closed in D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)} we have
[TABLE]
Note that since is the distribution of \big{(}\mu^{\varepsilon_{k}}_{N_{k}}(\cdot),\bar{\alpha}^{\varepsilon_{k}}(\cdot)\big{)},
[TABLE]
By Lemma 5.4, we obtain
[TABLE]
Next, denote
[TABLE]
By the Itô formula, we observe that is a continuous square integrable martingale with quadratic variation process
[TABLE]
Similar to (4.9), since is bounded we have \sup_{0\leq t\leq T}\mathbb{E}\big{[}M^{\varepsilon_{k}}_{N_{k},f}\big{]}(t)\leq{CT\over N_{k}}. Thus, by Doob’s inequality,
[TABLE]
Combining (5.16)-(5.18) yields
[TABLE]
Since is taken arbitrarily, the above equation and (5.15) imply (5.14).
Next, we prove that if for some pair , (5.13) holds for any f\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)}, it also holds for any such that g(\cdot,i)\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)} for each . For f\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)} and denote
[TABLE]
Then, for any f\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)} and g(\cdot,i)\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)}, ,
[TABLE]
Let be a pair in D\big{(}[0,T],\mathscr{M}_{1}\times\bar{\mathbb{S}}\big{)} such that (5.13) holds for any f\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)}. By the definition of , we can rewrite (5.13) as follow
[TABLE]
for any and f\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)}.
Denote the jump times of by , t_{n+1}=\inf\big{\{}t>t_{n}:\bar{\varsigma}(t)\neq\bar{\varsigma}(t_{-})\big{\}} and for . For we have
[TABLE]
This implies
[TABLE]
In view of (5.20) with , (5.19) and (5.22), we have
[TABLE]
At , (5.21) still holds if . In addition,
[TABLE]
Thus,
[TABLE]
As a consequence, by applying (5.20) with and we have
[TABLE]
This implies that (5.23) also holds for and therefore (5.23) is proved for any such that g(\cdot,i)\in C^{2}_{c}\big{(}\mathbb{R}^{d}\big{)} for each as desired.
As a direct consequence of Theorem 4.6 we have the following proposition, which characterizes the limit as a solution to a stochastic McKean-Vlasov equation with Markovian switching.
Proposition 5.6**.**
Assume (A1), (A2), and (A3). Let be a measure in . Then the system of integral equations
[TABLE]
where for each , has a unique solution in D\big{(}[0,T],\mathscr{M}_{1}\big{)}. Moreover, this solution equals \mathscr{L}\big{(}\bar{x}(t)\big{|}\mathcal{F}^{\bar{\alpha}}_{t_{-}}\big{)} for all , where is the unique solution of
[TABLE]
where is a standard Brownian motion independent of .
Proof of Theorem 5.1. Since converges weakly to , for any \mathcal{C}\subset D\big{(}[0,T],\bar{\mathbb{S}}\big{)} we have \bar{\mathscr{P}}\big{(}\mathcal{C}\big{)}=\mathbb{P}\big{(}\bar{\alpha}_{T}\in\mathcal{C}\big{)}. By using \bar{\mathcal{L}},\big{(}\bar{\alpha}(\cdot),\bar{\mathbb{S}}\big{)}, respectively, instead of \mathcal{L},\big{(}\alpha(\cdot),{\mathbb{S}}\big{)}, Proposition 5.5 instead of Theorem 4.4, and Proposition 5.6 instead of Theorem 4.6, a similar argument to that in the proof of Theorem 2.1 yields the assertion of Theorem 5.1.
Appendix A Appendix
A.1 Proof of Lemma 3.1
Define
[TABLE]
The sequence is monotonically increasing. Put .
We are in a position to prove that a.s. Suppose that there exists a positive numbers and such that P\big{(}\lim_{k\to\infty}\tau_{k}<T_{0}\big{)}>2\varepsilon. Then there is a number such that P\big{(}\tau_{k}<T_{0}\big{)}>\varepsilon for all . Recall that for , . For , define the Lyapunov function
[TABLE]
It is easily seen that
[TABLE]
[TABLE]
where denotes the Hessian matrix with respect to the variable of V. Since are independent Brownian motions, a direct calculation yields
[TABLE]
It follows from Assumption A and equations (A.1)-(A.3) that
[TABLE]
for some constant independent of . Denote \underline{x}(t)=\big{(}x_{1}(t),x_{2}(t),\ldots,x_{N}(t)\big{)}^{\prime}. Then the Dynkin formula implies
[TABLE]
By the Gronwall inequality, we obtain
[TABLE]
According to the definitions of and ,
[TABLE]
Thus, (A.5) yields
[TABLE]
As a consequence,
[TABLE]
This is a contradiction. As a result, a.s.
Next, by applying (A.5) for instead of , with , and letting , we arrive at
[TABLE]
Since V\big{(}\underline{x}(t),\alpha(t)\big{)}=\big{[}\langle\mu_{N}(t),\psi\rangle+1\big{]}^{p}, this inequality implies (3.10) as desired.
To proceed, using the Dynkin formula again, we obtain
[TABLE]
for . It follows from (A.4) that
[TABLE]
Letting , by virtue of the Gronwall inequality, there exists a constant independent of such that for ,
[TABLE]
This gives (3.11) and completes the proof.
A.2 Proof of Lemma 4.7
We prove the two parts of the assertions as follows.
(i) Let \varsigma_{1},\varsigma_{2}\in D_{f}\big{(}[0,r),\mathbb{S}\big{)} and denote . It follows from Step 1 in the proof of Theorem 4.6 that for , which are the unique solution to the equation
[TABLE]
where \mathscr{L}\big{(}y_{i}(0)\big{)}=\mu_{0}. Without loss of generality, we can assume that .
First, we show that there is a constant independent on and such that
[TABLE]
It follows from (A.6) that
[TABLE]
Note that \langle\eta_{i}(s),\varphi\rangle^{2}=\big{(}E|y_{i}(s)|\big{)}^{2}\leq E|y_{i}(s)|^{2}. Thus, by Assumption A, there is a constant independent on and such that for each , \sigma\big{(}y_{i}(s),\eta_{i}(s),\varsigma_{i}(s_{-})\big{)}\leq C and
[TABLE]
Taking these inequalities into account and using the Burkholder-Davis-Gundy inequality for the last term in the right-hand side of (A.8), we arrive at
[TABLE]
By taking expectations on both sides of the above inequality and using the Gronwall inequality we obtain (A.7).
In view of (A.7) and (A.9), by assumption (A2) we have
[TABLE]
for any such that where is independent of . This shows that \eta_{1},\eta_{2}\in C\big{(}[0,r),\mathscr{M}_{1}\big{)}.
Next, we prove the continuity of . Let be the metric on defined by
[TABLE]
where the infimum is taken over the class of all strictly increasing and continuous mappings of onto itself. Because of the definition of the metric on the discrete set , if , and have same number of jumps on . Hence, to prove the continuity of , it suffices to show that there is a constant such that
[TABLE]
whenever where is the number of jumps on of and . According to the definition of and \big{\langle}\eta_{1}(t)-\eta_{2}(t),f\rangle=\mathbb{E}\big{(}f(y_{1}(t))-f(y_{2}(t))\big{)}, we have
[TABLE]
Since if , we have
[TABLE]
where is the number of jumps of and , and each is an interval with length . Denote and
[TABLE]
According to (A.6) and the Cauchy-Schwarz inequality, there is a constant such that
[TABLE]
To proceed, we estimate and . Since on , assumption (A1) and (A.11) give
[TABLE]
for excepts at finite points on its boundary. Therefore, by virtue of the Burkholder-Davis-Gundy inequality, (A.12) and (A.14) imply
[TABLE]
where is a constant which only depends on . Now we are in a position to estimate . It follows from (A.7) and (A.9) that
[TABLE]
Since where , by the boundedness of , and the Cauchy-Schwarz and the Burkholder-Davis-Gundy inequalities,
[TABLE]
Combining (A.13), (A.15), and (A.16), we obtain
[TABLE]
By the Gronwall inequality, for any ,
[TABLE]
which together with (A.11) implies (A.10).
(ii) Equation (4.20) follows from the uniqueness of the solution of (4.14) proved in Step 1 in the proof of Theorem 4.6.
A.3 Proof of Lemma 5.4
We have
[TABLE]
Thus, to prove (5.10), it suffices to show that
[TABLE]
for some constant independent of , , , and . Denote
[TABLE]
where is the greatest integer that is less than or equal to . Then . To proceed, we estimate \big{|}I_{1}(t,k,i,j)\big{|}. Let be an integer such that . Note that
[TABLE]
We have
[TABLE]
Hence, the Cauchy-Schwarz inequality implies
[TABLE]
Since is Lipschitz and
[TABLE]
for some constant independent of , assumption A and (4.3) imply that
[TABLE]
Next, using the Cauchy-Schwarz inequality again, we obtain
[TABLE]
where the last equation is a consequence of Theorem 5.25 of [36]. Therefore,
[TABLE]
Combining (A.19), (A.20), and (A.22), we arrive at
[TABLE]
By the same argument, we can show that
[TABLE]
Combining (A.23) and (A.24) yields \sup_{0\leq t\leq T}\mathbb{E}\Big{|}I_{1}(t,k,i,j)\Big{|}\leq C\varepsilon^{1/6}. Likewise, because , we obtain \mathbb{E}\Big{|}I_{2}(t,k,i,j)\Big{|}\leq C\varepsilon^{1/6}. Thus (A.18) holds. The proof of the lemma is thus complete.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Andreis L., Dai Pra P., and Fischer M. Mc Kean-Vlasov limit for interacting systems with simultaneous jumps. ar Xiv preprint ar Xiv:1704.01052 (2017).
- 2[2] Baladron, J., Fasoli, D., Faugeras, O., and Touboul J., Mean-field description and propagation of chaos in networks of Hodgkin-Huxley and Fitz Hugh-Nagumo neurons. J. Mathematical Neuroscience 2 (2012), p. 10.
- 3[3] Bao, J., Shao, J. and Yuan, C. Approximation of invariant measures for regime-switching diffusions, Potential Anal. 44 (2016), 707–727.
- 4[4] Bensoussan, A., Frehse, J. and Yam, P. Mean Field Games and Mean Field Type Control Theory , Springer Briefs in Mathematics. Springer, New York, 2013.
- 5[5] Contucci, P., Gallo, I. and Menconi, G. Phase transitions in social sciences: two-populations mean field theory. International Journal of Modern Physics B 22 (2008), 2199–2212.
- 6[6] Costa, O. and Dufour, F. Continuous Average Control of Piecewise Deterministic Markov Processes , Springer, New York, 2013.
- 7[7] Dawson, D.A. Critical dynamics and fluctuations for a mean-field model of cooperative behavior. J. Statist. Phys. 31 (1983), no. 1, 29–85.
- 8[8] Dawson, D. and Vaillancourt, J. Stochastic Mc Kean-Vlasov equations. No DEA Nonlinear Differential Equations Appl. 2 (1995), no. 2, 199–229.
