Papers
Topics
Authors
Recent
2000 character limit reached

Convex order and increasing convex order for McKean-Vlasov processes with common noise

Published 24 Apr 2025 in math.PR | (2504.17576v1)

Abstract: We establish results on the conditional and standard convex order, as well as the increasing convex order, for two processes $ X = (X_t){t \in [0, T]} $ and $ Y = (Y_t){t \in [0, T]}$, defined by the following McKean-Vlasov equations with common Brownian noise $B0 = (B_t0)_{t \in [0, T]}$: \begin{align} dX_t &= b(t, X_t, \mathcal{L}1(X_t))dt + \sigma(t, X_t, \mathcal{L}1(X_t))dB_t + \sigma0(t, \mathcal{L}1(X_t))dB0_t, \ dY_t &= \beta(t, Y_t, \mathcal{L}1(Y_t))dt + \theta(t, Y_t, \mathcal{L}1(Y_t))dB_t + \theta0(t, \mathcal{L}1(Y_t))dB0_t, \end{align} where $\mathcal{L}1(X_t)$ (respectively $\mathcal{L}1(Y_t)$) denotes a version of the conditional distribution of $X_t$ (resp. $Y_t$) given $B0$. These results extend those established for standard McKean-Vlasov equations in [Liu and Pag`es, Ann. App. Prob. 2023] and [Liu and Pag`es, Bernoulli 2022]. Under suitable conditions, for a (non-decreasing) convex functional $F$ on the path space with polynomial growth, we show $\mathbb{E}[F(X) \mid B0] \leq \mathbb{E}[F(Y) \mid B0]$ almost surely. Moreover, for a (non-decreasing) convex functional $G$ defined on the product space of paths and their marginal distributions, we establish [ \mathbb{E} \Big[\,G\big(X, (\mathcal{L}1(X_t))_{t\in[0, T]}\big)\,\Big| \, B0\,\Big]\leq \mathbb{E} \Big[\,G\big(Y, (\mathcal{L}1(Y_t))_{t\in[0, T]}\big)\,\Big| \, B0\,\Big] \quad \text{almost surely}. ] Similar convex order results are also established for the corresponding particle system. We explore applications of these results to stochastic control problem - deducing in particular an associated comparison principle for Hamilton-Jacobi-Bellman equations with different coefficients - and to the interbank systemic risk model introduced by in [Carmona, Fouque and Sun, Comm. in Math. Sci. 2015].

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 3 tweets with 0 likes about this paper.