(7.3), p. 3612 — R^{n,1}_s ≤ κ/(nβₙ) + (κ/n) Σᵢ 𝔼|Xⁿᵢ(s) − X_{i/n}(s)|²
OpenGraphonMF.SparseRate.eq_7_3graphonpropagation-of-chaosrate-of-convergencesparse-graphs
There is such that for every , every solution of (4.1) and every ,
This is (7.3) of the paper, which §7.3 states remains valid under Conditions 4.1 and 4.3. The proof uses the Lipschitz property of , the fourth-moment bound for the centered independent edge variables, the Cauchy–Schwarz inequality and Lemma 7.1.
Throughout, is the continuum noise, , , satisfy Condition 4.1, is a graphon, the edges are independent for and independent of the noise (Condition 4.3), solves the graphon limit system (4.2) with , and is any solution of the not-so-dense system (4.1), , . Expectations are lower Lebesgue integrals in ; the solution concepts are those of the GraphonMF_SparseRate_Setting definitions.
Preamble
import Mathlib import Definitions.Def_GraphonMF_SparseRate_Setting open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal NNReal
Formal statement
namespace GraphonMF.SparseRate
/-- (7.3) (p. 3612), valid under Conditions 4.1 and 4.3 (§7.3, p. 3616): there is `κ` such that
`R^{n,1}_s ≤ κ/(nβₙ) + (κ/n) Σᵢ 𝔼|Xⁿᵢ(s) − X_{i/n}(s)|²` for all `n`, all solutions `Xⁿ` of (4.1) and all `s ≤ T`, where
`R^{n,1}_s = (1/n) Σᵢ 𝔼|(1/n) Σⱼ (ξⁿᵢⱼ/βₙ)(b(Xⁿᵢ(s), Xⁿⱼ(s)) − b(X_{i/n}(s), Xⁿⱼ(s)))|²`. -/
theorem eq_7_3 {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} {d : ℕ} {T : ℝ≥0} (hT : 0 < T)
{μ0 : I → Measure (Fin d → ℝ)} {X0 : I → Ω → Fin d → ℝ} {B : I → ℝ≥0 → Ω → Fin d → ℝ}
(hN : NoiseSetting P μ0 X0 B)
{b : (Fin d → ℝ) → (Fin d → ℝ) → (Fin d → ℝ)} {σ : (Fin d → ℝ) → Matrix (Fin d) (Fin d) ℝ}
{β : ℕ → ℝ} (h41 : Cond41 μ0 b σ β) {G : I → I → ℝ} (hG : GraphonMF.DenseRate.IsGraphon G)
{ξ : (n : ℕ) → Ω → Fin n → Fin n → ℝ} (h43 : Cond43 P X0 B ξ β G)
{X : I → ℝ≥0 → Ω → Fin d → ℝ} (hX : IsGraphonSolution42 P hN T b σ G X) :
∃ κ : ℝ, ∀ (n : ℕ) (Xn : Fin n → ℝ≥0 → Ω → Fin d → ℝ),
IsParticleSolution41 P hN h43.meas T b σ β n Xn → ∀ s : ℝ≥0, s ≤ T →
(1 / (n : ℝ≥0∞)) * ∑ i : Fin n, ∫⁻ ω,
‖(1 / (n : ℝ)) • ∑ j : Fin n, (ξ n ω i j / β n) •
(b (Xn i s ω) (Xn j s ω) - b (X (GraphonMF.DenseRate.lab n i) s ω) (Xn j s ω))‖ₑ ^ 2 ∂P ≤
ENNReal.ofReal (κ / ((n : ℝ) * β n)) +
ENNReal.ofReal (κ / n) * ∑ i : Fin n, ∫⁻ ω, ‖Xn i s ω - X (GraphonMF.DenseRate.lab n i) s ω‖ₑ ^ 2 ∂P := by sorry
end GraphonMF.SparseRate
Source
Bayraktar, Chakraborty, Wu, Graphon mean field systems, Ann. Appl. Probab. 33(5) (2023), p. 3612, (7.3) (arXiv:2003.13180 v3, pp. 26–27); validity under Conditions 4.1 and 4.3: p. 3616, §7.3, first sentence