13 citations · 33 across the 7 of their papers we have counts for
7 papers
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…
Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
Pierre Leleux, Sylvain Courtain, Guillaume Guex +1
This work elaborates on the important problem of (1) designing optimal randomized routing policies for reaching a target node t from a source note s on a weighted directed graph G…
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…
Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism
Guillaume Guex, Sylvain Courtain, Marco Saerens
This work derives closed-form expressions computing the expectation of co-presence and of number of co-occurrences of nodes on paths sampled from a network according to general pat…
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…
Randomized Optimal Transport on a Graph: framework and new distance measures
Guillaume Guex, Ilkka Kivimäki, Marco Saerens
The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distribution on all feasible paths of a graph. This probability distribution favors short…
Interpolating between Random Walks and Shortest Paths: a Path Functional Approach
François Bavaud, Guillaume Guex
General models of network navigation must contain a deterministic or drift component, encouraging the agent to follow routes of least cost, as well as a random or diffusive compone…