Publications and preprints

Using Higher-Order Moments to Assess the Quality of GAN-generated Image Features with Lorenzo Luzi, Ryan Murray, and Carlos Ortiz Marrero.

Abstract: The rapid advancement of Generative Adversarial Networks (GANs) necessitates the need to robustly evaluate these models. Among the established evaluation criteria, the Fréchet Inception Distance (FID) has been widely adopted due to its conceptual simplicity, fast computation time, and strong correlation with human perception. However, FID has inherent limitations, mainly stemming from its assumption that feature embeddings follow a Gaussian distribution, and therefore can be defined by their first two moments. As this does not hold in practice, in this paper we explore the importance of third-moments in image feature data and use this information to define a new measure, which we call the Skew Inception Distance (SID). We prove that SID is a pseudometric on probability distributions, show how it extends FID, and present a practical method for its computation. Our numerical experiments support that SID either tracks with FID or, in some cases, aligns more closely with human perception when evaluating image features of ImageNet data.

Lattice walks confined to an octant in dimension 3: (non-)rationality of the second critical exponent with Luc Hillairet and Kilian Raschel.

Accepted to Annales de l'Institut Henri Poincaré D: Combinatorics, Physics and their Interactions.

Abstract: In the field of enumeration of walks in cones, it is known how to compute asymptotically the number of excursions (finite paths in the cone with fixed length, starting and ending points, using jumps from a given step set). As it turns out, the associated critical exponent is related to the eigenvalues of a certain Dirichlet problem on a spherical domain. An important underlying question is to decide whether this asymptotic exponent is a (non-)rational number, as this has important consequences on the algebraic nature of the associated generating function. In this paper, we ask whether such an excursion sequence might admit an asymptotic expansion with a first rational exponent and a second non-rational exponent. While the current state of the art does not give any access to such many-term expansions, we look at the associated continuous problem, involving Brownian motion in cones. Our main result is to prove that in dimension three, there exists a cone such that the heat kernel (the continuous analogue of the excursion sequence) has the desired rational/non-rational asymptotic property. Our techniques come from spectral theory and perturbation theory. More specifically, our main tool is a new Hadamard formula, which has an independent interest and allows us to compute the derivative of eigenvalues of spherical triangles along infinitesimal variations of the angles.

Double-dimer condensation and the PT-DT correspondence with Gautam Webb and Ben Young.

A 12-page extended abstract of this paper was accepted to appear as a talk at FPSAC 2021.

Abstract: We resolve an open conjecture from algebraic geometry, which states that two generating functions for plane partition-like objects (the "box-counting" formulae for the Calabi-Yau topological vertices in Donaldson-Thomas theory and Pandharipande-Thomas theory) are equal up to a factor of MacMahon's generating function for plane partitions. The main tools in our proof are a Desnanot-Jacobi-type condensation identity, and a novel application of the tripartite double-dimer model of Kenyon-Wilson.

Combinatorics of the Double-Dimer Model

In Advances in Mathematics, Volume 392 (2021).

A 12-page extended abstract of this paper appeared in Séminaire Lotharingien de Combinatoire, 84B (Proceedings of FPSAC 2020)

Abstract: We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition function was established nearly 20 years ago by Kuo and has applications to random tiling theory and the theory of cluster algebras. This work was motivated in part by the potential for applications in these areas. Additionally, we discuss an application to a problem in Donaldson-Thomas and Pandharipande-Thomas theory. The proof of our recurrence requires generalizing work of Kenyon and Wilson; specifically, lifting their assumption that the nodes of the graph are black and odd or white and even.

Matching complexes of trees and applications of the matching tree algorithm, with M. Jelić Milutinović, A. McDonough, and J. Vega. Annals of Combinatorics, 2022.

Abstract: A matching complex of a simple graph G is a simplicial complex with faces given by the matchings of G. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa showed that matching complexes of forests are contractible or homotopy equivalent to a wedge of spheres. We study two specific families of trees. For caterpillar graphs, we give explicit formulas for the number of spheres in each dimension and for perfect binary trees we find a strict connectivity bound. We also use a tool from discrete Morse theory called the Matching Tree Algorithm to study the connectivity of honeycomb graphs, partially answering a question raised by Jonsson.

Tilings, continued fractions, derangements, scramblings, and e, with B. Balof.

In Journal of Integer Sequences (2014).

Abstract: In a recent book, Benjamin and Quinn ask about the combinatorial implications of Euler’s continued fraction e = [2,(1, 1),(1, 2),(2, 3),(3, 4), . . . ]. In this paper, we explore those implications through two special types of permutations, namely, derangements and scramblings.

Conference publications

Hypergraph Topological Features for Autoencoder-Based Intrusion Detection for Cybersecurity Data with Bill Kay (lead author), S. Aksoy, M. Baird, D. Best, C. Joslyn, C. Potvin, G. Henselman-Petrusek, G. Seppala, S. Young, and E. Purvine. Conference Proceedings of ICML workshop on Machine Learning for Cybersecurity, 2022.