Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
- Published multiple preprints such as 'Scalable tensor methods for nonuniform hypergraphs', 'SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks', etc.
- US Patent: Methods and systems for evaluating data transportability in distribution grids.
Research Experience
No specific work experience or research projects listed.
Education
- PhD in Mathematics, 2017, University of California, San Diego
- MA in Applied Mathematics, 2014, University of California, San Diego
- BA in Mathematics, BA in Economics, 2012, University of Chicago
Background
An applied mathematician specializing in network science. Much of his work focuses on hypergraphs and spectral graph theory. Drawing from combinatorics, algebra, and probability, he develops methodologies for studying complex systems arising from varied domains, including social networks, power and communication systems, and high performance computing.
Miscellany
Interest tags include autoencoders, chemistry, clustering, cyber security, data reduction, directed graphs, early career advice, game theory, graph generation, graph similarity, HPC, hypergraphs, knot theory, markov chains, motif mining, neural networks, open source software, power grid, randomized algorithms, social networks, spectral graph theory, temporal networks, tensors, and topology.
- Developed several open-source software projects like CHGL, GENTTSV, HNX, hyperedge-triplets, and relative-hausdorff-distance.