A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution

DOI10.1007/978-3-030-93409-5_19OpenAlexW4206359427MaRDI QIDQ2086590

Sylvain Courtain, Marco Saerens

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93409-5_19

zbMATH Keywords

link analysisdistances between nodesbag-of-paths modelnetwork sciences

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Distance in graphs (05C12) Computational aspects of data analysis and big data (68T09)

Uses Software

• UCI-ml
• LIBSVM
• NetKit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• The matrix-forest theorem and measuring relations in small social groups
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• Sparse randomized shortest paths routing with Tsallis divergence regularization
• Randomized shortest paths with net flows and capacity constraints
• A bag-of-paths framework for network data analysis
• Modern multidimensional scaling. Theory and applications.
• Design of biased random walks on a graph with application to collaborative recommendation
• Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?
• Covariance and correlation measures on a graph in a generalized bag-of-paths formalism
• Randomized Shortest-Path Problems: Two Related Models