• Publications
  • Influence
Algebraic algorithms for sampling from conditional distributions
We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include contingency tables, logistic regression, and spectralExpand
  • 569
  • 103
  • Open Access
Iterated Random Functions
Iterated random functions are used to draw pictures or simulate large Ising models, among other applications. They offer a method for studying the steady state distribution of a Markov chain, andExpand
  • 546
  • 77
  • Open Access
Conjugate Priors for Exponential Families
  • 564
  • 74
Supercharacters and superclasses for algebra groups
We study certain sums of irreducible characters and compatible unions of conjugacy classes in finite algebra groups. These groups generalize the unimodular upper triangular groups over a finiteExpand
  • 169
  • 59
  • Open Access
Fastest Mixing Markov Chain on a Graph
We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniformExpand
  • 580
  • 53
  • Open Access
Trailing the Dovetail Shuffle to its Lair
We analyze the most commonly used method for shuffling cards. The main result is a simple expression for the chance of any arrangement after any number of shuffles. This is used to give sharp boundsExpand
  • 301
  • 51
  • Open Access
Estimating and understanding exponential random graph models
We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent usingExpand
  • 249
  • 48
  • Open Access
Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation viaExpand
  • 395
  • 39
  • Open Access
On the Eigenvalues of Random Matrices
Let M be a random matrix chosen from Haar measure on the unitary group U,,. Let Z = X + iY be a standard complex normal random variable with X and Y independent, mean 0 and variance 4normalExpand
  • 330
  • 39
  • Open Access