Developments in the theory of randomized shortest paths with a comparison of graph node distances

DOI10.1016/j.physa.2013.09.016zbMath1395.05153arXiv1212.1666MaRDI QIDQ1782487

Masashi Shimbo, Ilkka Kivimäki, Marco Saerens

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.1666

zbMATH Keywords

clustering; free energy; shortest path distance; commute time and resistance distance; graph node distances; randomized shortest paths

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

Related Items

Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets, Sparse randomized shortest paths routing with Tsallis divergence regularization, A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution, Dissecting graph measure performance for node clustering in LFR parameter space, Randomized shortest paths with net flows and capacity constraints, A bag-of-paths framework for network data analysis, Similarities on graphs: kernels versus proximity measures, Design of biased random walks on a graph with application to collaborative recommendation

Uses Software

• NetKit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The communicability distance in graphs
• The walk distances in graphs
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Statistical analysis of network data. Methods and models
• Metric and Euclidean properties of dissimilarity coefficients
• Distances and volumina for graphs
• Random walks on graphs
• The matrix-forest theorem and measuring relations in small social groups
• Modern multidimensional scaling: theory and applications
• The electrical resistance of a graph captures its commute and cover times
• Explaining all three-alternative voting outcomes
• Introduction to Semi-Supervised Learning
• 10.1162/153244303321897735
• Randomized Shortest-Path Problems: Two Related Models
• Machine Learning: ECML 2004
• Networks
• Network Science