Mark Huber Publications

Monotonic multigamma coupling for perfect sampling
Faheem Mitha and Mark Huber, Journal of Statistical Computation and Simulation (available online 2011)
[abstract] [article]

Spatial Birth-Death-Swap Chains
Mark Huber, Bernoulli (accepted 2011)
[abstract] [pdf] [code]

Spatial point processes
M. Huber, in Handbook of MCMC, Edited by Brooks, Gelman, and Meng, Chapman & Hall/CRC Press (2011)
[Amazon]

Using TPA for Bayesian inference
M. Huber and S. Schott, Bayesian Statstics 9 (2010)
[abstract] [pdf]

The stationary Matérn hard core process of type III
J. Møller, M. L. Huber and R. L. Wolpert, Stochastic Processes and their Applications, vol. 120 (2010) pp. 2142--2158.

Perfect simulation of Vervaat Perpetuities
J.A. Fill and M. L. Huber, Electronic Journal of Probability, vol. 15 (2010), pp. 96-109.
[abstract] [pdf]

Likelihood based inference for Matérn type III repulsive point processes
M. L. Huber and R. L. Wolpert, Advances in Applied Probability, vol. 41 (2009), pp. 958-977.
[abstract] [pdf]

Conditions for Torpid Mixing of Parallel and Simulated Tempering on Multimodal Distributions
D. B. Woodard, S. C. Schmidler and M. Huber, Electronic Journal of Probability, vol. 14 (2009), pp. 780—804.
[abstract] [pdf]

Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions
D. B. Woodard, S. C. Schmidler and M. Huber, Annals of Applied Probability, vol. 19, no. 2 (2009), pp. 617—640.
[abstract] [pdf]

Perfect simulation with exponential tails
M. Huber, Random Structures and Algorithms, vol. 33 no. 1 (August 2008), pp.29–43.
[abstract] [pdf]

Fast approximation of the permanent for very dense problems
M. Huber and J. Law, Proc. of Symposium on Discrete Algorithms (2008), pp. 681–689.
[abstract] [pdf]

Perfect simulation for image restoration
M. Huber, Stochastic Models, vol. 23 no. 3 (August, 2007), pp. 475–487.
[abstract] [pdf]

The Ancestral Distance test: A topdown approach to detect correlated evolution in large lineages with missing character data and incomplete phylogenies
D. Hearn and M. Huber, Systematic Biology, vol. 55 no. 5 (October, 2006), pp. 803–817.
[abstract] [pdf]

Monte Carlo algorithms for Hardy-Weinberg proportions
M. Huber, Y. Chen, I. Dinwoodie, A. Dobra, and M. Nicholas, Biometrics, vol. 62 no. 1 (March, 2006), pp. 49–53.
[abstract] [pdf]

Fast perfect sampling from linear extensions
M. L. Huber, Discrete Mathematics, vol. 306 (2006), pp. 420–428.
[abstract] [pdf]

Exact sampling from perfect matchings in dense regular graphs
M. Huber, Algorithmica, vol. 44 (2006), pp. 183–193.
[abstract] [pdf]

Force distributions in a triagonal lattice of rigid bars
B. P. Tighe, J. E.S. Socolar, D.G. Schaeffer, W. G. Mitchener, and M. L. Huber, Physical Review E, vol. 72 no. 031306 (2005), APS Journals [e031306].
[abstract] [pdf]

Lattice Points, contingency tables, and sampling
Y. Chen, I. Dinwoodie, A. Dobra, and M. Huber, Contemporary Mathematics, vol. 374 (2005), pp. 65–78.
[abstract] [pdf]

Perfect sampling using bounding chains
The Annals of Applied Probability, M. Huber, vol. 14 no. 2 (August, 2004), pp. 734–753.
[abstract] [pdf]

The Stationary Distribution in the Antivoter Model: Exact Sampling and Approximations
M. Huber, G. Reinert, in Stein's Method: Expository Lectures and Applications (2004), pp. 79–94.

A bounding chain for Swendsen-Wang
M. L. Huber, Random Structures and Algorithms, vol. 22 no. 1 (2002), pp. 53–59.
[abstract] [pdf]

The Randomness Recycler approach to perfect sampling
J. A. Fill and M. L. Huber, 53rd Annual Meeting of the ISI (2001), pp. 69–72.
[abstract] [pdf]

Optimal Token Allocations in Solitaire Knock 'm Down
A. Benjamin, M. Huber, M. Fluet, The Electronic Journal of Combinatorics, vol. 8 no. 2 (2001), pp. 1–8.
[abstract] [pdf]

The Randomness Recycler: A new technique for perfect sampling
J. A. Fill, M. L. Huber, Proceedings of the 41th Annual IEEE Symposium on the Foundations of Computer Science (2001), pp. 503–511.
[abstract] [pdf]

A faster method for sampling independent sets
M. L. Huber, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 624–626.
[abstract] [pdf]

Finite groups can be arbitrarily Hamiltonian
S. Ahearn, M. L. Huber, G. Sherman, Communications in Algebra, vol. 27 no. 3 (1999), pp. 1013–1016.
[abstract] [pdf]

Exact Sampling and Approximate Counting Techniques
M. Huber, Proc. 30th ACM Symposium on Theory of Computing (1998), pp. 31–40
[abstract] [pdf]

Using TPA to count linear extensions
J. Banks, S. Garrabrant, M. L. Huber, and A. Perizzolo, submitted
[arXiv:1010.4981]

Bounds on the artificial phase transition for perfect simulation of repulsive point processes
M. L. Huber, E. McCall, D. Rozenfeld, and J. Xu, submitted
[arXiv: 1010.3055]

Reducing the Ising model to matchings
M. Huber and J. Law, submitted
[arXiv:0907.0477]

The Randomness Recycler method for perfect sampling
J. A. Fill, M. L. Huber, preprint.