pith. sign in

arxiv: 2605.20697 · v2 · pith:A4KBJJQXnew · submitted 2026-05-20 · 🧮 math.PR · math.AP· math.OC

Uniform-in-time propagation of chaos for Second-Order Consensus-Based Optimization

Seung-Yeal Ha , Franca Hoffmann , Dohyeon Kim This is my paper

Pith reviewed 2026-06-30 17:39 UTC · model grok-4.3

classification 🧮 math.PR math.APmath.OC
keywords propagation of chaosconsensus-based optimizationsecond-order dynamicsuniform-in-time estimatesmean-field limitparticle systemsLyapunov functionalstochastic optimization
5
0 comments X

The pith

Shifted internal variables close uniform-in-time propagation of chaos for second-order CBO despite an undamped translation mode.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that the unmodified second-order consensus-based optimization dynamics satisfy quantitative propagation of chaos that holds uniformly in time, together with an almost uniform stability bound on the particle system. This requires a new argument because the consensus force and noise act only on velocity while position evolves by transport, and the shift-invariant interaction leaves an undamped translation mode. The authors introduce shifted internal variables to isolate contracting fluctuation modes, then construct a Lyapunov functional containing a position-velocity cross term whose exponential decay renders the coupling coefficient integrable. Uniform raw moment bounds, concentration inequalities, and a Monte Carlo estimate then deliver the classical rate uniformly in time. A reader cares because the result justifies long-time particle simulations of the mean-field optimizer without error accumulation.

Core claim

We prove quantitative uniform-in-time propagation of chaos for the unmodified second-order CBO dynamics, together with an almost uniform-in-time stability estimate for the microscopic particle system. The proof proceeds by introducing shifted internal variables that separate the contracting fluctuation modes from the undamped translation mode. In these variables a Lyapunov functional with a position-velocity cross term yields exponential decay of centered moments; this decay renders the time-dependent coupling coefficient integrable. Combined with uniform raw moment bounds, concentration inequalities, stability estimates for the weighted mean, and a Monte Carlo estimate, the argument recover

What carries the argument

Shifted internal variables that separate contracting fluctuation modes from the undamped translation mode, supporting a Lyapunov functional with a position-velocity cross term that produces exponential decay of centered moments.

If this is right

  • The particle system approximates the mean-field limit at the Monte Carlo rate uniformly in time.
  • The microscopic system satisfies an almost uniform-in-time stability estimate at rate O(J^{-q}) that avoids sampling error.
  • Spatial concentration is recovered indirectly through velocity dissipation even though consensus and noise act only on velocity.
  • The time-dependent coupling coefficient becomes integrable once the centered-moment decay is established.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same shifted-variable technique may apply to other second-order kinetic models whose interaction leaves a neutral translation mode.
  • Uniform-in-time control suggests that finite-particle CBO simulations remain reliable for arbitrarily long optimization horizons without error blow-up.
  • The position-velocity cross term in the Lyapunov functional could be adapted to prove uniform propagation of chaos in related transport-forcing systems.

Load-bearing premise

The weighted interaction is shift-invariant, so it preserves an undamped translation mode that prevents a standard Euclidean phase-space coupling from closing uniformly in time.

What would settle it

A direct estimate showing that the Euclidean distance between two particle systems grows linearly in time without the shift, while the shifted Lyapunov functional decays exponentially and yields an integrable coupling coefficient.

read the original abstract

We study second-order Consensus-Based Optimization (CBO), a derivative-free global optimization algorithm in which the consensus force and the multiplicative exploratory noise act on particle velocities. We prove quantitative uniform-in-time propagation of chaos for the unmodified second-order CBO dynamics, together with an almost uniform-in-time stability estimate for the microscopic particle system. The proof is not a direct adaptation of the first-order CBO argument. Although both first- and second-order CBO have multiplicative noise that degenerates near consensus and a shift-invariant weighted interaction, the kinetic model has an additional structural obstruction: the consensus mechanism and the stochastic forcing act only on the velocity variable, while the position variable evolves by transport. Thus spatial concentration has to be recovered indirectly through velocity dissipation. Moreover, the shift-invariant interaction leaves a translation mode that is not directly damped by the consensus force, so a standard synchronous coupling in the Euclidean phase-space distance does not close uniformly in time. The main idea of the paper is to introduce shifted internal variables that separate the contracting fluctuation modes from the undamped translation mode. In these variables we build a Lyapunov functional with a position-velocity cross term and prove exponential decay of centered moments. This decay is the mechanism that makes the time-dependent coupling coefficient integrable. Combining it with uniform-in-time raw moment bounds, concentration inequalities, stability estimates for the weighted mean, and a Monte Carlo estimate, we obtain the classical Monte Carlo rate for propagation of chaos uniformly in time. The system-to-system stability estimate avoids the sampling error and yields the faster rate \(O(J^{-q})\).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript proves quantitative uniform-in-time propagation of chaos for the unmodified second-order Consensus-Based Optimization (CBO) dynamics, together with an almost uniform-in-time stability estimate for the microscopic particle system. It addresses the structural obstructions of velocity-only forcing (requiring indirect recovery of spatial concentration via velocity dissipation) and the undamped translation mode (arising from shift-invariant weighted interaction) by introducing shifted internal variables that separate contracting fluctuation modes from the translation mode. In these variables a Lyapunov functional with a position-velocity cross term is constructed to prove exponential decay of centered moments; this decay renders the time-dependent coupling coefficient integrable. The argument combines this decay with uniform-in-time raw moment bounds, concentration inequalities, stability estimates for the weighted mean, and a Monte Carlo estimate to recover the classical Monte Carlo rate uniformly in time.

Significance. If the result holds, the work supplies the first rigorous uniform-in-time propagation-of-chaos analysis for second-order CBO, extending prior first-order results to a setting with qualitatively different forcing structure. The technical device of shifted variables plus a cross-term Lyapunov functional to isolate and control the translation mode is a substantive contribution that may transfer to other translation-invariant stochastic consensus systems. The dual provision of propagation-of-chaos and system-to-system stability estimates (the latter avoiding sampling error and yielding the faster rate O(J^{-q})) enhances both theoretical and practical value for derivative-free global optimization algorithms.

major comments (1)
  1. [main construction of the Lyapunov functional and exponential decay of centered moments] The central construction relies on exponential decay of centered moments in the shifted variables to guarantee integrability of the coupling coefficient. The abstract states that the weighted mean evolves according to the second-order dynamics, so its time derivative necessarily appears when differentiating the Lyapunov functional. A concrete estimate is required showing that the resulting commutator terms are absorbed without introducing time-dependent factors that degrade the decay rate or destroy uniform integrability, particularly in the regime where multiplicative noise degenerates near consensus. Without such control the claimed uniform-in-time propagation of chaos does not follow.
minor comments (1)
  1. [preliminaries / notation] The notation for the shifted internal variables and the precise definition of the weighted mean should be introduced with explicit formulas at the beginning of the proof section to improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for identifying the need for explicit control of the commutator terms. We address the major comment below and will revise the manuscript to strengthen the presentation.

read point-by-point responses

  1. Referee: [main construction of the Lyapunov functional and exponential decay of centered moments] The central construction relies on exponential decay of centered moments in the shifted variables to guarantee integrability of the coupling coefficient. The abstract states that the weighted mean evolves according to the second-order dynamics, so its time derivative necessarily appears when differentiating the Lyapunov functional. A concrete estimate is required showing that the resulting commutator terms are absorbed without introducing time-dependent factors that degrade the decay rate or destroy uniform integrability, particularly in the regime where multiplicative noise degenerates near consensus. Without such control the claimed uniform-in-time propagation of chaos does not follow.

    Authors: We agree that a fully explicit estimate of the commutator terms generated by the evolution of the weighted mean is necessary to close the argument. In the manuscript these terms are controlled via the uniform-in-time raw-moment bounds together with the exponential decay of centered moments already obtained in the shifted variables; the position-velocity cross term supplies additional dissipation that compensates for the vanishing of the multiplicative noise near consensus. Nevertheless, the current write-up does not isolate this calculation in a dedicated statement. In the revised version we will insert a short proposition (placed immediately after the definition of the Lyapunov functional) that computes the commutator explicitly, shows that it is absorbed by the existing exponential decay without introducing non-integrable time-dependent prefactors, and verifies that the resulting differential inequality for the Lyapunov functional remains uniform in time. This addition will make the integrability of the coupling coefficient transparent. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation self-contained from dynamics

full rationale

The paper derives moment decay, integrability of the coupling coefficient, and propagation-of-chaos rates directly from the second-order particle dynamics via shifted variables and a Lyapunov functional with cross term. No quoted step reduces a claimed prediction or uniqueness result to a fitted parameter, self-citation chain, or definitional tautology. The central estimates (exponential decay of centered moments, uniform raw-moment bounds) are obtained by direct computation on the SDE, and the Monte-Carlo rate follows from standard concentration plus stability of the weighted mean; none of these steps is forced by construction from the target conclusion.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proof relies on standard stochastic-analysis tools (SDE well-posedness, moment estimates, concentration inequalities) and domain assumptions on the CBO interaction kernel and noise; no free parameters, new entities, or ad-hoc axioms are introduced in the abstract.

axioms (1)
  • domain assumption Standard assumptions on the interaction kernel and noise coefficients for CBO to ensure well-posedness of the SDE system.
    Implicit in the dynamics studied.

pith-pipeline@v0.9.1-grok · 5814 in / 1109 out tokens · 38344 ms · 2026-06-30T17:39:22.881281+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

53 extracted references · 38 canonical work pages

  1. [1]

    Andrew M. Stuart. ‘Inverse problems: a Bayesian perspective’. In:Acta Numerica19(2010), pp. 451–559

    2010

  2. [2]

    Springer, 2005

    Jari Kaipio and Erkki Somersalo.Statistical and Computational Inverse Problems. Springer, 2005

    2005

  3. [3]

    Iglesias, Kody J

    Marco A. Iglesias, Kody J. H. Law and Andrew M. Stuart. ‘Ensemble Kalman methods for inverse problems’. In:Inverse Problems29.4 (2013), pp. 045001, 20.issn: 0266-5611,1361-6420.doi:10.1088/0266- 5611/29/4/045001.url:https: //doi.org/10.1088/0266-5611/29/4/045001

    work page doi:10.1088/0266- 2013

  4. [4]

    Conn, Katya Scheinberg and Luis N

    Andrew R. Conn, Katya Scheinberg and Luis N. Vicente.Introduction to Derivative-Free Optimization. SIAM, 2009

    2009

  5. [5]

    Sahinidis

    Luis Miguel Rios and Nikolaos V. Sahinidis. ‘Derivative-free optimization: a review of algorithms and comparison of software implementations’. In:Journal of Global Optimization56.3 (2013), pp. 1247–1293

    2013

  6. [6]

    Kennedy and R

    J. Kennedy and R. Eberhart. ‘Particle swarm optimization’. In:Proceedings of ICNN’95 - International Conference on Neural Networks. volume4. 1995, 1942–1948 vol.4.doi:10.1109/ICNN.1995.488968

    work page doi:10.1109/icnn.1995.488968 1995

  7. [7]

    ‘On the global convergence of particle swarm optimization methods’

    Hui Huang, Jinniao Qiu and Konstantin Riedl. ‘On the global convergence of particle swarm optimization methods’. In: Applied Mathematics & Optimization88.2 (2023), p. 30

    2023

  8. [8]

    ‘A consensus-based model for global optimization and its mean-field limit’

    René Pinnau, Claudia Totzeck, Oliver Tse and Stephan Martin. ‘A consensus-based model for global optimization and its mean-field limit’. In:Math. Models Methods Appl. Sci.27.1 (2017), pp. 183–204.issn: 0218-2025,1793-6314.doi: 10.1142/S0218202517400061.url:https://doi.org/10.1142/S0218202517400061

    work page doi:10.1142/s0218202517400061.url:https://doi.org/10.1142/s0218202517400061 2017

  9. [9]

    J. A. Carrillo, Y.-P. Choi, C. Totzeck and O. Tse. ‘An analytical framework for consensus-based global optimiza- tion method’. In:Math. Models Methods Appl. Sci.28.6 (2018), pp. 1037–1066.issn: 0218-2025.doi:10 . 1142 / S0218202518500276.url:https://doi-org.extranet.enpc.fr/10.1142/S0218202518500276

    work page doi:10.1142/s0218202518500276 2018

  10. [10]

    J. A. Carrillo, F. Hoffmann, A. M. Stuart and U. Vaes. ‘Consensus-based sampling’. In:Stud. Appl. Math.148.3 (2022), pp. 1069–1140.issn: 0022-2526,1467-9590.doi:10.1111/sapm.12470.url:https://doi.org/10.1111/sapm.12470

    work page doi:10.1111/sapm.12470.url:https://doi.org/10.1111/sapm.12470 2022

  11. [11]

    ‘Well posedness and convergence analysis of the ensemble Kalman inversion’

    Dirk Blömker, Claudia Schillings, Philipp Wacker and Simon Weissmann. ‘Well posedness and convergence analysis of the ensemble Kalman inversion’. In:Inverse Problems35.8 (2019), pp. 085007, 32.issn: 0266-5611,1361-6420.doi: 10.1088/1361-6420/ab149c.url:https://doi.org/10.1088/1361-6420/ab149c

    work page doi:10.1088/1361-6420/ab149c.url:https://doi.org/10.1088/1361-6420/ab149c 2019

  12. [12]

    ‘Ensemble Kalman inversion: mean-field limit and convergence analysis’

    Zhiyan Ding and Qin Li. ‘Ensemble Kalman inversion: mean-field limit and convergence analysis’. In:Stat. Comput.31.1 (2021), Paper No. 9, 21.issn: 0960-3174,1573-1375.doi:10.1007/s11222-020-09976-0.url:https://doi.org/10.1007/ s11222-020-09976-0

    work page doi:10.1007/s11222-020-09976-0.url:https://doi.org/10.1007/ 2021

  13. [13]

    ‘Ensemble Kalman sampler: mean-field limit and convergence analysis’

    Zhiyan Ding and Qin Li. ‘Ensemble Kalman sampler: mean-field limit and convergence analysis’. In:SIAM J. Math. Anal.53.2 (2021), pp. 1546–1578.issn: 0036-1410,1095-7154.doi:10.1137/20M1339507.url:https://doi.org/10. 1137/20M1339507

    work page doi:10.1137/20m1339507.url:https://doi.org/10 2021

  14. [14]

    ‘Consensus-based optimization methods converge globally’

    Massimo Fornasier, Timo Klock and Konstantin Riedl. ‘Consensus-based optimization methods converge globally’. In: SIAM J. Opt.34.3 (2024), pp. 2973–3004

    2024

  15. [15]

    ‘Convergence of a first-order consensus-based global optimization al- gorithm’

    Seung-Yeal Ha, Shi Jin and Doheon Kim. ‘Convergence of a first-order consensus-based global optimization al- gorithm’. In:Math. Models Methods Appl. Sci.30.12 (2020), pp. 2417–2444.issn: 0218-2025,1793-6314.doi:10 . 1142/S0218202520500463.url:https://doi.org/10.1142/S0218202520500463

    work page doi:10.1142/s0218202520500463 2020

  16. [16]

    ‘Convergence and error estimates for time-discrete consensus-based optimization algorithms’

    Seung-Yeal Ha, Shi Jin and Doheon Kim. ‘Convergence and error estimates for time-discrete consensus-based optimization algorithms’. In:Numer. Math.147.2 (2021), pp. 255–282.issn: 0029-599X,0945-3245.doi:10.1007/s00211-021-01174-y. url:https://doi.org/10.1007/s00211-021-01174-y

    work page doi:10.1007/s00211-021-01174-y 2021

  17. [17]

    ‘Convergence analysis of the discrete consensus-based optim- ization algorithm with random batch interactions and heterogeneous noises’

    Dongnam Ko, Seung-Yeal Ha, Shi Jin and Doheon Kim. ‘Convergence analysis of the discrete consensus-based optim- ization algorithm with random batch interactions and heterogeneous noises’. In:Math. Models Methods Appl. Sci.32.6 (2022), pp. 1071–1107.issn: 0218-2025,1793-6314.doi:10.1142/S0218202522500245.url:https://doi.org/10.1142/ S0218202522500245

    work page doi:10.1142/s0218202522500245.url:https://doi.org/10.1142/ 2022

  18. [18]

    ‘Mean-field limits for Consensus-Based Optimization and Sampling’

    Nicolai Jurek Gerber, Franca Hoffmann and Urbain Vaes. ‘Mean-field limits for Consensus-Based Optimization and Sampling’. In:arXiv preprint2312.07373(2023)

    work page arXiv 2023

  19. [19]

    Nicolai Gerber, Franca Hoffmann, Dohyeon Kim and Urbain Vaes.Uniform-in-time propagation of chaos for Consensus- Based Optimization. 2025. arXiv:2505.08669 [math.PR].url:https://arxiv.org/abs/2505.08669

    work page arXiv 2025

  20. [20]

    ‘Uniform-in-time mean-field limit estimate for the Consensus-Based Optimization’

    Hui Huang and Hicham Kouhkouh. ‘Uniform-in-time mean-field limit estimate for the Consensus-Based Optimization’. In:arXiv preprint2411.03986(2024)

    work page arXiv 2024

  21. [21]

    Uniform-in-Time Weak Propagation of Chaos for Consensus-Based Optimization.Ann

    Erhan Bayraktar, Ibrahim Ekren and Hongyi Zhou. ‘Uniform-in-time weak propagation of chaos for consensus-based optimization’. In:arXiv preprint2502.00582(2025). 75

    work page arXiv 2025

  22. [22]

    ‘From particle swarm optimization to consensus based optimization: Stochastic mod- eling and mean-field limit’

    Sara Grassi and Lorenzo Pareschi. ‘From particle swarm optimization to consensus based optimization: Stochastic mod- eling and mean-field limit’. In:Mathematical Models and Methods in Applied Sciences31.08 (2021), pp. 1625–1657.doi: 10.1142/S0218202521500342. eprint:https://doi.org/10.1142/S0218202521500342.url:https://doi.org/10.1142/ S0218202521500342

    work page doi:10.1142/s0218202521500342 2021

  23. [23]

    ‘Zero-Inertia Limit: From Particle Swarm Optimization to Consensus- Based Optimization’

    Cristina Cipriani, Hui Huang and Jinniao Qiu. ‘Zero-Inertia Limit: From Particle Swarm Optimization to Consensus- Based Optimization’. In:SIAM Journal on Mathematical Analysis54.3 (2022), pp. 3091–3121.doi:10.1137/21M1412323. eprint:https://doi.org/10.1137/21M1412323.url:https://doi.org/10.1137/21M1412323

    work page doi:10.1137/21m1412323 2022

  24. [24]

    ‘Foundations of kinetic theory’

    Mark Kac. ‘Foundations of kinetic theory’. In:Proceedings of The third Berkeley symposium on mathematical statistics and probability. volume3. 600. 1956, pp. 171–197

    1956

  25. [25]

    ‘Topics in propagation of chaos’

    Alain-Sol Sznitman. ‘Topics in propagation of chaos’. In:École d’Été de Probabilités de Saint-Flour XIX—1989. volume

    1989

  26. [26]

    Springer, Berlin, 1991, pp

    Lecture Notes in Math. Springer, Berlin, 1991, pp. 165–251.isbn: 3-540-53841-0.doi:10.1007/BFb0085169.url: https://doi.org/10.1007/BFb0085169

    work page doi:10.1007/bfb0085169.url: 1991

  27. [27]

    H. P. McKean Jr. ‘Propagation of Chaos for a Class of Non-linear Parabolic Equations’. In:Stochastic Differential Equations (Lecture Series in Differential Equations, Session 7, Catholic Univ., 1967). Arlington, VA: Air Force Office of Scientific Research, 1967, pp. 41–57

    1967

  28. [28]

    ‘Propagation of chaos: a review of models, methods and applications

    Louis-Pierre Chaintron and Antoine Diez. ‘Propagation of chaos: a review of models, methods and applications. I. Models and methods’. In:Kinet. Relat. Models15.6 (2022), pp. 895–1015.issn: 1937-5093,1937-5077.doi:10.3934/krm.2022017. url:https://doi.org/10.3934/krm.2022017

    work page doi:10.3934/krm.2022017 2022

  29. [29]

    ‘Propagation of chaos: a review of models, methods and applications

    Louis-Pierre Chaintron and Antoine Diez. ‘Propagation of chaos: a review of models, methods and applications. II. Applications’. In:Kinet. Relat. Models15.6(2022),pp. 1017–1173.issn:1937-5093,1937-5077.doi:10.3934/krm.2022018. url:https://doi.org/10.3934/krm.2022018

    work page doi:10.3934/krm.2022018 2022

  30. [30]

    ‘On a strong form of propagation of chaos for McKean-Vlasov equations’

    Daniel Lacker. ‘On a strong form of propagation of chaos for McKean-Vlasov equations’. In:Electron. Commun. Probab. 23.none (2018), pp. 1–11.doi:10.1214/18-ECP150.url:https://doi.org/10.1214/18-ECP150

    work page doi:10.1214/18-ecp150.url:https://doi.org/10.1214/18-ecp150 2018

  31. [31]

    ‘An elementary approach to uniform in time propagation of chaos’

    Alain Durmus, Andreas Eberle, Arnaud Guillin and Raphael Zimmer. ‘An elementary approach to uniform in time propagation of chaos’. In:Proc. Amer. Math. Soc.148.12 (2020), pp. 5387–5398.issn: 0002-9939,1088-6826.doi:10. 1090/proc/14612.url:https://doi.org/10.1090/proc/14612

    work page doi:10.1090/proc/14612 2020

  32. [32]

    ‘Uniform in time propagation of chaos for the 2D vortex model and other singular stochastic systems’

    Arnaud Guillin, Pierre Le Bris and Pierre Monmarché. ‘Uniform in time propagation of chaos for the 2D vortex model and other singular stochastic systems’. In:J. Eur. Math. Soc.(2024)

    2024

  33. [33]

    In:Stoch

    AlainDurmus,AndreasEberle,ArnaudGuillinandKatharinaSchuh.‘StickynonlinearSDEsandconvergenceofMcKean- Vlasov equations without confinement’. In:Stoch. Partial Differ. Equ. Anal. Comput.12.3 (2024), pp. 1855–1906.issn: 2194-0401,2194-041X.doi:10.1007/s40072-023-00315-8.url:https://doi.org/10.1007/s40072-023-00315-8

    work page doi:10.1007/s40072-023-00315-8.url:https://doi.org/10.1007/s40072-023-00315-8 2024

  34. [34]

    ‘Sharp uniform-in-time propagation of chaos’

    Daniel Lacker and Luc Le Flem. ‘Sharp uniform-in-time propagation of chaos’. In:Probab. Theory Related Fields187.1-2 (2023), pp. 443–480.issn: 0178-8051,1432-2064.doi:10.1007/s00440- 023- 01192- x.url:https://doi.org/10.1007/ s00440-023-01192-x

    work page doi:10.1007/s00440- 2023

  35. [35]

    ‘Conditions for uniform in time convergence: applications to averaging, numerical discretisations and mean-field systems’

    Katharina Schuh and Iain Souttar. ‘Conditions for uniform in time convergence: applications to averaging, numerical discretisations and mean-field systems’. In:arXiv preprint2412.05239(2024)

    work page arXiv 2024

  36. [36]

    iv+141.isbn: 978-0-8218-4641-4.doi:10.1090/S0065-9266-09-00567-5

    CédricVillani.Hypocoercivity.volume202.MemoirsoftheAmericanMathematicalSociety950.Providence,RI:American Mathematical Society, 2009, pp. iv+141.isbn: 978-0-8218-4641-4.doi:10.1090/S0065-9266-09-00567-5

    work page doi:10.1090/s0065-9266-09-00567-5 2009

  37. [37]

    ‘Mean Field Limit for Stochastic Particle Systems’

    Pierre-Emmanuel Jabin and Zhenfu Wang. ‘Mean Field Limit for Stochastic Particle Systems’. In:Active Particles. Volume 1. Advances in Theory, Models, and Applications. Ed. by Nicola Bellomo, Pierre Degond and Eitan Tadmor. Modeling and Simulation in Science, Engineering and Technology. Cham: Birkhäuser/Springer, 2017, pp. 379–402.doi: 10.1007/978-3-319-49996-3_10

    work page doi:10.1007/978-3-319-49996-3_10 2017

  38. [38]

    ‘Mean field limit and propagation of chaos for Vlasov systems with bounded forces’

    Pierre-Emmanuel Jabin and Zhenfu Wang. ‘Mean field limit and propagation of chaos for Vlasov systems with bounded forces’. In:Journal of Functional Analysis271.12 (2016), pp. 3588–3627.issn: 0022-1236.doi:https://doi.org/10. 1016/j.jfa.2016.09.014.url:https://www.sciencedirect.com/science/article/pii/S0022123616302701

    2016

  39. [39]

    ‘Couplings and quantitative contraction rates for Langevin dy- namics’

    Andreas Eberle, Arnaud Guillin and Raphael Zimmer. ‘Couplings and quantitative contraction rates for Langevin dy- namics’. In:Annals of Probability47.4 (2019), pp. 1982–2010.doi:10.1214/18-AOP1299

    work page doi:10.1214/18-aop1299 2019

  40. [40]

    M2AN Math

    François Bolley, Arnaud Guillin and Florent Malrieu. ‘Trend to equilibrium and particle approximation for a weakly selfconsistent Vlasov-Fokker-Planck equation’. In:M2AN Math. Model. Numer. Anal.44.5 (2010), pp. 867–884.issn: 0764-583X,1290-3841.doi:10.1051/m2an/2010045.url:https://doi.org/10.1051/m2an/2010045

    work page doi:10.1051/m2an/2010045.url:https://doi.org/10.1051/m2an/2010045 2010

  41. [41]

    ‘Long-time behaviour and propagation of chaos for mean field kinetic particles’

    Pierre Monmarché. ‘Long-time behaviour and propagation of chaos for mean field kinetic particles’. In:Stochastic Process. Appl.127.6 (2017), pp. 1721–1737.issn: 0304-4149,1879-209X.doi:10.1016/j.spa.2016.10.003.url:https://doi. org/10.1016/j.spa.2016.10.003. 76

    work page doi:10.1016/j.spa.2016.10.003.url:https://doi 2017

  42. [42]

    ‘Hypocoercivity in metastable settings and kinetic simulated annealing’

    Pierre Monmarché. ‘Hypocoercivity in metastable settings and kinetic simulated annealing’. working paper or preprint. Feb. 2018.url:https://hal.science/hal-01716329

    2018

  43. [43]

    ‘Uniform long-time and propagation of chaos estimates for mean field kinetic particles in non-convex landscapes’

    Arnaud Guillin and Pierre Monmarché. ‘Uniform long-time and propagation of chaos estimates for mean field kinetic particles in non-convex landscapes’. In:J. Stat. Phys.185.2 (2021), Paper No. 15, 20.issn: 0022-4715,1572-9613.doi: 10.1007/s10955-021-02839-6.url:https://doi.org/10.1007/s10955-021-02839-6

    work page doi:10.1007/s10955-021-02839-6.url:https://doi.org/10.1007/s10955-021-02839-6 2021

  44. [44]

    ‘Emergent behavior in flocks’

    Felipe Cucker and Steve Smale. ‘Emergent behavior in flocks’. In:IEEE Transactions on automatic control52.5 (2007), pp. 852–862

    2007

  45. [45]

    ‘From particle to kinetic and hydrodynamic descriptions of flocking’

    Seung-Yeal Ha and Eitan Tadmor. ‘From particle to kinetic and hydrodynamic descriptions of flocking’. In:Kinet. Relat. Models1.3 (2008), pp. 415–435.issn: 1937-5093,1937-5077.doi:10.3934/krm.2008.1.415.url:https://doi.org/10. 3934/krm.2008.1.415

    work page doi:10.3934/krm.2008.1.415.url:https://doi.org/10 2008

  46. [46]

    ‘A simple proof of the Cucker-Smale flocking dynamics and mean-field limit’

    Seung-Yeal Ha and Jian-Guo Liu. ‘A simple proof of the Cucker-Smale flocking dynamics and mean-field limit’. In: Commun. Math. Sci.7.2 (2009), pp. 297–325.issn: 1539-6746,1945-0796.url:http://projecteuclid.org/euclid.cms/ 1243443982

    2009

  47. [47]

    J. A. Carrillo, M. Fornasier, J. Rosado and G. Toscani. ‘Asymptotic flocking dynamics for the kinetic Cucker-Smale model’. In:SIAM J. Math. Anal.42.1 (2010), pp. 218–236.issn: 0036-1410,1095-7154.doi:10.1137/090757290.url: https://doi.org/10.1137/090757290

    work page doi:10.1137/090757290.url: 2010

  48. [48]

    ‘Uniform stability of the Cucker-Smale model and its application to the mean-field limit’

    Seung-Yeal Ha, Jeongho Kim and Xiongtao Zhang. ‘Uniform stability of the Cucker-Smale model and its application to the mean-field limit’. In:Kinet. Relat. Models11.5 (2018), pp. 1157–1181.issn: 1937-5093,1937-5077.doi:10.3934/krm. 2018045.url:https://doi.org/10.3934/krm.2018045

    work page doi:10.3934/krm 2018

  49. [49]

    ‘On the mean field limit for Cucker-Smale models’

    Roberto Natalini and Thierry Paul. ‘On the mean field limit for Cucker-Smale models’. In:Discrete Contin. Dyn. Syst. Ser. B27.5 (2022), pp. 2873–2889.issn: 1531-3492,1553-524X.doi:10.3934/dcdsb.2021164.url:https://doi.org/ 10.3934/dcdsb.2021164

    work page doi:10.3934/dcdsb.2021164.url:https://doi.org/ 2022

  50. [50]

    ‘Uniform-in-time propagation of chaos for the Cucker–Smale model’

    Nicolai Jurek Gerber and Urbain Vaes. ‘Uniform-in-time propagation of chaos for the Cucker–Smale model’. In:Kinetic and Related Models(2025).issn: 1937-5093.doi:10.3934/krm.2025021.url:https://www.aimsciences.org/article/ id/68f2046550e6d258f0187826

    work page doi:10.3934/krm.2025021.url:https://www.aimsciences.org/article/ 2025

  51. [51]

    Young-Pil Choi, Seungchan Lee and Sihyun Song.A modified Consensus-Based Optimization model: consensus formation and uniform-in-time propagation of chaos. 2025. arXiv:2511.19116 [math.PR].url:https://arxiv.org/abs/2511. 19116

    work page arXiv 2025

  52. [52]

    U. Vaes. ‘Sharp propagation of chaos for the ensemble Langevin sampler’. In:J. London Math. Soc.110.5 (2024), e13008

    2024

  53. [53]

    ‘Sharp propagation of chaos for McKean–Vlasov equation with non constant diffusion coefficient’

    Jules Grass, Arnaud Guillin and Christophe Poquet. ‘Sharp propagation of chaos for McKean–Vlasov equation with non constant diffusion coefficient’. In:arXiv preprint2410.20874(2024). 77

    work page arXiv 2024