78 citations · 125 across the 8 of their papers we have counts for
8 papers
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…
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…
A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data
Talayeh Aledavood, Ilkka Kivimäki, Sune Lehmann +1
Human activities follow daily, weekly, and seasonal rhythms. The emergence of these rhythms is related to physiology and natural cycles as well as social constructs. The human body…
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…
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…
A bag-of-paths framework for network data analysis
Kevin Françoisse, Ilkka Kivimäki, Amin Mantrach +2
This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of al…
Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness
Bertrand Lebichot, Ilkka Kivimäki, Kevin Françoisse +1
This paper introduces a novel, well-founded, betweenness measure, called the Bag-of-Paths (BoP) betweenness, as well as its extension, the BoP group betweenness, to tackle semisupe…