Lazy random walks and optimal transport on graphs

DOI10.1214/15-AOP1012zbMath1397.60109arXiv1308.0226MaRDI QIDQ726796

Christian Léonard

Publication date: 14 July 2016

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.0226

zbMATH Keywords

random walks; \(\Gamma\)-convergence; optimal transport; Schrödinger problem; entropy minimization; discrete metric graph; displacement interpolation

Mathematics Subject Classification ID

60G50: Sums of independent random variables; random walks

65K10: Numerical optimization and variational techniques

49Q20: Variational problems in a geometric measure-theoretic setting

49J45: Methods involving semicontinuity and convergence; relaxation

60J27: Continuous-time Markov processes on discrete state spaces

Related Items

A survey of the Schrödinger problem and some of its connections with optimal transport