85 citations · 285 across the 40 of their papers we have counts for
4 papers · 1 filter
Escape times for subgraph detection and graph partitioning
Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola +2
We provide a rearrangement based algorithm for fast detection of subgraphs of vertices with long escape times for directed or undirected networks. Complementing other notions o…
Extremal graph realizations and graph Laplacian eigenvalues
Braxton Osting
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygo…
A dynamical systems based framework for dimension reduction
Ryeongkyung Yoon, Braxton Osting
We propose a novel framework for learning a low-dimensional representation of data based on nonlinear dynamical systems, which we call dynamical dimension reduction (DDR). In the D…
Flat tori with large Laplacian eigenvalues in dimensions up to eight
Chiu-Yen Kao, Braxton Osting, Jackson C. Turner
We consider the optimization problem of maximizing the -th Laplacian eigenvalue, , over flat -dimensional tori of fixed volume. For , this problem is equivalent t…