Related papers: Normal approximation of compound Hawkes functional…

We outline an efficient method for the reconstruction of a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtained resorting to maximum entropy technique, under the…

We study a Markov process with two components: the first component evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of the second component. The second…

This article presents a coupling approach for the approximation of iterated stochastic integrals of length three. The generation of such integrals is the central problem of higher-order pathwise approximations for SDEs, which still lacks a…

We consider the use of randomised forward models and log-likelihoods within the Bayesian approach to inverse problems. Such random approximations to the exact forward model or log-likelihood arise naturally when a computationally expensive…

Many data clustering applications must handle objects that cannot be represented as vectors. In this context, the bag-of-vectors representation describes complex objects through discrete distributions, for which the Wasserstein distance…

We provide some non asymptotic bounds, with explicit constants, that measure the rate of convergence, in expected Wasserstein distance, of the empirical measure associated to an i.i.d. $N$-sample of a given probability distribution on…

We establish quantitative convergence rates for stochastic particle approximation based on Nanbu-type Monte Carlo schemes applied to a broad class of collisional kinetic models. Using coupling techniques and stability estimates in the…

This paper investigates the asymptotic behavior of suitably time-modulated Hawkes processes with heavy-tailed kernels in a nearly unstable regime. We show that, under appropriate scaling, both the intensity processes and the rescaled Hawkes…

We give a number of results on approximations of Markov kernels in total variation and Wasserstein norms weighted by a Lyapunov function. The results are applied to examples from Bayesian statistics where approximations to transition…

We establish a general concentration result for the 1-Wasserstein distance between the empirical measure of a sequence of random variables and its expectation. Unlike standard results that rely on independence (e.g., Sanov's theorem) or…

We study the problem of sampling from a distribution $\target$ using the Langevin Monte Carlo algorithm and provide rate of convergences for this algorithm in terms of Wasserstein distance of order $2$. Our result holds as long as the…

Information is an inherent component of stochastic processes and to measure the distance between different stochastic processes it is not sufficient to consider the distance between their laws. Instead, the information which accumulates…

Hawkes processes are a class of point processes that have the ability to model the self- and mutual-exciting phenomena. Although the classic Hawkes processes cover a wide range of applications, their expressive ability is limited due to…

The celebrated results of Koml\'os, Major and Tusn\'ady [Z. Wahrsch. Verw. Gebiete 32 (1975) 111-131; Z. Wahrsch. Verw. Gebiete 34 (1976) 33-58] give optimal Wiener approximation for the partial sums of i.i.d. random variables and provide a…

We propose a novel fused Gromov-Wasserstein alignment method to jointly learn the Hawkes processes in different event spaces, and align their event types. Given two Hawkes processes, we use fused Gromov-Wasserstein discrepancy to measure…

Wasserstein gradient and Hamiltonian flows have emerged as essential tools for modeling complex dynamics in the natural sciences, with applications ranging from partial differential equations (PDEs) and optimal transport to quantum…

We give a polynomial-time algorithm to sample from the Gibbs measure of the Sherrington-Kirkpatrick model with negligible total-variation distance (TVD) error up to inverse temperature $\beta < 1/2$. Prior work obtained TVD error guarantees…

The Wasserstein distance is a distance between two probability distributions and has recently gained increasing popularity in statistics and machine learning, owing to its attractive properties. One important approach to extending this…

A new method called "variational sampling" is proposed to estimate integrals under probability distributions that can be evaluated up to a normalizing constant. The key idea is to fit the target distribution with an exponential family model…

Causal optimal transport and adapted Wasserstein distance have applications in different fields from optimization to mathematical finance and machine learning. The goal of this article is to provide equivalent formulations of these concepts…