Search Results for author:
Found 3 papers, 0 papers with code
A class of network models recoverable by spectral clustering
Finding communities in networks is a problem that remains difficult, in spite of the amount of attention it has recently received.
Measuring the Robustness of Graph Properties
In this paper, we propose a perturbation framework to measure the robustness of graph properties.
Graph Clustering: Block-models and model free results
In this paper, we propose a framework, in which we obtain "correctness" guarantees without assuming the data comes from a model.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
