Ranran Shen

2 accepted papers

2026

Sublinear Spectral Clustering Oracle with Little Memory

Ranran Shen, Xiaoyi Zhu, Pan Peng, Zengfeng Huang

ICLR 2026poster

We study the problem of designing *sublinear spectral clustering oracles* for well-clusterable graphs. Such an oracle is an algorithm that, given query access to the adjacency list of a graph $G$, first constructs a compact data structure $\mathcal{D}$ that captures the clustering structure of $G$.…

Cited by 0 Source ↗Scholar ↗

2023

A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time

Ranran Shen, Pan Peng

NeurIPS 2023poster

We address the problem of designing a sublinear-time spectral clustering oracle for graphs that exhibit strong clusterability. Such graphs contain $k$ latent clusters, each characterized by a large inner conductance (at least $\varphi$) and a small outer conductance (at most $\varepsilon$). Our aim…

Cited by 0 Source ↗PDF ↗Scholar ↗