Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes.
Akash KumarC. SeshadhriAndrew StolmanPublished in: FOCS (2021)
Keyphrases
- random walk
- directed graph
- markov chain
- graph laplacian
- flow graph
- transition probability matrix
- link prediction
- markov random walk
- average degree
- transition probabilities
- nodes of a graph
- stationary distribution
- text mining
- random walker
- information retrieval
- vc dimension
- spectral methods
- bipartite graph
- hyper graph
- proximity measures
- sample size
- state space
- active learning