Maximum likelihood estimation for randomized shortest paths with trajectory data. (18th November 2020)

• Record Type: Journal Article
• Authors: Kivimäki, Ilkka; Van Moorter, Bram; Panzacchi, Manuela; Saramäki, Jari; Saerens, Marco
• Editors: Estrada, Ernesto
• Is Part Of: Journal of complex networks. Volume 8:Number 4(2020)
• Publication Date: 2020-11-18
• Subjects: randomized shortest paths -- random walk -- shortest path -- parameter estimation -- maximum likelihood -- animal movement modelling; Numerical analysis -- Periodicals; Computer networks -- Periodicals; Social networks -- Periodicals; 518.05
• DOI: 10.1093/comnet/cnaa024
• Languages: English
• ISSNs: 2051-1310

Abstract

Abstract: Randomized shortest paths (RSPs) are tool developed in recent years for different graph and network analysis applications, such as modelling movement or flow in networks. In essence, the RSP framework considers the temperature-dependent Gibbs–Boltzmann distribution over paths in the network. At low temperatures, the distribution focuses solely on the shortest or least-cost paths, while with increasing temperature, the distribution spreads over random walks on the network. Many relevant quantities can be computed conveniently from this distribution, and these often generalize traditional network measures in a sensible way. However, when modelling real phenomena with RSPs, one needs a principled way of estimating the parameters from data. In this work, we develop methods for computing the maximum likelihood estimate of the model parameters, with focus on the temperature parameter, when modelling phenomena based on movement, flow or spreading processes. We test the validity of the derived methods with trajectories generated on artificial networks as well as with real data on the movement of wild reindeer in a geographic landscape, used for estimating the degree of randomness in the movement of the animals. These examples demonstrate the attractiveness of the RSP framework as a generic model to be used in diverse applications.