Geometric Convergence and Concentration Inequalities for the Feynman–Kac Genetic Algorithm
From MaRDI portal
Publication:6489106
DOI10.1007/S11464-022-0089-ZMaRDI QIDQ6489106
Publication date: 19 April 2024
Published in: Frontiers of Mathematics (Search for Journal in Brave)
Inequalities; stochastic orderings (60E15) Problems related to evolution (92D15) Functional inequalities, including subadditivity, convexity, etc. (39B62)
Cites Work
- Unnamed Item
- Concentration inequalities for mean field particle models
- Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
- Genealogies and increasing propagation of chaos for Feynman-Kac and genetic models.
- Transportation cost-information inequalities and applications to random dynamical systems and diffusions.
- On the Concentration Properties of Interacting Particle Processes
- Moderate deviations for interacting processes
- Particle methods: An introduction with applications
- Particle approximations of Lyapunov exponents connected to Schrödinger operators and Feynman–Kac semigroups
- Transport Inequalities. A Survey
This page was built for publication: Geometric Convergence and Concentration Inequalities for the Feynman–Kac Genetic Algorithm