arXiv subjects

Tatyana Benko

Publications and source records attributed to Tatyana Benko.

5 recordsLinked to original sources

arXiv2026

A customizable inexact subgraph matching algorithm for attributed graphs

Graphs provide a natural way to represent data by encoding information about objects and the relationships between them. With the ever-increasing amount of data collected and generated, locating specific patterns of relationships between objects in a graph is often required. Given a larger graph and a smaller graph, one may wish to identify instances of the smaller query graph in the larger target graph. This task is called subgraph identification or matching. Subgraph matching is helpful in areas such as bioinformatics, binary analysis, pattern recognition, and computer vision. In these applications, datasets frequently contain noise and errors, thus exact subgraph matching algorithms do not apply. In this paper we introduce a new customizable algorithm for inexact subgraph matching. Our algorithm utilizes node and edge attributes which are often present in real-world datasets to narrow down the search space. The algorithm is flexible in the type of subgraph matching it can perform and the types of datasets it can process by its use of a modifiable graph edit distance cost function for pairing nodes. We show its effectiveness on family trees graphs and control-flow graphs.

cs.DS↗

arXiv2025

HyperMagNet: A Magnetic Laplacian based Hypergraph Neural Network

In data science, hypergraphs are natural models for data exhibiting multi-way relations, whereas graphs only capture pairwise. Nonetheless, many proposed hypergraph neural networks effectively reduce hypergraphs to undirected graphs via symmetrized matrix representations, potentially losing important information. We propose an alternative approach to hypergraph neural networks in which the hypergraph is represented as a non-reversible Markov chain. We use this Markov chain to construct a complex Hermitian Laplacian matrix - the magnetic Laplacian - which serves as the input to our proposed hypergraph neural network. We study HyperMagNet for the task of node classification, and demonstrate its effectiveness over graph-reduction based hypergraph neural networks.

cs.LG↗

arXiv2025

Double boxes and double dimers

We give a combinatorial proof of a result in rank 2 Donaldson-Thomas theory, which states that the generating function for certain plane-partition-like objects, called double-box configurations, is equal to a product of MacMahon's generating function for (boxed) plane partitions. In our proof, we first give the correspondence between double-box configurations and double-dimer configurations on the hexagon lattice with a particular tripartite node pairing. Using this correspondence, we apply graphical condensation and double-dimer condensation to prove the result.

math.CO↗

arXiv2024

Comparing Bills of Materials

Bills of materials (BOMs) are quickly becoming an effective tool for managing supply chain risk. As more BOMs enter circulation, the ability to compare them will be crucial to understanding how products differ and in managing BOMs from different tools or sources. This paper will describe some of the challenges of comparing BOMs followed by a discussion of several comparison methods

cs.SE↗

arXiv2021

Brill-Lindquist-Riemann sums and their limits

This article commences a study of convergence of discretized point-object configurations, which we call Brill-Lindquist-Riemann sums, towards a charged dust continuum from the perspective of relativistic initial data. We are motivated by the interpretation of Brill-Lindquist-Riemann sums as collections of relatively isolated astrophysical bodies such as stars and galaxies in the universe, and the interpretation of the dust continuum as the universe itself. Our work begins by establishing the existence and the uniqueness of horizons/minimal surfaces of Brill-Lindquist metrics in the vicinity of the point-sources ("stars"). We then study the geometries of the regions exterior to said minimal surfaces, and discuss their Gromov-Hausdorff and intrinsic flat limit. An interesting and purely geometric byproduct of our work are examples in which the scalar curvature jumps upon taking Gromov-Hausdorff and /or intrinsic flat limits.

math.DG↗