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

DOI10.1016/J.PHYSA.2015.12.117MaRDI QIDQ1619310zbMATH OpenOpenAlexFDO

Authors 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

functional minimizationmultiple sources and targetsoptimal transportation problemrandom walks

Mathematics Subject Classification ID

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

Recommendations

• Randomized shortest paths with net flows and capacity constraints
• Transport between multiple users in complex networks
• Lazy random walks and optimal transport on graphs
• Optimal transportation networks. Models and theory
• scientific article; zbMATH DE number 4057261

Cites work

• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• Excessive functions of continuous time Markov chains
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 1240224 (Why is no real title available?)
• scientific article; zbMATH DE number 1909499 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3099866 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• Randomized Shortest-Path Problems: Two Related Models
• The auction algorithm: A distributed relaxation method for the assignment problem
• The generalised inverse

Cited in

(3)

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

Describes a project that uses

Uses Software

• igraph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1619310)