From random walks to distances on unweighted graphs.
Tatsunori B. HashimotoYi SunTommi S. JaakkolaPublished in: CoRR (2015)
Keyphrases
- random walk
- directed graph
- undirected graph
- spectral methods
- average degree
- hyper graph
- web graph
- markov chain
- distance measure
- edge weights
- link prediction
- nodes of a graph
- euclidean distance
- distance function
- graph structure
- graph matching
- transition probabilities
- adjacency matrix
- bipartite graph
- stationary distribution
- markov random walk
- graph structures
- graph laplacian
- dynamic programming
- random walker
- transition probability matrix
- search algorithm