Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 60 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 14 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 93 tok/s Pro
Kimi K2 156 tok/s Pro
GPT OSS 120B 441 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Quantitative mean-field limit for interacting branching diffusions (2101.04099v2)

Published 11 Jan 2021 in math.PR

Abstract: We establish an explicit rate of convergence for some systems of mean-field interacting diffusions with logistic binary branching towards the solutions of nonlinear evolution equations with non-local self-diffusion and logistic mass growth, shown to describe their large population limits in arXiv:1303.3939. The proof relies on a novel coupling argument for binary branching diffusions based on optimal transport, which allows us to sharply mimic the trajectory of the interacting binary branching population by certain system of independent particles with suitably distributed random space-time births. We are thus able to derive an optimal convergence rate, in the dual bounded-Lipschitz distance on finite measures, for the empirical measure of the population, from the convergence rate in 2-Wasserstein distance of empirical distributions of i.i.d. samples. Our approach and results extend techniques and ideas on propagation of chaos from kinetic models to stochastic systems of interacting branching populations, and appear to be new in this setting, even in the simple case of pure binary branching diffusions.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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