Pages that link to "Item:Q628311"
From MaRDI portal
The following pages link to A class of graph-geodetic distances generalizing the shortest-path and the resistance distances (Q628311):
Displaying 24 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)
- The walk distances in graphs (Q427888) (← links)
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification (Q448318) (← links)
- The graph bottleneck identity (Q719327) (← links)
- The Smith normal form of product distance matrices (Q908196) (← links)
- Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets (Q1619310) (← 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)
- A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution (Q2086590) (← links)
- Randomized shortest paths with net flows and capacity constraints (Q2127057) (← links)
- Metric and ultrametric inequalities for directed graphs (Q2127613) (← links)
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs (Q2163223) (← links)
- A bag-of-paths framework for network data analysis (Q2181053) (← links)
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic (Q2201378) (← links)
- Unsupervised representation learning with minimax distance measures (Q2217399) (← links)
- Learning representations from dendrograms (Q2217438) (← links)
- Similarities on graphs: kernels versus proximity measures (Q2311350) (← links)
- A recursion formula for resistance distances and its applications (Q2444563) (← links)
- Effective Resistance Preserving Directed Graph Symmetrization (Q4615300) (← links)
- Nonlocal pagerank (Q5006301) (← links)
- Refinement of Metrics: Erd\H{o}s Number, a Case Study (Q5241083) (← links)
- Resistance distance in connected balanced digraphs (Q6162026) (← links)