اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn Elementary Approach To Uniform In Time Propagation Of Chaos
149
0
0.0
(
0
)
تأليف
Alain Durmus
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Based on a coupling approach, we prove uniform in time propagation of chaos for weakly interacting mean-field particle systems with possibly non-convex confinement and interaction potentials. The approach is based on a combination of reflection and synchronous couplings applied to the individual particles. It provides explicit quantitative bounds that significantly extend previous results for the convex case.
قيم البحث
اقرأ أيضاً
We consider Kacs 1D N-particle system coupled to an ideal thermostat at temperature T, introduced by Bonetto, Loss, and Vaidyanathan in 2014. We obtain a propagation of chaos result for this system, with explicit and uniform-in-time rates of order N^
(-1/3) in the 2-Wasserstein metric. We also show well-posedness and equilibration for the limit kinetic equation in the space of probability measures. The proofs use a coupling argument previously introduced by Cortez and Fontbona in 2016.
We study truncated objects using elementary methods. Concretely, we use universes and the resulting natural number object to define internal truncation levels and prove they behave similar to standard truncated objects. Moreover, we take an elementar
y approach to localizations, giving various equivalent conditions that characterize localizations and constructing a localization out of a sub-universe of local objects via an internal right Kan extension. We then use this general approach, as well as an inductive approach, to construct truncation functors. We use the resulting truncation functors to prove classical results about truncations, such as Blakers-Massey theorem, in the elementary setting. We also give examples of non-presentable $(infty, 1)$-categories where the elementary approach can be used to define and compute truncations. Finally, we turn around and use truncations to study elementary $(infty, 1)$-toposes and show how they can help us better understand subobject classifiers and universes
We address propagation of chaos for large systems of rough differential equations associated with random rough differential equations of mean field type $$ dX_t = V(X_t,mathcal{L}(X_t))dt + F(X_t,mathcal{L}(X_t))dW_t $$ where $W$ is a random rough pa
th and $mathcal{L}(X_t)$ is the law of $X_t$. We prove propagation of chaos, and provide also an explicit optimal convergence rate. The analysis is based upon the tools we developed in our companion paper [1] for solving mean field rough differential equations and in particular upon a corresponding version of the It^o-Lyons continuity theorem. The rate of convergence is obtained by a coupling argument developed first by Sznitman for particle systems with Brownian inputs.
A sequence of random variables is called exchangeable if the joint distribution of the sequence is unchanged by any permutation of the indices. De Finettis theorem characterizes all ${0,1}$-valued exchangeable sequences as a mixture of sequences of i
ndependent random variables. We present an new, elementary proof of de Finettis Theorem. The purpose of this paper is to make this theorem accessible to a broader community through an essentially self-contained proof.
This paper develops a non-asymptotic, local approach to quantitative propagation of chaos for a wide class of mean field diffusive dynamics. For a system of $n$ interacting particles, the relative entropy between the marginal law of $k$ particles and
its limiting product measure is shown to be $O((k/n)^2)$ at each time, as long as the same is true at time zero. A simple Gaussian example shows that this rate is optimal. The main assumption is that the limiting measure obeys a certain functional inequality, which is shown to encompass many potentially irregular but not too singular finite-range interactions, as well as some infinite-range interactions. This unifies the previously disparate cases of Lipschitz versus bounded measurable interactions, improving the best prior bounds of $O(k/n)$ which were deduced from global estimates involving all $n$ particles. We also cover a class of models for which qualitative propagation of chaos and even well-posedness of the McKean-Vlasov equation were previously unknown. At the center of a new approach is a differential inequality, derived from a form of the BBGKY hierarchy, which bounds the $k$-particle entropy in terms of the $(k+1)$-particle entropy.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
