Convex order preservation for graphon mean-field systems
Abstract
In this paper, we study the convex order preservation for the graphon mean-field systems on . First, we establish the uniform-in-time Euler approximations for the graphon mean-field systems of interest, which extends previous results 7 on graphon particle systems and is necessary for our main theorem. Building on this together with appropriate conditions on the graphon functions, we then proceed to prove the marginal convex order preservation. Second, by employing the weighted -norm, we are able to further establish an infinite-horizon trajectory-level convergence result, which is key to the functional convex ordering as in 22. Finally, we apply our results to the study of value function comparison of graphon mean-field games(MFGs).
Mathematics Subject Classification (2020): 60G65, 60H35, 60J60, 60K35
Keywords: Convex order, Graphon mean-field systems, Euler schemes.
1 Introduction
Convex order between two distributions , i.e. probability measures on with finite first moment, is defined by
By taking two specific linear functions , this naturally implies that both measures have the same mean. Two -valued random vectors and are in convex order if their corresponding distributions are.
The study of convex ordering for stochastic processes dates back to the work of Hajek 16 on the case of increasing convex order, and has been explored by various authors since then, see, for instance 19; 25; 27; 9 and references therein. We also refer to 22; 26; 18; 17 for more recent articles. In 26, Pagès established functional convex order results for two Brownian martingale diffusion processes under the assumption that diffusion coefficient is convex in the spatial variable. Such a convexity condition was further relaxed by 17 in the one-marginal case while an assumption comparable to the spatial convexity of the diffusion coefficient is needed for the two-marginal case. Liu and Pagès 22 extended such functional convex order results to the McKean-Vlasov equations, and Jourdain and Pagès 18 compared the convex order of stochastic Volterra equations.
In this paper, we will investigate in depth the comparison of marginal and functional convex orders for scaled graphon mean-field systems, where “scaled” means that the drift coefficient is affine in the space variable. Such a system is defined on some filtered probability space by
where and are suitable coefficient functions; is the graphon function, defined as a symmetric measurable function from to . The graphon-weighted measure , defined as
represents the population’s influence on player ’s state, and is a sequence of i.i.d. -dimensional standard Brownian motions. As in the McKean-Vlasov dynamics, the coefficients of this system depend on the distributions of the state variables. However, we also remark that each alone is not a standard McKean-Vlasov dynamic, as its own law plays a negligible role in the evolution, see also 3. Apart from the introduction of the graphon interractions, another novelty of our framework is the extension of the time horizon to infinity.
Building on the graphon theories developped by Lovász 23, the study on graphon mean-field systems has gained considerable attention recently. They play a crucial role in modeling heterogeneous network structures of many systems beyond the scope of classical mean-field models. It is well known that the graphon serves as a natural continuum limit of the graph sequence. Motivated by this, 7; 5; 3; 13; 4 quantitatively studied the convergence of finite particle systems towards their graphon counterparts by establishing results such as propagation of chaos (POC) 7; 13, law of large numbers (LLN) 7; 3; 13; 4, uniform-in-time convergence 7, and concentration bounds on the Wasserstein distance 5. Moreover, Caines and Huang 11 incorporated graphon into the MFG framework, proved a well-posedness result for the graphon mean-field games (GMFGs), and in particular, provided an -Nash result which relates the mean-field equilibrium to the equilibria of players on the graph sequence. We should also mention that an approximate Nash-equilibrium theory for GMFG was established in 20 under a label-state formulation, which defines different strengths of approximation under different regularities of the model. We refer to 2; 6; 28 for other works on GMFG, and 14; 15 for works on graphon mean-field type control (MFC) problems.
The main contributions of our work are two-fold. First, under some dissipativity condition, we are able to establish a convergence result for the Euler scheme of the graphon mean-field systems that are uniform in both time and label. This extends the results of (7, Section 6), where the interraction is on the drift coefficient and linear, and the convergence is for the graphon particle system. To consider the convex ordering, it is necessary that the graphon interraction occurs on the diffusion coefficients, and more importantly, the Euler scheme should be established for the graphon mean-field system. The reason is that the particle system does not propagate the convex order, see (22, Remark 5.1). Under a more general non-linear interraction formulation and suitable conditions on the coefficients, we are able to make the comparison of marginal and functional convex order for graphon mean-field systems. The results is obtained by combining the forward-backward inductions with convergence of the Euler schemes, and then applied to the study of a one-dimensional linear-quadratic (LQ) GMFG.
Second, we are able to study the graphon mean-field system of infinite horizon. Under the space of -valued adapted stochastic processes, equipped with the weighted -norm, defined by
we are able to establish the trajectory-level convergence results for the Euler scheme, which is key to the functional convex ordering results in infinite horizon. This weighted space was also employed in 8 to study the infinite-horizon McKean-Vlasov FBSDEs for the purpose of solving the infinite-horizon MFC problems and MFGs.
The rest of the paper is organized as follows. We conclude Section 1 with notations used throughout the paper. In Section 2, we introduce the graphon mean-field dynamics and the associated well-posedness and Euler scheme. In Section 3, we provide all main results on convex ordering, namely the convex ordering of the Euler scheme and the functional convex ordering. Proofs related to well-posedness and Euler scheme are collected in Section 4. Finally, in Section 5, we apply our results to the comparison of the value functions of the graphon mean-field games.
1.1 Notations
1. Let . The set represents the labels of a continuum of agents. A graphon is a symmetric measurable function from to , associated with the cut-norm defined as:
2. We denote , , , and respectively the collection of probability measures, probability measures with finite -th moment, finite positive measures, and finite positive measures with finite -th moment on . Also, we define the space by
3. The -Wasserstein distance on is defined for any :
where denotes the set of probability measures in with the first marginal and the second marginal .
Fix an arbitrary reference point , the 2-Wasserstein On Positive measures () metric, firstly introduced in 21, is defined for any by
where denotes the total mass of measure ; if and otherwise, where is the Dirac measure at ; ; for , we define , and represents the pushforward of a measure by a measurable mapping .
The space is a metric space itself when endowed with the distance defined for any by
| (1.1) |
4. Let denote the set of matrices with rows and columns equipped with the operator norm defined by , for any , where denotes the canonical Euclidean norm on generated by the canonical inner product . When there is no ambiguity, we write instead of for the Euclidean norm on to simplify notation.
As (1.5) in 22, we define a partial order between two matrices in as follows:
| (1.2) |
where stands for the transpose of .
5. Given a graphon and a , we define the map by
Similar to (3.2) in 13, we have for any that
| (1.3) |
6. Denote by the space of continuous functions from to , equipped with the exponentially weighted -norm , which is defined as
| (1.4) |
In the case of , we simply write .
7. Let .
8. Denote by the space of continuous functions from to , equipped with the distance defined as follows:
| (1.5) |
9. For any with , we denote by , and similarly, . Moreover, we denote by , and .
2 Well-posedness and Euler scheme for the graphon mean-field systems
2.1 Assumptions and well-posedness
Given two graphons and , on some filtered probability space , consider for any the following two graphon mean-field systems:
| (2.1) | ||||
| (2.2) |
where we denote and , and similarly, and ; and are suitable functions; are i.i.d. -dimensional Brownian motions, and are mutually independent.
Assumption 2.1.
(i) The functions and are -Hölder continuous in , , and Lipschitz continuous in and in in the following sense: for every , there exists a positive constant such that
for every fixed , there exists such that
(ii) The map is measurable, and .
(iii) Dissipativity: There exists some such that
| (2.3) |
and
| (2.4) |
(iv) In addition, suppose that
| (2.5) |
where and , .
Assumption 2.2.
(i) The function is affine in .
(ii) For every fixed and , the function is convex in the sense that
(iii) For every fixed , the function is nondecreasing with respect to the convex order, namely,
(iv) For every , we have
(v) .
Example 2.1.
Graphon mean-field systems (2.1)-(2.2) are nonlinear with respect to the measures, which is a more general setting than the scalar framework adopted in 7; 3; 6. Under the linear interaction assumption with , i.e.
Assumption 2.2 (ii)-(iv) can be implied by the following conditions:
for every , the function is convex.
for every , we have for any ,
2.2 Euler scheme
In this section, we analyze the Euler scheme of systems (2.1)-(2.2) with step size . For , we define . Without ambiguity, we will write instead of . Let be i.i.d. random variables with probability distribution . The Euler schemes of equations (2.1) and (2.2) are defined by
| (2.6) | ||||
| (2.7) |
where and ; and are respectively the measure ensembles of and . Moreover, we can naturally extend the Euler scheme to continuous time as below (denoting , the corresponding processes): for every ,
| (2.8) | ||||
| (2.9) |
The following Proposition 2.4 is the convergence results of the Euler scheme. It is valid for both processes and , and its proof is postponed to Section 4.
Proposition 2.4.
Assume that Assumption 2.1 is in force.
- (i)
There exist such that
Moreover, there exists a constant such that for any ,
where we used the notation .
- (ii)
Recall defined in (i). Then, there exists such that for any ,
Notice from Lemma 4.2 (i) that In addition, we have the following property, which justifies that the graphon-weighted measure, i.e. or , is well-defined.
Lemma 2.5.
The map is measurable idem for .
3 Main results
3.1 Convex order results for Euler schemes
In this section, we will establish the convex ordering results for the random variables and , , defined by the Euler schemes (2.6) and (2.7). In order to simplify the notation, we rewrite (2.6) and (2.7) by setting
Then, we have
| (3.1) | ||||
| (3.2) |
where for every , we define:
First, we notice that it follows from Lemma 4.2 (i) and Lemma 2.5 that for any . Then, by Assumption 2.2, , for any and , satisfy the discrete-time counterpart.
Assumption 3.1.
(i) The function is affine in .
(ii) The function is convex in in the sense that
(iii) The function is nondecreasing in with respect to the convex order:
(iv) We have the following order between and :
(v) .
Let us recall an elementary characterization of convex order between two integrable -valued random variables or their distributions, see for instance, (22, Lemma 4.1), or similarly (1, Lemma A.1). This characterization allows us to restrict test functions from all convex functions to those with linear growth.
Lemma 3.2.
Let . Then, we have if and only if
3.1.1 Single-marginal case
For every and , we define an operator associated with by
| (3.3) |
For every , let denote the -algebra generated by , and in particular, let denote the -algebra generated by , and let denote the -algebra generated by . We can then obtain the following single-marginal result.
Proposition 3.3.
Proposition 3.3 relies on the following lemma whose proof is similar to (22, Proofs of Lemmas 4.2 and 4.3), hence is omitted.
Lemma 3.4.
Let with linear growth. Then, for every and :
(i) the function is (finite and) convex;
(ii) for any fixed , the function attains its minimum at , where is the zero-matrix of size ;
(iii) for any fixed , the function is nondecreasing with respect to the partial order of matrix, defined in (1.2);
(iv) for any , the function is convex with linear growth.
Proof of Proposition 3.3.
Assumption 3.1 directly implies , . Assume , , or equivalently, , . Let with linear growth. Then, for any :
| (the integrability is due to Lemma 4.2 (i) and Lemma 3.4 (iv)) | |||
| (by Assumption 3.1 (iii) and Lemma 3.4 (iii), since , ) | |||
| (by Lemma 3.4 (iv), since ) | |||
| (by Assumption 3.1 (iv) and Lemma 3.4 (iii)) | |||
Thus, by applying Lemma 3.2. One concludes the proof by a forward induction. ∎
3.1.2 Multi-marginal case
Fix and define if , otherwise . For every , we recursively define a sequence of functions
in a backward way as follows:
Set for or :
| (3.4) |
where is a convex function with quadratic growth in the sense that
| (3.5) |
where is defined as follows:
with and .
Set for :
| (3.6) |
The functions share the following properties.
Lemma 3.5 (Lemma 4.4 in 22).
For every and :
(i) For a fixed , the function is convex and has a quadratic growth in so that is well-defined.
(ii) For a fixed , the function is nondecreasing in with respect to the convex order in the sense that for any with ,
Proof.
(i) For every or , the function is convex due to the convexity of . Suppose that the map is convex for some . For any and , we have
| (by Assumption 3.1 (ii) and Lemma 3.4 (iii), since is convex) | |||
Thus, the function is convex, and one completes the proof by a backward induction. If , then for the case of , one should replace , , and in the above derivation by
| (3.7) | ||||
| (3.8) |
For every or , it is obvious that has a quadratic growth in the sense of (3.5). Suppose that has a quadratic growth for some . Then, also has a quadratic growth as and have a linear growth by Assumption 2.1, and one concludes by a backward induction.
(ii) Firstly, notice that for any with , we have for or ,
Next assume that is nondecreasing with respect to the convex order of for some . Then, we obtain that
| (by Assumption 3.1 and Lemma 3.4, since is convex) | |||
One completes proof by a backward induction. If , then for the case of , one should modify the above derivation as in (3.7)-(3.8). ∎
As has a quadratic growth in the sense of (3.5), the integrability of and is guaranteed by Lemma 4.2 (i). To see this,
Then, we define as follows:
Recall that and .
Lemma 3.6.
For every and , we have
The proof is similar to that of Lemma 4.5 in 22, but we provide one here for completeness.
Proof of Lemma 3.6.
Similarly, for every , we define
by
Set for or :
where is a convex function with quadratic growth in the sense of (3.5).
Set for :
Recall that , and . By a similar argument as the proof of Lemma 3.6, we obtain that for any and ,
| (3.9) |
The main result of this section is the following multi-marginal convex ordering result.
Proposition 3.7.
Proof.
We start by proving by a backward induction that
| (3.10) |
It follows from the definition of and that for or ,
Assume now for some , and consider for any and :
| (by Assumption 3.1 (iv), Lemma 3.4 (iii), and Lemma 3.5 (i)) | |||
| (since by assumption) | |||
which completes the proof of , and one proceeds by a backward induction. If , then for the case of , one should modify the above derivation as in (3.7)-(3.8). Consequently, for any , we have the following
∎
3.2 Functional convex order
3.2.1 On the dependence of trajectory
Recall the notation . Firstly, we define two interpolators as follows, which extends Definition 5.1 in 22 from to .
Definition 3.1.
(i) We define the piecewise affine interpolator , i.e.
(ii) We define the functional interpolator by
Before stating the main result of this section, i.e. Theorem 3.9, we first introduce the following result, which can be seen as a variant of Lemma 5.1 in 22 or Lemma 2.2 in 26.
Lemma 3.8.
Under Assumption 2.1, weakly converges to as for the -norm topology.
Proof.
The stated result follows immediately from
as , where we used Jensen’s inequality, the definition of the interpolator as well as Lemma 4.2. ∎
Theorem 3.9.
Assume that Assumptions 2.1 and 2.2 are in force. For every , let , denote the unique solutions of systems (2.1) and (2.2), and for every , let , denote the probability distributions of and . Then, we have
(a) Marginal convex order: , .
(b) Functional convex order: for any convex function with quadratic growth, one has
Proof.
(a) Let with linear growth. Proposition 3.3 implies that for every , where we used the notation . Consequently, we have
| (3.11) |
It follows from Lemma 4.2 that weakly converges to as , and is uniformly integrable by the Vitali convergence theorem. Moreover, notice that
which further implies the uniform integrability of . Thus, we have , and similarly, . One completes the proof of the first part by letting on both sides of (3.11), and by using Lemma 3.2.
(b) Firstly, it follows from Proposition 2.4 (i) that and are in since has a quadratic growth. We define a function as follows:
The function is obviously convex since is a linear interpolator, and has a quadratic growth on in the sense of (3.5). To see the latter,
Furthermore, recall that if , otherwise . Then,
It then follows from Proposition 3.7 that
| (3.12) |
The function is -continuous as it is convex with -quadratic growth, see (24, Lemma 2.1.1). Thanks to Lemma 3.8, we have that weakly converges to for the -norm topology, and moreover, weakly converges to since is continuous under the -norm topology. Similarly, weakly converges to . As has a quadratic growth, we have for some positive constant ,
Thanks to Lemma 3.8, together with the Vitali convergence theorem, we have the uniform integrability of . Therefore, is also uniformly integrable. Consequently, . Similarly, . Thus, by letting on both sides of the inequality (3.12), we have
| (3.13) |
Notice from Lemma 4.2 (ii) that
Thus, we conclude the proof by letting on both sides of (3.13). ∎
3.2.2 Extended functional convex order
The main result of this section is the following corollary.
Corollary 3.10.
Assume that Assumptions 2.1 and 2.2 are in force. For every , let , denote the unique solutions of systems (2.1) and (2.2), and for every , let , denote the probability distributions of and . In addition, let and . Then, for any function defined as
satisfying the following conditions:
(i) is convex in with quadratic growth in the sense that
(ii) G is continuous in with respect to the distance defined in (1.5), and is nondecreasing in with respect to the convex order in the sense that for any and such that , ,
one has
The proof of Corollary 3.10 relies on the following proposition. Recall that if , otherwise , and .
Proposition 3.11.
Let be respectively random variables and probability distribution ensembles defined by (2.6) and (2.7). Under Assumptions 2.1 and 2.2, for any function defined as
satisfying the following conditions:
(i) is convex in with quadratic growth in the sense that
(ii) is nondecreasing in with respect to the convex order in the sense that for any and such that , ,
one has
Proof.
Similar to and , we define
| (3.14) |
The rest of the proof proceeds in a similar manner to that of Proposition 3.7. ∎
Next, we extend the definition of to the space as follows: for any ,
and similarly, for , we define
Recall that , , for , and , . We define for every , , and similarly, .
Proof of Corollary 3.10.
We start by proving that
| (3.15) |
where we used the definition of , for the first line, and the triangle inequality of for the second line. To prove (3.15), on the one hand, for , we have
| (3.16) |
as , where is a sequence of random variables with probability distribution , independent of , and we used the fact that is the distribution of the random variable
for the first line, and Lemma 4.2 (i) for the third line. On the other hand, also from Lemma 4.2, we have
4 Proofs of the well-posedness and the Euler scheme
4.1 Proof of Lemma 2.3
First, let us introduce two complete metric spaces and as follows
endowed with the metrics and , respectively, which are given by
Consider the map , defined as follows:
where is the law of the solution to the system with the given at time , i.e.
| (4.1) |
By similar arguments as Bayraktar et al. in 3, there exists a unique pathwise solution to (4.1) due to the Lipschitz properties of , and the map is well-defined, namely, .
Next, we show that is a contraction with respect to the metric . We start by considering for any ,
Using Itô’s formula, we have
where and are defined as:
respectively. By (2.3), we have
Then, using the fact that for any , , where denotes the Frobenius norm of , defined as , we obtain that
| (4.2) | ||||
where we used the Lipschitz property as well as (1.3) for the second line. Combining these two estimates gives
where due to (2.4), and . It then follows from the Gronwall’s inequality that
Letting and using the fact that , we obtain that
Then, we obtain
Thus, is a contraction from to itself. Then, by the Banach fixed-point theorem, there exists a unique solution to
with and . Notice that is -continuous as the Lebesgue integral is obviously continuous combined with the fact that the Itô integral admits a continuous modification. Consequently, .
4.2 Proof of Lemma 2.5
By Lemma A.1 in 6, it suffices to show that for any ,
| (4.4) |
Firstly, we will prove by a forward induction that
| (4.5) |
This holds for due to the measurability of , the i.i.d. property of and the independence between . Next, suppose that (4.5) holds up to for some . To complete the proof of (4.5), it suffices to show that
| (4.6) |
is measurable for all bounded continuous functions . From (2.6), we can write in the form of for some . Notice that is continuous on for each , and is measurable on for each . Then, is a Carathéodory function, and hence is jointly measurable ((10, Lemma 4.12)). This finishes the verification of (4.6).
4.3 Proof of Proposition 2.4
We first present an elementary result that will be essential for the proof of Proposition 2.4.
Lemma 4.1 (Lemma 7.1 in 7).
Let be a non-negative differentiable function. Suppose
for some , and non-negative and continuous function . Then,
In particular, if .
The proof of Proposition 2.4 follows immediately from the following lemma, i.e. Lemma 4.2, combined with the definition of the exponentially decaying -norm , defined in (1.4).
Lemma 4.2.
Assume that Assumption 2.1 is in force.
- (i)
There exist such that
Moreover, there exists a constant such that for any ,
where we used the notation .
- (ii)
Recall defined in (i). Then, there exists such that for any ,
Proof.
(i) Using Itô’s formula, we have
Therefore, the functions
are differentiable, and
| (4.7) |
for all . From (2.3), we have
ans hence
| (4.8) |
where the last inequality uses Jensen’s inequality. For the rest of integrand in (4.7), we deduce by a similar argument as in (4.2) that
with and , where the second line uses the Lipschitz property of , and the last line uses (1.3). Consequently, we obtain that
Combining this with (4.8) gives
| (4.9) |
where by assumption. Integrating over gives
Since is non-negative and differentiable, using Lemma 4.1 with , , and , we have , for any , where
Substituting into (4.9) yields
| (4.10) |
Since is non-negative and differentiable, using Lemma 4.1 again, we have , uniformly in and , with
which completes the proof of
Next, we claim that for some
| (4.11) |
To see this, write
where we denote , and let , and . Using (2.3), (1.3), (2.5) and the Lipschitz properties of , we have
| (4.12) |
| (4.13) |
Combining these three estimates gives
| (4.14) |
Integrating over yields
| (4.15) |
since
Rewrite (4.15) as
where and . From (2.4), we can choose such that and for all . Then, for all ,
Substituting this back to (4.14) gives
since
Following the same derivation as before, we obtain that
where , and thus complete the proof of (4.11).
Then, using (4.11)-(4.13) and the Lipschitz properties of , we have for any and ,
| (4.16) |
where Combining (4.16) with (4.11), we can easily verify that
| (4.17) |
which completes the proof of part (b.i) by letting and .
(ii) Recall defined in (i). Firstly, notice that the definition of continuous time Euler scheme (2.8) implies that
| (4.18) |
where . In addition, we define as follows:
| (4.19) |
Then, using Itô’s formula, we have
This implies that the functions
are differentiable, and
for all . By adding and subtracting terms, we have
with , where the inequality uses (2.3), Assumption 2.1 (i), the Cauchy-Schwarz inequality, (4.17) and (4.16). Similarly, we have
Combining these two estimates, we have
| (4.20) |
for all . Integrating over gives
with . By Lemma 4.1 with , and , we have for any and ,
Substituting this back to (4.20), we obtain that
with . Using Lemma 4.1 again, we obtain that , uniformly in and , for any , where is defined as
Thus, we complete the proof by letting . ∎
5 Applications to graphon mean-field games
In this section, we provide an example to illustrate how the (extended) functional convex order results can be used to compare value functions in linear-quadratic(LQ) graphon mean-field games (MFGs). Given two graphons , we first define the corresponding graphon-weighted means by
Then, let us consider the following one-dimensional controlled dynamics:
where , and represents the control of agent . The function is Lipschitz and convex; is a sequence of independent one-dimensional Brownian motions; is a -valued flow of probability measure ensembles; and the map is measurable satisfying . Agent aims to maximize her cost function defined as follows:
To solve this problem, we first fix . The value function for agent , defined as , solves the following Hamilton-Jacobi-Bellman (HJB) equation:
| (5.1) |
with the Hamiltonian defined by
When there is no ambiguity, we write instead of to simplify notation. In the LQ setting, a natural candidate for the value function is given by
Then, the optimal control for agent takes the form
where the first equality comes from the definition of , and we denote . Substituting the above and into (5.1), we obtain the following ordinary differential equation (ODE) system:
| (5.2) |
Notice that the first equation is a Riccati equhation, which has a unique closed-form solution independent of . Moreover, , for any (see (2.50) in 12). Hence, in the following discussion, we denote it by and consider it as known.
The previous analysis is valid for any plug-in . Now we consider a special defined as:
where is the unique strong solution, see (3, Proposition 2.1), of the graphon mean-field system
| (5.3) |
We denote , and notice that . Then, we are left to verify the unique solvability of the system
| (5.4) |
To solve the system (5.4), we use similar techniques as (11, Section 5) by converting the existence analysis into a fixed-point problem. More precisely, we view as a function of . Below we derive an equation for by eliminating . Denote the function space consisting of continuous -valued functions on , equipped with the norm . Define the operator as follows: for ,
If we assume in addition that
| (5.5) |
then is from to itself.
The solution of (5.4) further reduces to finding a fixed point to the equation:
Denote . We have the bound for the operator norm:
Hence, is a contraction and (5.4) has a unique solution. With this solution , the dynamics (5.3) is then determined, and so is . Finally, is determined by the third equation in (5.2) as it only depends on , and . We remark that is indeed the unique graphon MFG equilibrium. This follows from the facts that is the unique optimal control as the the cost function is strictly convex in , and the uniquely solvable system (5.4) does not change for different plug-in ’s.
Moreover, as the solution of the system (5.4) is continuous on due to the definition of and (5.5). We have from the first equation in (5.4) that is Lipschitz continuous since the boundedness of the derivative . Thus, the optimal dynamics (5.3) satisfies Assumption 2.1 (i)-(ii) and Assumption 2.2 (i)-(iii) thanks to Example 2.1. Besides, the unique solvability of (5.4) implies that depends on and , i.e. .
Now let us introduce another controlled dynamics:
| (5.6) |
and its associated cost function
| (5.7) |
where is defined by
the function is Lipschitz, and the map is measurable satisfying for some . By a similar reasoning as before, there exists a unique graphon MFG equilibrium to (5.6)-(5.7), and denote the optimal control and the corresponding flow of measure ensembles by and , respectively.
We assume in addition the following two conditions:
, for any ;
for any fixed , we have for any that
Notice that where also solves (5.4) since the equation of , i.e. the expectation of the optimal controlled dynamics, does not change if we switch the diffusion coefficient from to . Thus, Assumption 2.2 (iv)-(v) are satisfied by Example 2.1. Consequently, Theorem 3.9 in this paper implies the comparison of the following two value functions , which are defined as:
More precisely, , .
References
- [1] (2019) Sampling of probability measures in the convex order by wasserstein projection. arXiv preprint arXiv:1709.05287. Cited by: §3.1.
- [2] (2022) Stochastic graphon games: II. the linear-quadratic case. Applied Mathematics & Optimization 85 (3), pp. 39. Cited by: §1.
- [3] (2023) Graphon mean field systems. The Annals of Applied Probability 33 (5), pp. 3587–3619. Cited by: §1, §1, §2.1, Example 2.1, §4.1, §5.
- [4] (2025) Graphon particle systems with common noise. arXiv preprint arXiv:2507.03265. Cited by: §1.
- [5] (2024) Concentration of measure for graphon particle system. Advances in Applied Probability 56 (4), pp. 1279–1306. Cited by: §1.
- [6] (2023) Propagation of chaos of forward–backward stochastic differential equations with graphon interactions. Applied Mathematics & Optimization 88 (1), pp. 25. Cited by: §1, Example 2.1, §4.2.
- [7] (2022) Stationarity and uniform in time convergence for the graphon particle system. Stochastic Processes and their Applications 150, pp. 532–568. Cited by: §1, §1, Example 2.1, Lemma 4.1, Abstract.
- [8] (2023) Solvability of infinite horizon mckean–vlasov fbsdes in mean field control problems and games. Applied Mathematics & Optimization 87 (1), pp. 13. Cited by: §1.
- [9] (2007) Convex ordering criteria for Lévy processes. Advances in Data Analysis and Classification 1 (2), pp. 143–173. Cited by: §1.
- [10] (2015) Arbitrage and duality in nondominated discrete-time models. The Annals of Applied Probability 25 (2), pp. 823–859. Cited by: §4.2.
- [11] (2021) Graphon mean field games and their equations. SIAM Journal on Control and Optimization 59 (6), pp. 4373–4399. Cited by: §1, §5.
- [12] (2018) Probabilistic theory of mean field games with applications i. Springer. Cited by: §5.
- [13] (2025) Nonlinear graphon mean-field systems. arXiv preprint arXiv:2402.08628. Cited by: §1.1, §1, §2.1.
- [14] (2026) Linear-quadratic optimal control for non-exchangeable mean-field sdes and applications to systemic risk. ESAIM: Control, Optimisation and Calculus of Variations 32, pp. 34. Cited by: §1.
- [15] (2025) A non-exchangeable mean field control problem with controlled interactions. arXiv preprint. Cited by: §1.
- [16] (1985) Mean stochastic comparison of diffusion. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 68 (3), pp. 315–329. Cited by: §1.
- [17] (2023) Convex ordering of solutions to one-dimensional SDEs. arXiv preprint arXiv:2312.09779. Cited by: §1.
- [18] (2025) Convex ordering for stochastic volterra equations and their euler schemes. Finance and Stochastics 29 (1), pp. 1–62. Cited by: §1.
- [19] (1998) Robustness of the black and scholes formula. Mathematical Finance 8 (2), pp. 93–126. Cited by: §1.
- [20] (2023) A label-state formulation of stochastic graphon games and approximate equilibria on large networks. Mathematics of Operations Research 48 (4), pp. 1987–2018. Cited by: §1.
- [21] (2023) Extending the wasserstein metric to positive measures. arXiv preprint arXiv:2303.02183. Cited by: §1.1.
- [22] (2023) Functional convex order for the scaled mckean–vlasov processes. The Annals of Applied Probability 33 (6A), pp. 4491–4527. Cited by: §1.1, §1, §1, §3.1.1, §3.1.2, §3.1, §3.2.1, §3.2.1, Lemma 3.5, Abstract.
- [23] (2012) Large networks and graph limits. American Mathematical Society. Cited by: §1.
- [24] (2006) Convexity and well-posed problems. Springer Science & Business Media. Cited by: §3.2.1.
- [25] (1999) Propagation of convexity by markovian and martingalian semigroups. Potential Analysis 10 (2), pp. 133–175. Cited by: §1.
- [26] (2014) Convex order for path-dependent derivatives: a dynamic programming approach. arXiv preprint arXiv:1407.6348. Cited by: §1, §3.2.1.
- [27] (2007) Robustness of delta hedging for path-dependent options in local volatility models. Journal of Applied Probability 44 (4), pp. 865–879. Cited by: §1.
- [28] (2024) Optimal investment in a large population of competitive and heterogeneous agents. Finance and Stochastics 28 (2), pp. 497–551. Cited by: §1.