78 citations · 226 across the 13 of their papers we have counts for
4 papers · 1 filter
Maximum likelihood estimation for randomized shortest paths with trajectory data
Ilkka Kivimäki, Bram Van Moorter, Manuela Panzacchi +2
Randomized shortest paths (RSP) are a tool developed in recent years for different graph and network analysis applications, such as modelling movement or flow in networks. In essen…
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…
A Bag-of-Paths Node Criticality Measure
Bertrand Lebichot, Marco Saerens
This work compares several node (and network) criticality measures quantifying to which extend each node is critical with respect to the communication flow between nodes of the net…
Two betweenness centrality measures based on Randomized Shortest Paths
Ilkka Kivimäki, Bertrand Lebichot, Jari Saramäki +1
This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network c…