1 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison
Sylvain Courtain, Guillaume Guex, Ilkka Kivimaki +1
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest p…
Randomized Shortest Paths with Net Flows and Capacity Constraints
Sylvain Courtain, Pierre Leleux, Ilkka Kivimaki +2
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement…
A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Bertrand Lebichot, Guillaume Guex, Ilkka Kivimäki +1
The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions. First, it sho…
The Sum-over-Forests density index: identifying dense regions in a graph
Mathieu Senelle, Silvia Garcia-Diez, Amin Mantrach +3
This work introduces a novel nonparametric density index defined on graphs, the Sum-over-Forests (SoF) density index. It is based on a clear and intuitive idea: high-density region…