Sinan G. Aksoy

Orcid: 0000-0002-3466-3334

  • University of California San Diego, Department of Mathematics, USA

According to our database1, Sinan G. Aksoy authored at least 37 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



HyperNetX: A Python package for modeling complex network data as hypergraphs.
J. Open Source Softw., April, 2024

HyperMagNet: A Magnetic Laplacian based Hypergraph Neural Network.
CoRR, 2024

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization.
CoRR, 2024

Explaining and predicting human behavior and social dynamics in simulated virtual worlds: reproducibility, generalizability, and robustness of causal discovery methods.
Comput. Math. Organ. Theory, March, 2023

Hypergraph Topological Features for Autoencoder-Based Intrusion Detection for Cybersecurity Data.
CoRR, 2023

Stepping out of Flatland: Discovering Behavior Patterns as Topological Structures in Cyber Hypergraphs.
CoRR, 2023

Size-Aware Hypergraph Motifs.
CoRR, 2023

Scalable tensor methods for nonuniform hypergraphs.
CoRR, 2023

Seven open problems in applied combinatorics.
CoRR, 2023

Fast Parallel Tensor Times Same Vector for Hypergraphs.
Proceedings of the 30th IEEE International Conference on High Performance Computing, 2023

The Circular Variance as a Visual Summary of Synchronized Voltage Angle Measurements.
Proceedings of the 56th Hawaii International Conference on System Sciences, 2023

Malicious Cyber Activity Detection using Zigzag Persistence.
Proceedings of the IEEE Conference on Dependable and Secure Computing, 2023

SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

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

Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs.
Proceedings of the IEEE International Conference on Big Data, 2022

Ramanujan graphs and the spectral gap of supercomputing topologies.
J. Supercomput., 2021

Spectral Threshold for Extremal Cyclic Edge-Connectivity.
Graphs Comb., 2021

SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks.
CoRR, 2021

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs.
Proceedings of the 28th IEEE International Conference on High Performance Computing, 2021

Hypernetwork science via high-order hypergraph walks.
EPJ Data Sci., 2020

Directional Laplacian Centrality for Cyber Situational Awareness.
CoRR, 2020

Hypernetwork Science: From Multidimensional Networks to Computational Topology.
CoRR, 2020

Hypergraph Analytics of Domain Name System Relationships.
Proceedings of the Algorithms and Models for the Web Graph - 17th International Workshop, 2020

Automated Realistic Testbed Synthesis for Power System Communication Networks based on Graph Metrics.
Proceedings of the IEEE Power & Energy Society Innovative Smart Grid Technologies Conference, 2020

Hypergraph Random Walks, Laplacians, and Clustering.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance.
SIAM J. Math. Data Sci., 2019

A generative graph model for electrical infrastructure networks.
J. Complex Networks, 2019

Relative Hausdorff distance for network analysis.
Appl. Netw. Sci., 2019

The maximum relaxation time of a random walk.
Adv. Appl. Math., 2018

Chapel HyperGraph Library (CHGL).
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

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

Measuring and modeling bipartite graphs with community structure.
J. Complex Networks, 2017

Graphs with Many Strong Orientations.
SIAM J. Discret. Math., 2016

Extreme values of the stationary distribution of random walks on directed graphs.
Adv. Appl. Math., 2016

School Choice as a One-Sided Matching Problem: Cardinal Utilities and Optimization
CoRR, 2013

A Cost-Minimizing Algorithm for School Choice.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Coalitions and Cliques in the School Choice Problem
CoRR, 2011