Asymptotics of discrete Schrödinger bridges via chaos decomposition
From MaRDI portal
(Redirected from Asymptotics of discrete Schrödinger bridges via chaos decomposition)
Recommendations
- From the Schrödinger problem to the Monge-Kantorovich problem
- An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm
- Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
- A survey of the Schrödinger problem and some of its connections with optimal transport
- On the relation between optimal transport and Schrödinger bridges: a stochastic control viewpoint
Cites work
- A Class of Statistics with Asymptotically Normal Distribution
- A survey of the Schrödinger problem and some of its connections with optimal transport
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Approximation theorems for random permanents and associated stochastic processes
- Asymptotic behaviour of symmetric polynomial statistics
- Asymptotic Feynman-Kac formulae for large symmetrised systems of random walks
- Asymptotic Statistics
- Asymptotics for L₂ functionals of the empirical quantile process, with applications to tests of fit based on weighted Wasserstein distances
- Asymptotics for transportation cost in high dimensions
- Atomic Theory of the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>λ</mml:mi></mml:math>Transition in Helium
- Central limit theorems for empirical transportation cost in general dimension
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Central limit theorems for the Wasserstein distance between the empirical and the true distributions
- Classes of linear operators. Vol. I
- Cones and gauges in complex spaces: spectral gaps and complex Perron-Frobenius theory
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
- Efficient and adaptive estimation for semiparametric models
- Elementary symmetric polynomials of increasing order
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- Empirical regularized optimal transport: statistical theory and applications
- Entropic optimal transport is maximum-likelihood deconvolution
- Estimation in exponential families on permutations
- From the Schrödinger problem to the Monge-Kantorovich problem
- scientific article; zbMATH DE number 3135192 (Why is no real title available?)
- scientific article; zbMATH DE number 4080537 (Why is no real title available?)
- scientific article; zbMATH DE number 3005682 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- I-divergence geometry of probability distributions and minimization problems
- Inference for empirical Wasserstein distances on finite spaces
- Large deviations for many Brownian bridges with symmetrised initial-terminal condition
- Large deviations for symmetrised empirical measures
- Large deviations for trapped interacting Brownian particles and paths
- Limit laws for empirical optimal solutions in random linear programs
- Limit laws of the empirical Wasserstein distance: Gaussian distributions
- Limiting behavior of random permanents
- Logarithmic combinatorial structures: A probabilistic approach
- Matching random samples in many dimensions
- Monge's problem with a quadratic cost by the zero-noise limit of \(h\)-path processes
- Multiplicative Schrödinger problem and the Dirichlet transport
- NON-NULL RANKING MODELS. I
- Nonparametric Validation of Similar Distributions and Assessment of Goodness of Fit
- Note on the Schrödinger equation and \(I\)-projections
- On optimal matchings
- On the elementary symmetric polynomials of independent random variables
- On the rate of convergence in Wasserstein distance of the empirical measure
- On the weak limits of elementary symmetric polynomials
- Permutations with fixed pattern densities
- Regularized discrete optimal transport
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Some Hermite polynomial identities and their combinatorics
- Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
- Symmetric statistics, Poisson point processes, and multiple Wiener integrals
- The invisible hand algorithm: solving the assignment problem with statistical physics
- The limit behavior of elementary symmetric polynomials of i. i. d. random variables when their order tends to infinity
- The Theory of Unbiased Estimation
This page was built for publication: Asymptotics of discrete Schrödinger bridges via chaos decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565309)
