Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size.
Edward PyneSalil P. VadhanPublished in: CoRR (2021)
Keyphrases
- random walk
- directed graph
- flow graph
- hyper graph
- spectral methods
- average degree
- markov chain
- query processing
- web graph
- link prediction
- stationary distribution
- query language
- markov random walk
- approximation algorithms
- proximity measures
- transition probabilities
- transition probability matrix
- approximation guarantees
- web search engines
- random walker
- fully automated
- spanning tree
- data objects
- social networks
- link spam