Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization

no code implementations • 1 Jul 2020 • Pierre Leleux, Sylvain Courtain, Guillaume Guex, Marco Saerens

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 and (2) defining distance measures between nodes interpolating between the least cost (based on optimal movements) and the commute-cost (based on a random walk on G), depending on a temperature parameter T. To this end, the randomized shortest path formalism (RSP, [2, 99, 124]) is rephrased in terms of Tsallis divergence regularization, instead of Kullback-Leibler divergence.

Clustering Node Clustering

Randomized Shortest Paths with Net Flows and Capacity Constraints

no code implementations • 4 Oct 2019 • Sylvain Courtain, Pierre Leleux, Ilkka Kivimaki, Guillaume Guex, Marco Saerens

The framework assumes a unit flow injected into a source node and collected from a target node with flows minimizing the expected transportation cost, together with a relative entropy regularization term.

Clustering Node Clustering