Publications

(2022). Advice From Our Advisor: Fan Chung. Notices of the American Mathematical Society.

PDF DOI

(2022). Models and Methods for Sparse (Hyper)Network Science in Business, Industry, and Government. Notices of the American Mathematical Society.

PDF DOI

(2022). Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs. arXiv preprint arXiv:2203.01388.

Preprint

(2022). High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis. 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

PDF DOI

(2021). Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs. 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC).

PDF DOI

(2021). Explaining and predicting human behavior and social dynamics in simulated virtual worlds: reproducibility, generalizability, and robustness of causal discovery methods. Computational and Mathematical Organization Theory.

PDF DOI

(2021). Directional Laplacian Centrality for Cyber Situational Awareness. Digital Threats: Research and Practice (DTRAP).

PDF DOI

(2021). Spectral Threshold for Extremal Cyclic Edge-Connectivity.

PDF DOI

(2021). Structural Controllability Assessment for Inverter-Based Microgrids. 2021 North American Power Symposium (NAPS).

PDF DOI

(2021). SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks. arXiv preprint arXiv:2104.11725.

Preprint PDF DOI

(2020). Hypergraph Random Walks, Laplacians, and Clustering.

Preprint DOI

(2020). Hypernetwork Science via High-Order Hypergraph Walks.

PDF DOI

(2020). Hypernetwork Science: From Multidimensional Networks to Computational Topology. Unifying Themes in Complex Systems X.

Preprint DOI

(2019). Ramanujan Graphs and the Spectral Gap of Supercomputing Topologies.

PDF DOI

(2019). A linear-time algorithm and analysis of graph Relative Hausdorff distance.

PDF DOI

(2019). Relative Hausdorff Distance for Network Analysis.

PDF DOI

(2018). The maximum relaxation time of a random walk. Advances in Applied Mathematics.

PDF DOI

(2018). Chapel HyperGraph Library (CHGL). 2018 IEEE High Performance extreme Computing Conference (HPEC).

PDF DOI

(2018). A generative graph model for electrical infrastructure networks. Journal of Complex Networks.

PDF DOI

(2018). A Topological Approach to Representational Data Models. Human Interface and the Management of Information. Interaction, Visualization, and Analytics.

DOI

(2017). Measuring and modeling bipartite graphs with community structure. Journal of Complex Networks.

PDF DOI

(2017). Random walks on graphs and orientations of graphs. UC San Diego.

PDF

(2016). Extreme values of the stationary distribution of random walks on directed graphs. Advances in Applied Mathematics.

PDF DOI

(2016). Graphs with Many Strong Orientations. SIAM Journal on Discrete Mathematics.

PDF DOI

(2015). Coalitions and cliques in the school choice problem. Involve, a Journal of Mathematics.

PDF DOI

(2013). School Choice as a One-Sided Matching Problem: Cardinal Utilities and Optimization.

Preprint

(2012). Bikei, Involutory Biracks and Unoriented Link Invariants. Journal of Knot Theory and Its Ramifications.

DOI