From random walks to distances on unweighted graphs.
Tatsunori B. HashimotoYi SunTommi S. JaakkolaPublished in: NIPS (2015)
Keyphrases
- random walk
- directed graph
- undirected graph
- spectral methods
- hyper graph
- average degree
- edge weights
- link prediction
- markov chain
- web graph
- nodes of a graph
- transition probabilities
- markov random walk
- transition probability matrix
- graph mining
- bipartite graph
- graph matching
- graph clustering
- graph structures
- distance function
- distance measure
- random walker
- euclidean distance
- stationary distribution
- graph laplacian
- shortest path
- graph partitioning
- geodesic distance
- graph model