We study the geometric ergodicity and the long time behavior of the Random Batch Method for interacting particle systems, which exhibits superior numerical performance in recent large-scale scientific computing experiments. We show that for both the interacting particle system (IPS) and the random batch interacting particle system (RB-IPS), the distribution laws converge to their respective invariant distributions exponentially, and the convergence rate does not depend on the number of particles $N$, the time step $\tau$ for batch divisions or the batch size $p$. Moreover, the Wasserstein distance between the invariant distributions of the IPS and the RB-IPS is bounded by $O(\sqrt{\tau})$, showing that the RB-IPS can be used to sample the i...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
We introduce a general form of sequential Monte Carlo algorithm defined in terms of a pa-rameterized...
This thesis concerns interacting particle systems in a randomly evolving environment. In the first p...
(Communicated by George Papanicolaou) Abstract. We study an interacting particle system whose dynami...
Limit theorems are ubiquitous in probability theory. The present work samples contributionsof the au...
This thesis concerns interacting particle systems in a randomly evolving environment. In the first p...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
We analyse certain conservative interacting particle system and establish ergodicity of the system f...
The non linear filtering problem consists in computing the conditional distributions of a Markov sig...
We analyse certain conservative interacting particle system and establish ergodicity of the system f...
Abstract. The particle Gibbs sampler is a Markov chain Monte Carlo (MCMC) algorithm which operates o...
International audienceThe convergence of U-statistics has been intensively studied for estimators ba...
International audienceThe convergence of U-statistics has been intensively studied for estimators ba...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
We introduce a general form of sequential Monte Carlo algorithm defined in terms of a pa-rameterized...
This thesis concerns interacting particle systems in a randomly evolving environment. In the first p...
(Communicated by George Papanicolaou) Abstract. We study an interacting particle system whose dynami...
Limit theorems are ubiquitous in probability theory. The present work samples contributionsof the au...
This thesis concerns interacting particle systems in a randomly evolving environment. In the first p...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
We analyse certain conservative interacting particle system and establish ergodicity of the system f...
The non linear filtering problem consists in computing the conditional distributions of a Markov sig...
We analyse certain conservative interacting particle system and establish ergodicity of the system f...
Abstract. The particle Gibbs sampler is a Markov chain Monte Carlo (MCMC) algorithm which operates o...
International audienceThe convergence of U-statistics has been intensively studied for estimators ba...
International audienceThe convergence of U-statistics has been intensively studied for estimators ba...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
The convergence of U-statistics has been intensively studied for estimators based on families of i.i...
We introduce a general form of sequential Monte Carlo algorithm defined in terms of a pa-rameterized...