Elizabeth L. Wilmer

Publications32
h-index6
Citations1,542
Highly Influential Citations197
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • Y. Peres
  • 391 Publications • 12,413 Citations
  • A. Sinclair
  • 178 Publications • 8,455 Citations
  • P. Diaconis
  • 191 Publications • 12,259 Citations
  • Vincent Tinto
  • 47 Publications • 26,600 Citations
  • Publications
  • Influence
Markov Chains and Mixing Times
This book is an introduction to the modern approach to the theory of Markov chains. The main goal of this approach is to determine the rate of convergence of a Markov chain to the stationary… Expand
  • 1,442
  • 184
  • PDF
Reversals and Transpositions Over Finite Alphabets
Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition, or… Expand
  • 43
  • 8
  • PDF
Graphs induced by Gray codes
We disprove a conjecture of Bultena and Ruskey (Electron. J. Combin. 3 (1996) R11), that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic… Expand
  • 10
  • 2
  • PDF
COMPARING EIGENVALUE BOUNDS FOR MARKOV CHAINS: WHEN DOES POINCARE BEAT CHEEGER?
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… Expand
  • 23
  • 1
  • PDF
Combinatorics in the exterior algebra and the Bollob\'{a}s Two Families Theorem.
We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. As an… Expand
  • 4
  • 1
  • PDF
Coupling from the past
  • 7
  • 1
  • PDF
Hypergraphs of Bounded Disjointness
TLDR
A $k$-uniform hypergraph is $s$-almost intersecting if every edge is disjoint from exactly$s$ other edges. Expand
  • 9
  • PDF
Introduction to Markov chain mixing
  • 1
A Local Limit Theorem for a Family of Non-Reversible Markov Chains
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… Expand
  • 3
  • PDF
Martingales and evolving sets
...
1
2
3
4
...