49 citations · 51 across the 5 of their papers we have counts for
5 papers
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling
Andrew Stolman, Caleb Levy, C. Seshadhri +1
Graph representation learning (also called graph embeddings) is a popular technique for incorporating network structure into machine learning models. Unsupervised graph embedding m…
Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes
Akash Kumar, C. Seshadhri, Andrew Stolman
Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs i…
The impossibility of low rank representations for triangle-rich complex networks
C. Seshadhri, Aneesh Sharma, Andrew Stolman +1
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms fo…
Random walks and forbidden minors II: A -query tester for minor-closed properties of bounded-degree graphs
Akash Kumar, C. Seshadhri, Andrew Stolman
Let be a graph with vertices and maximum degree . Fix some minor-closed property (such as planarity). We say that is -far from $\mathcal{P…
Finding forbidden minors in sublinear time: a -query one-sided tester for minor closed properties on bounded degree graphs
Akash Kumar, C. Seshadhri, Andrew Stolman
Let be an undirected, bounded degree graph with vertices. Fix a finite graph , and suppose one must remove edges from to make it -minor free (for…