8 citations · 24 across the 23 of their papers we have counts for
Showing 2023 · cs.DSShow all
3 papers · 2 filters
cs.DS2023
Massively Parallel Algorithms for the Stochastic Block Model
Zelin Li, Pan Peng, Xianbin Zhu
Learning the community structure of a large-scale graph is a fundamental problem in machine learning, computer science and statistics. We study the problem of exactly recovering th…
cs.DS2023
Effective Resistances in Non-Expander Graphs
Dongrun Cai, Xue Chen, Pan Peng
Effective resistances are ubiquitous in graph algorithms and network analysis. In this work, we study sublinear time algorithms to approximate the effective resistance of an adjace…
cs.DS2023
An Optimal Separation between Two Property Testing Models for Bounded Degree Directed Graphs
Pan Peng, Yuyang Wang
We revisit the relation between two fundamental property testing models for bounded-degree directed graphs: the bidirectional model in which the algorithms are allowed to query bot…