A NOTE ON COMPLETELY DISCONNECTING TREES (2008)
Abstract. Ginsburg and Sands defined a procedure for completely disconnecting graphs:each round, remove at most one edge from each component and at most w edges total. Define fw(g) tobethe minimal...
Graphs Induced by Gray Codes (2007)
Elizabeth L. Wilmer, Michael D. Ernst
. A binary Gray code on n bits induces a graph with vertex set f1; 2; : : : ; ng in the following way: connect i and j exactly when bit positions i and j change consecutively at some point during the...
GRAPHS INDUCED BY GRAY CODES (2007)
Abstract. We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are trees of...
A local limit theorem for a family of non-reversible Markov chains (2002)
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical...
Graphs Induced By Gray Codes (2002)
Elizabeth Wilmer And, Elizabeth L. Wilmer, D. Ernst
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are trees of arbitrarily...
Comparing eigenvalue bounds for Markov chains: when does Poincaré beat Cheeger? (1999)
Fulman, Jason, Wilmer, Elizabeth L.
The Poincaré and Cheeger bounds are two useful bounds for the second largest eigenvalue of a reversible Markov chain. Diaconis and Stroock and Jerrum and Sinclair develop versions of these bounds...
Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (1999)
Jason Fulman, Elizabeth L. Wilmer
The Poincaré and Cheeger bounds are two useful bounds for the second largest eigenvalue of a reversible Markov chain. Diaconis and Stroock [1991] and Jerrum and Sinclair [1989] develop versions of...
Jason Fulman, Elizabeth L. Wilmer
The Poincaré and Cheeger bounds are two useful bounds for the second largest eigenvalue of a reversible Markov chain. Diaconis and Stroock [1991]and Jerrum and Sinclair [1989]develop versions of...