61 citations · 339 across the 34 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.PR2012★ 10 cited
Bootstrap percolation on the Hamming torus
Janko Gravner, Christopher Hoffman, James Pfeiffer +1
The Hamming torus of dimension is the graph with vertices and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with…
math.DS2012★ 1 cited
Subshifts of finite type which have completely positive entropy
Christopher Hoffman
Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for s…
math.CO2012★ 29 cited
Spectral gaps of random graphs and applications
Christopher Hoffman, Matthew Kahle, Elliot Paquette
We study the spectral gap of the Erdős--Rényi random graph through the connectivity threshold. In particular, we show that for any fixed if $$p \ge \frac{(1/2 + δ) \log n}{n…