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

Abstract

We establish results on the conditional and standard convex order, as well as the increasing convex order, for two processes X = (Xt)t ∈ [0, T] and Y = (Yt)t ∈ [0, T] , defined by the following McKean-Vlasov equations with common Brownian noise B0 = (Bt0)t ∈ [0, T] : dXt=b(t, Xt, L1(Xt))d t+σ(t, Xt, L1(Xt))d Bt+σ0 (t, L1(Xt))d B0t dYt=\,β(t, Yt, L1(Yt\,))d t+\,θ(t, Yt\,, L1(Yt\,))d Bt\,+\,θ0 (t, L1(Yt\,))d B0t, where L1(Xt) (respectively L1(Yt) ) denotes a version of the conditional distribution of Xt (resp. Yt ) given B0 . These results extend those established for standard McKean-Vlasov equations in [Liu-Pag\`es, 2023] and [Liu-Pag\`es, 2021]. Under suitable conditions, for a (non-decreasing) convex functional F on the path space with polynomial growth, we show E[F(X) | B0] ≤ E[F(Y) | B0] almost surely. Moreover, for a (non-decreasing) convex functional G defined on the product space of paths and their marginal distributions, we establish E [\,G(X, (L1(Xt))t∈[0, T])\,| \, B0\,]≤ E [\,G(Y, (L1(Yt))t∈[0, T])\,| \, B0\,] almost surely. Similar convex order results are also established for the corresponding particle system. Finally, we explore applications of these results to stochastic control problems and to the interbank systemic risk model introduced in [Carmona-Fouque-Sun, 2015].

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…