I am currently a Ph.D. student in the Department of Mathematics at UC San Diego and I am grateful to be advised by Alex Cloninger. My research interests are primarily in the computational aspects of spectral 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.

Recent publications and manuscripts

• Matrix Concentration for Random Signed Graphs and Community Recovery in the Signed Stochastic Block Model, In Review.
• On Discrete Curvatures of Trees, In Review.
• On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs, with D. Kohli, A. Cloninger, G. Mishne, In Review.
• All You Need is Resistance: On the Equivalence of Effective Resistance and Certain Optimal Transport Problems on Graphs, with Z. Wan, A. Cloninger, In Review.
• 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

• Matrix concentration inequalities for random graphs
• Effective Resistance and Optimal Transport
• Minimum cost flows on connection graphs
• Graph Harnack inequalities

Recent announcements

• Preprint announcement: ‘Matrix Concentration for Random Signed Graphs and Community Recovery in the Signed Stochastic Block Model’ // 30 Dec 2024
• Preprint announcement: ‘On Discrete Curvatures of Trees’ // 30 Dec 2024
• Publication announcement: ‘Random Walks, Conductance, and Resistance for the Connection Graph Laplacian’ // 30 Sep 2024