Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs.
Akash KumarC. SeshadhriAndrew StolmanPublished in: SIAM J. Comput. (2023)
Keyphrases
- random walk
- directed graph
- flow graph
- bounded degree
- spectral methods
- query processing
- average degree
- web graph
- database
- graph theoretic
- nodes of a graph
- markov chain
- relational databases
- database systems
- markov random walk
- graph clustering
- link prediction
- data sources
- bounded treewidth
- graph structure
- bipartite graph
- state space