78 citations · 125 across the 8 of their papers we have counts for
3 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…
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…