51 citations · 182 across the 10 of their papers we have counts for
11 papers
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…
Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
Guanyu Cui, Hanzhi Wang, Zhewei Wei
We study the problem of efficiently approximating the \textit{effective resistance} (ER) on undirected graphs, where ER is a widely used node proximity measure with applications in…
Revisiting Local Computation of PageRank: Simple and Optimal
Hanzhi Wang, Zhewei Wei, Ji-Rong Wen +1
We revisit the classic local graph exploration algorithm ApproxContributions proposed by Andersen, Borgs, Chayes, Hopcroft, Mirrokni, and Teng (WAW '07, Internet Math. '08) for com…
Efficient Algorithms for Personalized PageRank Computation: A Survey
Mingji Yang, Hanzhi Wang, Zhewei Wei +2
Personalized PageRank (PPR) is a traditional measure for node proximity on large graphs. For a pair of nodes and , the PPR value equals the probability that an -…
Estimating Single-Node PageRank in Time
Hanzhi Wang, Zhewei Wei
PageRank is a famous measure of graph centrality that has numerous applications in practice. The problem of computing a single node's PageRank has been the subject of extensive res…
Optimal Dynamic Subset Sampling: Theory and Applications
Lu Yi, Hanzhi Wang, Zhewei Wei
We study the fundamental problem of sampling independent events, called subset sampling. Specifically, consider a set of events , where each event …
Instant Graph Neural Networks for Dynamic Graphs
Yanping Zheng, Hanzhi Wang, Zhewei Wei +2
Graph Neural Networks (GNNs) have been widely used for modeling graph-structured data. With the development of numerous GNN variants, recent years have witnessed groundbreaking res…
Edge-based Local Push for Personalized PageRank
Hanzhi Wang, Zhewei Wei, Junhao Gan +3
Personalized PageRank (PPR) is a popular node proximity metric in graph mining and network research. Given a graph G=(V,E) and a source node , a single-source PPR (SSPPR)…
Approximate Graph Propagation
Hanzhi Wang, Mingguo He, Zhewei Wei +4
Efficient computation of node proximity queries such as transition probabilities, Personalized PageRank, and Katz are of fundamental importance in various graph mining and learning…
Personalized PageRank to a Target Node, Revisited
Hanzhi Wang, Zhewei Wei, Junhao Gan +2
Personalized PageRank (PPR) is a widely used node proximity measure in graph mining and network analysis. Given a source node and a target node , the PPR value repr…
Exact Single-Source SimRank Computation on Large Graphs
Hanzhi Wang, Zhewei Wei, Ye Yuan +2
SimRank is a popular measurement for evaluating the node-to-node similarities based on the graph topology. In recent years, single-source and top- SimRank queries have received…