Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
No specific mentions of published papers, awards, or patents.
Research Experience
At UC Berkeley, worked on developing a density formula-based approach for non-reversible isomorphism theorems, explored upper bounds for the cover time of non-reversible Markov chains, and studied statistical estimation methods for edge-reinforced random walks.
Education
Ph.D. in Computer Science from UC Berkeley, advised by Prof. Venkat Anantharam; M.Phil. from CUHK, supervised by Prof. James Cheng and Prof. Suion Chan; Bachelor's degree from Tsinghua University.
Background
Research interests include various aspects of stochastic processes and their applications. Focuses on developing a density formula-based approach for non-reversible isomorphism theorems, exploring upper bounds for the cover time of non-reversible Markov chains, statistical estimation methods for edge-reinforced random walks, and currently investigating ways to estimate network parameters using random walk techniques.