Kathleen E. Hamilton

activity

20132023

most citedTight lower bound for percolation threshold on a quasi-regular graph

62 citations · 156 across the 17 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math-ph2016★ 1 cited

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…

math-ph2016

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 $G$ in terms of the limit of the spectral radii $ρ [H (G_{t})]$ of t…