Related papers: Mean field error estimate of the random batch meth…
We propose a new algorithm for approximating the non-asymptotic second moment of the marginal likelihood estimate, or normalizing constant, provided by a particle filter. The computational cost of the new method is $O(M)$ per time step,…
Considering well localized atom, the mean field theory (MFT) was applied to replace the operators by equivalent expectation values. The Rabi model was reduced to a fourth orders NDE describing atoms position. Solution by the harmonic…
Mean field approximation is a powerful technique to study the performance of large stochastic systems represented as $n$ interacting objects. Applications include load balancing models, epidemic spreading, cache replacement policies, or…
Fokker-Planck equations are extensively employed in various scientific fields as they characterise the behaviour of stochastic systems at the level of probability density functions. Although broadly used, they allow for analytical treatment…
In this paper, we present a numerical approach to solve the McKean-Vlasov equations, which are distribution-dependent stochastic differential equations, under some non-globally Lipschitz conditions for both the drift and diffusion…
The simulation of complex systems, such as gas transport in large pipeline networks, often involves solving PDEs posed on intricate graph structures. Such problems require considerable computational and memory resources. The Random Batch…
We consider a system of particles experiencing diffusion and mean field interaction, and study its behaviour when the number of particles goes to infinity. We derive non-asymptotic large deviation bounds measuring the concentration of the…
We develop the generalized method of moments (GMM) estimation for the parameters of the finitely mixed multi-mixed fractional Ornstein--Uhlenbeck (mmfOU) processes, and analyze the consistency and asymptotic normality of this estimator. We…
We consider the problem of estimating the state of a large but finite number $N$ of identical quantum systems. In the limit of large $N$ the problem simplifies. In particular the only relevant measure of the quality of the estimation is the…
Randomized benchmarking (RB) is a widely used strategy to assess the quality of available quantum gates in a computational context. RB involves applying known random sequences of gates to an initial state and using the statistics of a final…
Randomized benchmarking (RB) is a widely used method for estimating the average fidelity of gates implemented on a quantum computing device. The stochastic error of the average gate fidelity estimated by RB depends on the sampling strategy…
We propose a fast potential splitting Markov Chain Monte Carlo method which costs $O(1)$ time each step for sampling from equilibrium distributions (Gibbs measures) corresponding to particle systems with singular interacting kernels. We…
We investigate propagation of chaos for mean field Markov Decision Process with common noise (CMKV-MDP), and when the optimization is performed over randomized open-loop controls on infinite horizon. We first state a rate of convergence of…
We study numerical methods for solving a system of quasilinear stochastic partial differential equations known as the stochastic Landau-Lifshitz-Bloch (LLB) equation on a bounded domain in $\mathbb R^d$ for $d=1,2$. Our main results are…
In the mean field integrate-and-fire model, the dynamics of a typical neuron within a large network is modeled as a diffusion-jump stochastic process whose jump takes place once the voltage reaches a threshold. In this work, the main goal…
In the mean field integrate-and-fire model, the dynamics of a typical neuron within a large network is modeled as a diffusion-jump stochastic process whose jump takes place once the voltage reaches a threshold. In this work, the main goal…
We consider a class of weakly interacting particle systems of mean-field type. The interactions between the particles are encoded in a graph sequence, i.e., two particles are interacting if and only if they are connected in the underlying…
We study the rate of convergence w.r.t.~a Wasserstein type distance for random walk approximations of mean field BSDEs. Our method does not use the particle method but instead a freezing technique. We extend results by Briand, Ch. Geiss, S.…
We study the mean field Schr\"odinger problem (MFSP), that is the problem of finding the most likely evolution of a cloud of interacting Brownian particles conditionally on the observation of their initial and final configuration. Its…
Mean-Field is an efficient way to approximate a posterior distribution in complex graphical models and constitutes the most popular class of Bayesian variational approximation methods. In most applications, the mean field distribution…