Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.11330

Exact Simulation of Multivariate Diffusions and Bridges

Jose Blanchet·Jikai Jin·Hao Liu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We provide the first generic exact sampling algorithms with finite expected total cost for uniformly elliptic multivariate diffusions and the corresponding diffusion bridges with bounded coefficients and bounded continuous first derivatives. We formulate a computational cost model that counts work in terms of generation of Gaussian and uniform random variables to execute acceptance--rejection sampling, as well as function evaluations of the drift and diffusion coefficients, together with elementary operations such as sums and multiplications. Our constructions combine randomized parametrix expansions with a finite weighted graph that incorporates both bridge endpoints into the proposal. The exact sampling of the diffusion is minimax optimal jointly in the horizon and number of requested observations, while bridge sampling is minimax optimal in the number of observations for fixed horizon and endpoints.

Explore related subjects

math.PRstat.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jose Blanchet, Jikai Jin, Hao Liu. 2026-10-08. Exact Simulation of Multivariate Diffusions and Bridges. https://arxiv.org/abs/2610.11330

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph

We study pairwise negative correlation for three families of uniform spanning-subgraph measures on the complete graph. In Part~I, we consider the uniform probability measure on connected spanning subgraphs and prove pairwise negative correlation for all sufficiently large complete graphs. In Part~II, we study the uniform measure on spanning forests with a prescribed number of connected components and prove pairwise negative correlation for every fixed number of components when the number of vertices is sufficiently large. In Part~III, we consider connected spanning subgraphs with prescribed excess and establish the analogous result for every fixed excess. The three parts are self-contained and are intended as separate manuscripts.

math.PR↗
arXiv2026

Naturality characterizes product measures and relative product measures

We show that the formation of the product measure is the only natural way to assign to each tuple of probability measures on measurable spaces a probability measure on the product space. Here, naturality is meant in the sense of category theory and amounts to the condition that the assignment commutes with pushforward along measurable maps. In the standard Borel setting, we also prove an analogous result for relative products over a fixed base probability space. As a corollary, we conclude that the formation of relative products is a lax symmetric monoidal functor.

math.PR↗
arXiv2026

A Dimension-Free Bound on the Poincaré Constant of Isotropic Log-Concave Measures

The Kannan--Lovász--Simonovits (KLS) conjecture asserts that isotropic log-concave probability measures have Poincaré constants bounded by a universal constant, independently of dimension. We give a deterministic variational proof with an explicit bound on the Poincaré constant $C_P(μ)\le25$, where $μ$ is any isotropic log-concave probability measure. Starting from elliptic moment estimates and a quadratic variance inequality, we establish geometric bounds on normalized Appell coefficient norms through \emph{joint} maximization over the measure and test function. Variation of the measure gives a maximum-principle inequality, while stationarity in the test function controls the highest-order cumulant terms. Two concave barriers constructed from quadratic and cubic polynomials close the induction. A weighted Helmholtz--Hodge decomposition then controls the curl correction of weighted divergence, yielding a curvature estimate for compatible symmetric tensor fields that is uniform in rank. Quadratic duality converts this estimate into an operator comparison for centered integration, linking the coefficient bounds to control of the inverse gradient. A spectral-radius estimate and a scalar growth inequality for adjoint iterates then yield the Poincaré bound. The final estimate is independent of the auxiliary positive curvature, allowing approximation to complete the proof for general isotropic log-concave measures.

math.PR↗