Publications
A collection of my research work. Among these, papers marked with an (*) are ordered alphabetically by author names, and are considered as equal contribution for each author.
*An $m+n^3/2$ algorithm for counting spanning trees by $ell_1$-regularized resistance
Rong-Hua Li, Yichun Yang
manuscript 2026
Approximate counting the number of spanning trees in $widetilde O(m+n^3/2)$ time.
*Classical and quantum spectral density estimation under local graph access
Rong-Hua Li, Meihao Liao, Yichun Yang
manuscript 2026
An exponential lower bound for spectral density estimation under classical local access, as well as polynomial algorithm under quantum local access.
ID^2GL: Incremental Node Representation Learning on Large-Scale Dynamic Directed Graphs
Zening Li, Rong-Hua Li, Yichun Yang, Meihao Liao
CIKM 2026
*Fast counting and sampling for ferromagnetic two-spin systems
Weiming Feng, Heng Guo, Yichun Yang
In submission 2026
Fast counting and sampling algorithms for ferromagnetic two-spin systems in certain parameter regime.
*An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs
Pan Peng, Yuyang Wang, Joy Qiping Yang, Yichun Yang
COLT 2026
An exponential lower bound for spectral density estimation under non-adaptive random walk model on unweighted graphs.
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
Yichun Yang, Longlong Lin, Rong-Hua Li, Meihao Liao, Guoren Wang
VLDB 2026
We study the problem of computing single-pair Effective Resistance (also known as Resistance Distance) on undirected graphs. We propose an local algorithm that converges faster than the $kappa^3$ bound, which achieves significant improvements on real-world networks with large condition numbers, such as road networks.
AdaPush: An adaptive Push Framework for Graph-Propagation Based Node Similarity Computation
Yichun Yang, Ronghua Li, Meihao Liao, Guoren Wang
TKDE 2026
An early-stage work completed during my undergraduate studies ₍˄·͈༝·͈˄*₎◞ ̑̑. We propose fast algorithms for adjacency matrix-based graph propagation computation, such as Katz score and exponential communicability.
Improved Algorithms for Effective Resistance Computation on Graphs
Yichun Yang, Ronghua Li, Meihao Liao, Guoren Wang
COLT 2025
We study the problem of computing Effective Resistance on undirected expander graphs. We propose faster algorithms and provide lower bounds for this problem.