Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant 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 83 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 109 tok/s Pro
Kimi K2 181 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Pathwise McKean-Vlasov Theory with Additive Noise (1812.11773v2)

Published 31 Dec 2018 in math.PR

Abstract: Abstract. We take a pathwise approach to classical McKean-Vlasov stochastic differential equations with additive noise, as e.g. exposed in Sznitmann [38]. Our study was prompted by some concrete problems in battery modelling [23], and also by recent progrss on rough-pathwise McKean-Vlasov theory, notably Cass-Lyons [10], and then Bailleul, Catellier and Delarue [4]. Such a "pathwise McKean-Vlasov theory" can be traced back to Tanaka [40]. This paper can be seen as an attempt to advertize the ideas, power and simplicity of the pathwise appproach, not so easily extracted from [4, 10, 40], together with a number of novel applications. These include mean field convergence without a priori independence and exchangeability assumption; common noise, c`adl`ag noise, and reflecting boundaries. Last not least, we generalize Dawson-G\"artner large deviations and the central limit theorem to a non-Brownian noise setting.

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

Collections

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

Summary

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

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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