The following pages link to The walk distances in graphs (Q427888):
Displaying 11 items.
- Simple expressions for the long walk distance (Q389550) (← links)
- Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
- The communicability distance in graphs (Q414715) (← links)
- Measuring centrality by a generalization of degree (Q1642790) (← links)
- Developments in the theory of randomized shortest paths with a comparison of graph node distances (Q1782487) (← links)
- Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) (← links)
- Randomized shortest paths with net flows and capacity constraints (Q2127057) (← links)
- A bag-of-paths framework for network data analysis (Q2181053) (← links)
- Similarities on graphs: kernels versus proximity measures (Q2311350) (← links)
- A graph interpretation of the least squares ranking method (Q2340263) (← links)
- Matrix functions in network analysis (Q6068264) (← links)
