Robust Transport Over Networks

DOI10.1109/TAC.2016.2626796zbMath1390.90058arXiv1603.08129OpenAlexW2963143751WikidataQ47661320 ScholiaQ47661320MaRDI QIDQ4566839

Yongxin Chen, Allen Tannenbaum, Michele Pavon, Tryphon T. Georgiou

Publication date: 27 June 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (6)

Design of biased random walks on a graph with application to collaborative recommendation ⋮ Wasserstein Geometry of Quantum States and Optimal Transport of Matrix-Valued Measures ⋮ What is a stochastic Hamiltonian process on finite graph? An optimal transport answer ⋮ Stochastic Control Liaisons: Richard Sinkhorn Meets Gaspard Monge on a Schrödinger Bridge ⋮ Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem ⋮ Fast and asymptotic steering to a steady state for networks flows

This page was built for publication: Robust Transport Over Networks