About
Hello! I’m a first-year Ph.D. student at the School of Computer Science, Beijing Institute of Technology, supervised by Prof. Rong-Hua Li. Before starting my Ph.D., I obtained a BSc degree in the School of Mathematics from Beijing Institute of Technology. My current research focuses on spectral graph algorithms and sublinear graph algorithms. I’m also broadly interested in combinatorics and theoretical computer science.
Always open to new collaborations and chats՞˶･֊･˶՞
Contact me through e-mail (yc.yang@bit.edu.cn) or WeChat (Berserker_60) if you are interested.
Selected Publications
View All →Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
Yichun Yang, Longlong Lin, Rong-Hua Li, Meihao Liao, Guoren Wang
VLDB
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.
*An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs
Pan Peng, Yuyang Wang, Joy Qiping Yang, Yichun Yang
COLT
An exponential lower bound for spectral density estimation under non-adaptive random walk model on unweighted graphs.
News
I'm currently a research assistant at HKU, supervised by Prof. Weiming Feng.
I visited USTC for one week.
I attended COLT 2025 and gave a presentation.