Publications of Mark Huber     :chronological  combined  bibtex listing:

Papers Published

1. M. Huber and J. Law. "Fast approximation of the permanent for very dense problems." Proceedings of the nineteenth annual ACM-SIAM Symposium on Discrete Algorithms (2008): 681--689.  [abs]
2. M. Huber. "Perfect simulation for image restoration." Stochastic Models 23.3 (August, 2007): 475--487.  [abs]
3. D. Hearn and M. Huber. "The Ancestral Distance test: A topdown approach to detect correlated evolution in large lineages with missing character data and incomplete phylogenies." Systematic Biology 55.5 (October, 2006): 803--817.  [abs]
4. M. Huber, Y. Chen, I. Dinwoodie, A. Dobra, and M. Nicholas. "Monte Carlo algorithms for Hardy-Weinberg proportions." Biometrics 62.1 (March, 2006): 49--53.  [abs]
5. Mark L. Huber. "Fast perfect sampling from linear extensions." Discrete Mathematics 306 (2006): 420--428.  [abs]
6. M. Huber. "Exact sampling from perfect matchings in dense regular graphs." Algorithmica 44 (2006): 183--193.  [abs]
7. B. P. Tighe, J. E.S. Socolar, D.G. Schaeffer, W. G. Mitchener, and M. L. Huber. "Force distributions in a triagonal lattice of rigid bars." Physical Review E 72.031306 (2005). [e031306]  [abs]
8. Yuguo Chen, Ian Dinwoodie, Adrian Dobra, and Mark Huber. "Lattice Point, contingency tables and sampling." Contemporary Mathematics 374 (2005): 65--78.  [abs]
9. Mark Huber. "Perfect sampling using bounding chains." The Annals of Applied Probability 14.2 (August, 2004): 734--753.  [abs]
10. M. Huber, G. Reinert. "The Stationary Distribution in the Antivoter Model: Exact Sampling and Approximations." Stein's Method: Expository Lectures and Applications (2004): 79--94.  [abs]
11. Y. Chen, I. Dinwoodie, A. Dobra, and M. Huber. "Lattice points, contingency tables, and sampling." 6th SIAM Conference on Dynamical Systems (2003).
12. Mark L. Huber. "A bounding chain for Swendsen-Wang." Random Structures and Algorithms 22.1 (2002): 53--59.  [abs]
13. J. A. Fill and M. L. Huber. "The Randomness Recycler approach to perfect sampling." 53rd Annual Meeting of the ISI (2001): 69--72.  [abs]
14. A. Benjamin, M. Huber, M. Fluet. "Optimal Token Allocations in Solitaire Knock 'm Down." The Electronic Journal of Combinatorics 8.2 (2001): 1--8.  [abs]
15. James A. Fill, Mark L. Huber. "The Randomness Recycler: A new technique for perfect sampling." Proceeding of the 41th Annual IEEE Symposium on the Foundations of Computer Science (2001).  [abs]
16. Mark L. Huber. "A faster method for sampling independent sets." Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000): 624-626.  [abs]
17. Stephen Ahearn, Mark L. Huber, Gary Sherman. "Finite groups can be arbitrarily Hamiltonian." Communications in Algebra 27.3 (1999): 1013--1016.  [abs]
18. M. Huber. "Exact Sampling and Approximate Counting Techniques." Proc. 30th ACM Symposium on Theory of Computing (1998): 31--40.  [abs] [author's comments]

Papers Accepted

1. M. Huber. "Perfect simulation with exponential tails." Random Structures and Algorithms  (June, 2007).  [abs]

Papers Submitted

1. D. B. Woodard, S. Schmidler, and M. Huber. "Conditions for Torpid Mixing of Parallel and Simulated Tempering on Multimodal Distributions." Stochastic Processes and their Applications  (2007).
2. D. B. Woodard, S. C. Schmidler and M. Huber. "Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions." Annals of Applied Probability  (2007).
3. M. Huber. "Spatial Birth-Death-Swap Chains." Bernoulli  (2007).
4. F. Mitha and M. Huber. "Monotonic Multigamma coupling for perfect sampling." TOMACS  (2006).  [abs] [author's comments]

Preprints

1. M. Huber. "Birth-Death-Swap chains for perfect simulation of repulsive point processes."   (2003).  [abs]
2. I. Dinwoodie, A. Dobra, Y. Chen, M. Huber, M. Nicholas. "Generating from Hardy-Weinberg proportions."   ().  [abs]
3. James A. Fill, Mark L. Huber. "Linear expected time perfect generation of proper colorings of low degree graphs."   ().  [abs]