activity
20072017
most citedA simple example of Dirichlet process mixture inconsistency for the number of components

89 citations · 243 across the 12 of their papers we have counts for

collaborators
Showing stat.COShow all

5 papers · 1 filter

stat.CO2013★ 9 cited

Importance sampling for weighted binary random matrices with specified margins

Matthew T. Harrison, Jeffrey W. Miller

A sequential importance sampling algorithm is developed for the distribution that results when a matrix of independent, but not identically distributed, Bernoulli random variables…

stat.CO2013★ 45 cited

Exact sampling and counting for fixed-margin matrices

Jeffrey W. Miller, Matthew T. Harrison

The uniform distribution on matrices with specified row and column sums is often a natural choice of null model when testing for structure in two-way tables (binary or nonnegative…

stat.CO2011★ 2 cited

Exact Enumeration and Sampling of Matrices with Specified Margins

Jeffrey W. Miller, Matthew T. Harrison

We describe a dynamic programming algorithm for exact counting and exact uniform sampling of matrices with specified row and column sums. The algorithm runs in polynomial time when…

stat.CO2010

Conservative Hypothesis Tests and Confidence Intervals using Importance Sampling

Matthew T. Harrison

Importance sampling is a common technique for Monte Carlo approximation, including Monte Carlo approximation of p-values. Here it is shown that a simple correction of the usual imp…

stat.CO2009★ 3 cited

A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins

Matthew T. Harrison

Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical alg…