Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
A Simple Active-Set Method for PageRank-Based Local Graph Clustering
Zhewei Wei, Mingji Yang
Local graph clustering aims to find a well-connected cluster near a given seed node without exploring the entire graph. A key step in the classic local clustering algorithm of Ande…
cs.DS2025
On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
Tsz Chiu Kwok, Zhewei Wei, Mingji Yang
We initiate a study of solving a row/column diagonally dominant (RDD/CDD) linear system in sublinear time, with the goal of estimating for a given vector $t\in…
cs.DS2025
PageRank Centrality in Directed Graphs with Bounded In-Degree
Mikkel Thorup, Hanzhi Wang, Zhewei Wei +1
We study the computational complexity of locally estimating a node's PageRank centrality in a directed graph . For any node , its PageRank centrality is defined as the…