Related papers: A transfer principle for computing the adapted Was…
Averaging is an important method to extract effective macroscopic dynamics from complex systems with slow modes and fast modes. This article derives an averaged equation for a class of stochastic partial differential equations without any…
We present a novel approach to approximate Gaussian and mixture-of-Gaussians filtering. Our method relies on a variational approximation via a gradient-flow representation. The gradient flow is derived from a Kullback--Leibler discrepancy…
Optimal transport theory has recently been extended to quantum settings, where the density matrices generalize the probability measures. In this paper, we study the computational aspects of the order 2 quantum Wasserstein distance,…
Due to their conjugate posteriors, Gaussian process priors are attractive for estimating the drift of stochastic differential equations with continuous time observations. However, their performance strongly depends on the choice of the…
Using the concept of self-decomposable subordinators introduced in Gardini et al. [11], we build a new bivariate Normal Inverse Gaussian process that can capture stochastic delays. In addition, we also develop a novel path simulation scheme…
We introduce the concept of numerical Gaussian processes, which we define as Gaussian processes with covariance functions resulting from temporal discretization of time-dependent partial differential equations. Numerical Gaussian processes,…
Wasserstein Barycenter is a principled approach to represent the weighted mean of a given set of probability distributions, utilizing the geometry induced by optimal transport. In this work, we present a novel scalable algorithm to…
We develop a variant of Stein's method of comparison of generators to bound the Kolmogorov, total variation, and Wasserstein-1 distances between distributions on the real line. Our discrepancy is expressed in terms of the ratio of reverse…
Distance measures between graphs are important primitives for a variety of learning tasks. In this work, we describe an unsupervised, optimal transport based approach to define a distance between graphs. Our idea is to derive…
A stochastic theory for the toppling activity in sandpile models is developed, based on a simple mean-field assumption about the toppling process. The theory describes the process as an anti-persistent Gaussian walk, where the diffusion…
A continuous time mixed state branching process is constructed as the scaling limits of two-type Galton-Watson processes. The process can also be obtained by the pathwise unique solution to a stochastic equation system. From the stochastic…
We study the average $p-$Wasserstein distance between a finite sample of an infinite hyperuniform point process on $\mathbb{R}^2$ and its mean for any $p\geq 1$. The average Wasserstein transport cost is shown to be bounded from above and…
This article proposes a method to consistently estimate functionals $\frac1p\sum_{i=1}^pf(\lambda_i(C_1C_2))$ of the eigenvalues of the product of two covariance matrices $C_1,C_2\in\mathbb{R}^{p\times p}$ based on the empirical estimates…
The Bayesian smoothing equations are generally intractable for systems described by nonlinear stochastic differential equations and discrete-time measurements. Gaussian approximations are a computationally efficient way to approximate the…
The adapted Wasserstein ($AW$) distance refines the classical Wasserstein ($W$) distance by incorporating the temporal structure of stochastic processes. This makes the $AW$-distance well-suited as a robust distance for many dynamic…
This paper calculates transient distributions of a special class of Markov processes with continuous state space and in continuous time, up to an explicit error bound. We approximate specific queues on R with one-sided L\'evy input, such as…
Various approaches to stochastic processes exist, noting that key properties such as measurability and continuity are not trivially satisfied. We introduce a new theory for Gaussian processes using improper linear functionals. Using a…
Obtaining a reduced description with particle and momentum flux densities outgoing from the microscopic equations of motion of the particles requires approximations. The usual method, we refer to as truncation method, is to zero Fourier…
We prove a bound for the Wasserstein distance between vectors of smooth complex random variables and complex Gaussians in the framework of complex Markov diffusion generators. For the special case of chaotic eigenfunctions, this bound can…
We consider a reflected Ornstein-Uhlenbeck process $X$ driven by a fractional Brownian motion with Hurst parameter $H\in (0, \frac12) \cup (\frac12, 1)$. Our goal is to estimate an unknown drift parameter $\alpha\in (-\infty,\infty)$ on the…