Lazy random walks and optimal transport on graphs
From MaRDI portal
(Redirected from Publication:726796)
optimal transport\(\Gamma\)-convergencerandom walksentropy minimizationdiscrete metric graphdisplacement interpolationSchrödinger problem
Numerical optimization and variational techniques (65K10) Variational problems in a geometric measure-theoretic setting (49Q20) Sums of independent random variables; random walks (60G50) Methods involving semicontinuity and convergence; relaxation (49J45) Continuous-time Markov processes on discrete state spaces (60J27)
Abstract: This paper is about the construction of displacement interpolations on a discrete metric graph. Our approach is based on the approximation of any optimal transport problem whose cost function is a distance on a discrete graph by a sequence of Schr"odinger problems associated with random walks whose jump frequencies tend down to zero. Displacement interpolations are defined as the limit of the time-marginal flows of the solutions to the Schr"odinger problems. This allows to work with these interpolations by doing stochastic calculus on the approximating random walks which are regular objects, and then to pass to the limit in a slowing down procedure. The main convergence results are based on Gamma-convergence of entropy minimization problems. As a by-product, we obtain new results about optimal transport on graphs.
Recommendations
- A transport process on graphs and its limiting distributions
- Random walks on graphs and approximation of \(L^2\)-invariants
- Random walks on dense graphs and graphons
- Optimal Transport on Networks
- scientific article; zbMATH DE number 1552103
- Random walks on graphs: ideas, techniques and results
- Optimal transport between random measures
- Optimal mass transport on metric graphs
- scientific article; zbMATH DE number 946659
Cites work
- scientific article; zbMATH DE number 436378 (Why is no real title available?)
- scientific article; zbMATH DE number 3636997 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1975241 (Why is no real title available?)
- scientific article; zbMATH DE number 1984440 (Why is no real title available?)
- scientific article; zbMATH DE number 3001084 (Why is no real title available?)
- scientific article; zbMATH DE number 3005682 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A Riemannian interpolation inequality à la Borell, Brascamp and Lieb
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A convexity principle for interacting gases
- A curved Brunn-Minkowski inequality on the discrete hypercube, or: what is the Ricci curvature of the discrete hypercube?
- A gradient structure for reaction–diffusion systems and for energy-drift-diffusion systems
- A survey of the Schrödinger problem and some of its connections with optimal transport
- An introduction to -convergence
- Asymptotic development by \(\Gamma{}\)-convergence
- Concavity of entropy along binomial convolutions
- Constructing optimal maps for Monge's transport problem as a limit of strictly convex costs
- Contraction of measures on graphs
- Differential equations methods for the Monge-Kantorovich mass transfer problem
- Displacement convexity of entropy and related inequalities on graphs
- Existence of optimal transport maps for crystalline norms
- From the Schrödinger problem to the Monge-Kantorovich problem
- Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality
- Girsanov theory under a finite entropy condition
- Gradient flows of the entropy for finite Markov chains
- Log-concavity and the maximum entropy property of the Poisson distribution
- Mass transportation and rough curvature bounds for discrete spaces
- On the geometry of metric measure spaces. I
- On the geometry of metric measure spaces. II
- Optimal Transport
- Reciprocal processes. A measure-theoretical point of view
- Ricci curvature for metric-measure spaces via optimal transport
- Ricci curvature of Markov chains on metric spaces
- Ricci curvature of finite Markov chains via convexity of the entropy
- Some properties of path measures
- The Monge problem in R^d
- Transport inequalities, gradient estimates, entropy and Ricci curvature
- Viscosity Solutions of Minimization Problems
Cited in
(23)- Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport
- The Most Likely Evolution of Diffusing and Vanishing Particles: Schrödinger Bridges with Unbalanced Marginals
- Some recent developments in functional inequalities
- A transport process on graphs and its limiting distributions
- Absolutely continuous and BV-curves in 1-Wasserstein spaces
- Homogenisation of dynamical optimal transport on periodic graphs
- Schrödinger dynamics and optimal transport of measures
- Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets
- Lazy random walks on pseudofractal scale-free web with a perfect trap
- Optimal control for diffusions on graphs
- Dynamical Schrödinger bridge problems on graphs
- Vector-valued optimal mass transport
- Nonexponential Sanov and Schilder theorems on Wiener space: BSDEs, Schrödinger problems and control
- A survey of the Schrödinger problem and some of its connections with optimal transport
- Entropic Ricci curvature for discrete spaces
- A second order equation for Schrödinger bridges with applications to the hot gas experiment and entropic transportation cost
- The Markov-quantile process attached to a family of marginals
- Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
- Propagation of chaos for mean field Schrödinger problems
- \(W_{1,+}\)-interpolation of probability measures on graphs
- Entropic curvature on graphs along Schrödinger bridges at zero temperature
- What is a stochastic Hamiltonian process on finite graph? An optimal transport answer
- Interpolation of probability measures on graphs
This page was built for publication: Lazy random walks and optimal transport on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726796)