About Me
I am about to finish my Ph.D. in the Department of Mathematics at UC San Diego, where I am grateful to be advised by Fan Chung and Alex Cloninger. For the upcoming 2026 Fall semester I will join the Simons Institute as a visiting fellow, and then in January I plan to join the Department of Statistics at Columbia University as a term assistant professor.
My research interests are primarily in the realm of computational graph theory, which include topics such as: effective resistance, signed and connection Laplacians, discrete curvature of graphs, optimal transportation, clustering and community detection methods on graphs, random graphs, and beyond.
You may find some of my work or follow me at my Google Scholar page. You can also view some of my code snippets at my GitHub page as well.
My curriculum vitae is available here (Updated November 2025).
My 2025-2026 job market research statement, Computational Graph Theory in the Twenty-First Century, is also a great reference to learn a bit more about what I am up to lately.
Recent publications and manuscripts
- Distance Exceptional Graphs and the Curvature Index, with F. Southerland, E. Surya, Submitted.
- Discrete Curvatures and Convex Polytopes, with J. A. De Loera, J. Eddy, and J. A. Samper, Submitted.
- Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization, with D. Kohli, G. Mishne, A. Cloninger, Submitted.
- Stochastically Evolving Graphs via Edit Semigroups, with F. Chung, Proc. Natl. Acad. Sci. USA. Vol. 122, No. 49 (2025).
- Robust Graph-Based Semi-Supervised Learning via p-Conductances, with C. Holtz, Z. Wan, G. Mishne, A. Cloninger.
- Matrix Concentration for Random Signed Graphs and Community Recovery in the Signed Stochastic Block Model.
- A Comparative Study of Curvature on Trees, To appear, Bull. Inst. Combin. Appl..
- On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs, with D. Kohli, A. Cloninger, G. Mishne, SIAM J. Sci. Comput. Vol. 47, No. 5 (2025).
- All You Need is Resistance: On the Equivalence of Effective Resistance and Certain Optimal Transport Problems on Graphs, with Z. Wan, A. Cloninger.
- Random Walks, Conductance, and Resistance for the Connection Graph Laplacian, with A. Cloninger, G. Mishne, A. Oslandsbotn, Z. Wan, Y. Wang. SIAM J. Matrix Anal. Appl. Vol. 45, No. 3 (2024).
Fun beamers
- Stochastically Evolving Graphs via Edit Semigroups SIAM PNW Meeting, Seattle, WA, October 2025
- Effective Resistance, Optimal Transport, and Graph-Based SSL CodEx Seminar, July 2025
- Minimum cost flows on connection graphs SIAM Discrete Math, Spokane, WA, July 2024
- Matrix concentration inequalities for random graphs DOGSPOT Seminar, UCSD, October 2024
- Graph Harnack inequalities OU Math Analysis Seminar, Spring 2020
Recent announcements
- Preprint announcement: ‘Distance Exceptional Graphs and the Curvature Index’ // 6 November 2025
- Preprint announcement: ‘Discrete Curvatures and Convex Polytopes’ // 14 October 2025
- Preprint announcement: ‘Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization’ // 2 October 2025
- Preprint announcement: ‘Stochastically Evolving Graphs via Edit Semigroups’ // 24 September 2025
- Publication announcement: ‘On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs’ // 23 June 2025
