1 citations · 1 across the 3 of their papers we have counts for
12 papers
Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs
Koby Hayashi, Sinan G. Aksoy, Haesun Park
Cut-based directed graph (digraph) clustering often focuses on finding dense within-cluster or sparse between-cluster connections, similar to cut-based undirected graph clustering…
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis
Xu T. Liu, Jesun Firoz, Sinan Aksoy +5
Hypergraphs offer flexible and robust data representations for many applications, but methods that work directly on hypergraphs are not readily available and tend to be prohibitive…
Directional Laplacian Centrality for Cyber Situational Awareness
Sinan G. Aksoy, Emilie Purvine, Stephen J. Young
Cyber operations is drowning in diverse, high-volume, multi-source data. In order to get a full picture of current operations and identify malicious events and actors analysts must…
Hypergraph Random Walks, Laplacians, and Clustering
Koby Hayashi, Sinan G. Aksoy, Cheong Hee Park +1
We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-d…
Hypernetwork Science: From Multidimensional Networks to Computational Topology
Cliff A. Joslyn, Sinan Aksoy, Tiffany J. Callahan +5
As data structures and mathematical objects used for complex systems modeling, hypergraphs sit nicely poised between on the one hand the world of network models, and on the other t…
Spectral Threshold for Extremal Cyclic Edge-Connectivity
Sinan G. Aksoy, Mark Kempton, Stephen J. Young
The cyclic edge-connectivity of a graph is the least such that there exists a set of edges whose removal disconnects into components where every component contains…