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 (2022)
Keyphrases
- random walk
- directed graph
- markov chain
- flow graph
- link prediction
- transition probabilities
- graph laplacian
- spectral methods
- stationary distribution
- transition probability matrix
- average degree
- nodes of a graph
- information retrieval
- markov random walk
- hyper graph
- proximity measures
- web graph
- class labels
- vc dimension
- sample size
- semi supervised