About
Hello! I’m a first-year Ph.D. student at the School of Computer Science, Beijing Institute of Technology, advised 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 welcome to new collaborations and chats՞˶･֊･˶՞
Contact me through e-mail or WeChat (id: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 proposes 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.
Improved Algorithms for Effective Resistance Computation on Graphs
Yichun Yang, Ronghua Li, Meihao Liao, Guoren Wang
COLT
We study the problem of computing Effective Resistance on undirected expander graphs. We propose faster algorithms and provide lower bounds for this problem.
News
I worked as a Research Assistant (RA) at HKU, supervised by Prof. Weiming Feng.
I visit USTC for one week.
I attended COLT 2025 and delivered a presentation.