Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets

DOI10.1016/j.physa.2015.12.117zbMath1400.49053OpenAlexW2234188328MaRDI QIDQ1619310

Guillaume Guex

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2015.12.117

zbMATH Keywords

random walksfunctional minimizationoptimal transportation problemmultiple sources and targets

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Variational problems in a geometric measure-theoretic setting (49Q20) Transport processes in time-dependent statistical mechanics (82C70) Random walks on graphs (05C81)

Related Items (3)

Randomized shortest paths with net flows and capacity constraints ⋮ A bag-of-paths framework for network data analysis ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization

Uses Software

• igraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• The auction algorithm: A distributed relaxation method for the assignment problem
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• The generalised inverse
• Randomized Shortest-Path Problems: Two Related Models
• Excessive functions of continuous time Markov chains

This page was built for publication: Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets