8 citations · 24 across the 23 of their papers we have counts for
4 papers · 1 filter
Sublinear-Time Algorithms for Max Cut, Max E2Lin, and Unique Label Cover on Expanders
Pan Peng, Yuichi Yoshida
We show sublinear-time algorithms for Max Cut and Max E2Lin on expanders in the adjacency list model that distinguishes instances with the optimal value more than $1-\varepsil…
Sublinear-Time Clustering Oracle for Signed Graphs
Stefan Neumann, Pan Peng
Social networks are often modeled using signed graphs, where vertices correspond to users and edges have a sign that indicates whether an interaction between users was positive or…
Approximately Counting Subgraphs in Data Streams
Hendrik Fichtenberger, Pan Peng
Estimating the number of subgraphs in data streams is a fundamental problem that has received great attention in the past decade. In this paper, we give improved streaming algorith…
Recovering Unbalanced Communities in the Stochastic Block Model With Application to Clustering with a Faulty Oracle
Chandra Sekhar Mukherjee, Pan Peng, Jiapeng Zhang
The stochastic block model (SBM) is a fundamental model for studying graph clustering or community detection in networks. It has received great attention in the last decade and the…