12 citations · 39 across the 10 of their papers we have counts for
12 papers
Hypergraph Characterization of Fusion Rings
Paul Bruillard, Kathleen Nowak, Stephen J. Young
We present a correspondence between multiplicity-free, self-dual, fusion rings and a digraph, hypergraph pair . This correspondence is used to provide a complete characteriz…
A Sheaf Theoretical Approach to Uncertainty Quantification of Heterogeneous Geolocation Information
Cliff Joslyn, Lauren Charles, Chris DePerno +7
Integration of heterogeneous sensors is a challenging problem across a range of applications. Prominent among these are multi-target tracking, where one must combine observations f…
Koopman Representations of Dynamic Systems with Control
Craig Bakker, Steven Rosenthal, Kathleen E. Nowak
The design and analysis of optimal control policies for dynamical systems can be complicated by nonlinear dependence in the state variables. Koopman operators have been used to sim…
Relative Hausdorff Distance for Network Analysis
Sinan G. Aksoy, Kathleen E. Nowak, Emilie Purvine +1
Similarity measures are used extensively in machine learning and data science algorithms. The newly proposed graph Relative Hausdorff (RH) distance is a lightweight yet nuanced sim…
A linear-time algorithm and analysis of graph Relative Hausdorff distance
Sinan G. Aksoy, Kathleen E. Nowak, Stephen J. Young
Graph similarity metrics serve far-ranging purposes across many domains in data science. As graph datasets grow in size, scientists need comparative tools that capture meaningful d…
On the Structure of Isometrically Embeddable Metric Spaces
Kathleen Nowak, Carlos Ortiz Marrero, Stephen J. Young
Since its popularization in the 1970s the Fiedler vector of a graph has become a standard tool for clustering of the vertices of the graph. Recently, Mendel and Noar, Dumitriu and…
Ubergraphs: A Definition of a Recursive Hypergraph Structure
Cliff Joslyn, Kathleen Nowak
Partly in service of exploring the formal basis for Georgetown University's AvesTerra database structure, we formalize a recursive hypergraph data structure, which we call an uberg…
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…
On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs
Keivan Hassani Monfared, Paul Horn, Franklin H. J. Kenter +3
The principal permanent rank characteristic sequence is a binary sequence where if there exists a principal square submatrix of size with nonzero…
Links between orthogonal arrays, association schemes and partial geometric designs
Kathleen Nowak, Oktay Olmez, Sung Y. Song
In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial…
A Survey on Almost Difference Sets
Kathleen Nowak
Let be an additive group of order . A -element subset of is called a -almost difference set if the expressions , for and in , re…
Almost Difference Sets, Normally Regular Digraphs and Cyclotomic Schemes from Cyclotomy of Order Twelve
Kathleen Nowak, Oktay Olmez, Sung Y. Song
Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyc…