ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1511.00573
  4. Cited By
From random walks to distances on unweighted graphs

From random walks to distances on unweighted graphs

2 November 2015
Tatsunori B. Hashimoto
Yi Sun
Tommi Jaakkola
ArXivPDFHTML

Papers citing "From random walks to distances on unweighted graphs"

6 / 6 papers shown
Title
Metric recovery from directed unweighted graphs
Metric recovery from directed unweighted graphs
Tatsunori B. Hashimoto
Yi Sun
Tommi Jaakkola
52
21
0
20 Nov 2014
Network Detection Theory and Performance
Network Detection Theory and Performance
S. Smith
K. Senne
S. Philips
E. Kao
G. Bernstein
66
22
0
22 Mar 2013
A bag-of-paths framework for network data analysis
A bag-of-paths framework for network data analysis
Kevin Françoisse
Ilkka Kivimäki
Amin Mantrach
F. Rossi
M. Saerens
52
39
0
27 Feb 2013
Developments in the theory of randomized shortest paths with a
  comparison of graph node distances
Developments in the theory of randomized shortest paths with a comparison of graph node distances
Ilkka Kivimäki
Masashi Shimbo
M. Saerens
OT
75
84
0
07 Dec 2012
Shortest path distance in random k-nearest neighbor graphs
Shortest path distance in random k-nearest neighbor graphs
Morteza Alamgir
U. V. Luxburg
60
45
0
27 Jun 2012
An Analysis of the Convergence of Graph Laplacians
An Analysis of the Convergence of Graph Laplacians
Daniel Ting
Ling Huang
Michael I. Jordan
82
145
0
28 Jan 2011
1