73 citations · 141 across the 26 of their papers we have counts for
7 papers · 1 filter
Re-imagining Spectral Graph Theory
Sinan G. Aksoy, Stephen J. Young
We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other…
Seven open problems in applied combinatorics
Sinan G. Aksoy, Ryan Bennink, Yuzhou Chen +10
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentia…
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…
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…
The maximum relaxation time of a random walk
Sinan G. Aksoy, Fan Chung, Michael Tait +1
We show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on vertices is . This minimum is achieved asymptotically…
Extreme values of the stationary distribution of random walks on directed graphs
Sinan Aksoy, Fan Chung, Xing Peng
We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of…
Graphs with many strong orientations
Sinan Aksoy, Paul Horn
We establish mild conditions under which a possibly irregular, sparse graph has "many" strong orientations. Given a graph on vertices, orient each edge in either direct…