62 citations · 68 across the 4 of their papers we have counts for
4 papers
Spike-based primitives for graph algorithms
Kathleen E. Hamilton, Tiffany M. Mintz, Catherine D. Schuman
In this paper we consider graph algorithms and graphical analysis as a new application for neuromorphic computing platforms. We demonstrate how the nonlinear dynamics of spiking ne…
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Kathleen E. Hamilton, Travis S. Humble
Using quantum annealing to solve an optimization problem requires minor embeddings of a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor…
Exponential decay of connectivity and uniqueness in percolation on finite and infinite graphs
Kathleen E. Hamilton, Leonid P. Pryadko
We give an upper bound for the uniqueness transition on an arbitrary locally finite graph in terms of the limit of the spectral radii of t…
Tight lower bound for percolation threshold on a quasi-regular graph
Kathleen E. Hamilton, Leonid P. Pryadko
We construct an exact expression for the site percolation threshold p_c on a quasi-regular tree, and a related exact lower bound for a quasi-regular graph. Both are given by the in…