Curriculum Vitae

Mark Huber

228 Physics
Durham, NC 27708 		(919) 660-6970 (office)
(email)
Education

BS Harvey Mudd College 1994
B.S. in Mathematics at Harvey Mudd College, 1994
Masters in Operations Research at Cornell University, 1997
Ph.D. in Operations Research at Cornell University, 1999

Areas of Research

Monte Carlo simulation and stochastic computation

Recent Grant Support

Professional Service

University Committee
Academic Council, May, 2004 - May, 2006  
Dept Committee
Graduate Affairs Committee, 2006 - present  
Committee to create written basic analysis qualifying exam, August, 2004 - May 01, 2007  
Qualifying Exam Committee for Rann Bar-on, December 07, 2004  
Qualifying Exam Committee for Jeffrey Streets, October, 2003  
Qualifying Exam Committee for Michael Nicholas, November, 2002  
Papers Refereed
American Math Monthly, Referee, August, 2007  
Referee, Advances in Applied Probability, December 2006  
Referee, SIAM Journal on Scientific Computing, December 2006  
Referee, Bayesian Analysis, July 2006  
Referee, Random Structures and Algorithms, July 2006  
Bernoulli, June 2006  
European Journal of Applied Mathematics, April 29, 2006  
Annals of Applied Probability, February 2006  
Referee, Journal of Statistical Computation and Computation, December 2005  
Referee, Electronic Journal of Probability, 2003-05  
Referee, Random Structures and Algorithms, September 2005  
Referee, Journal American Statistical Association, 2003-05  
Referee, Annals of Applied Probability, 2003  
Other
Undergraduate major advisor, August 1, 2002 - present  
MAD Scientist, MAD Scientist Network, January 1, 1999 - present  
Selected Recent Invited Talks

An Overview of Perfect Sampling Methods, "Advances in Analysis of Monte Carlo Methods", Harvard University, December 02, 2007  
Improved perfect sampling for repulsive point processes, University of Minnesota, October 11, 2007  
An attractive algorithm for repulsive spatial point processes, Algorithms Seminar, Dept. of Computer Science, Duke University, October 01, 2007  
A new move for spatial point processes, DIMACS Workshop on Markov Chain Monte Carlo: Synthesizing Theory and Practice, June 07, 2007  
Swapped at birth: Building a better spatial point process, Duke Mathematics Graduate Faculty Seminar, April 13, 2007  
Some experiments on tridiagonal matrices for beta ensembles., SAMSI Universality working group, November 05, 2006  
Perfect simulation with the Randomness Recycler for arbitrary state spaces, University of Warwick, August 22, 2006  
Advance Acceptance/Rejection Methods for Monte Carlo Algorithms, UC Davis-Department of Mathematics, March 05, 2006  
Polynomial time generation of random regular graphs, Random Graphs and Stochastic Computation Workshop, SAMSI, Research Triangle Park, Durham, NC USA, June 13, 2005  
Time Dependent Update Functions for Perfect Sampling, Joint Statistical Meetings, August, 2004  
Time dependent update functions for perfect sampling, IMS meeting Singapore, March 11, 2004  
Perfect Sampling: techniques and challenges, University of Ulm, 9 December 2003  
Perfect sampling, Mathematisches Forschungsinstitut Oberwolfach, 5 December 2003  
Markov chain moves for generating contingency tables with fixed weighted row sums, SAMSI, 29 July 2003  
Bounded chain techniques for perfect sampling, Electrical and Computer Engineering seminar at NC State, 14 February 2003  
Randomness Recycler: A technique for generating perfect samples from high dimensional distributions, Duke Statistics Research Seminars, September 7, 2001  

Publications

Papers Published

  1. M. Huber, Perfect simulation for image restoration, Stochastic Models, vol. 23 no. 3 (August, 2007), pp. 475--487, Taylor and Francis
  2. 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, vol. 55 no. 5 (October, 2006), pp. 803--817, Taylor & Francis
  3. M. Huber, Y. Chen, I. Dinwoodie, A. Dobra, and M. Nicholas, Monte Carlo algorithms for Hardy-Weinberg proportions, Biometrics, vol. 62 no. 1 (March, 2006), pp. 49--53, Blackwell Synergy
  4. Mark L. Huber, Fast perfect sampling from linear extensions, Discrete Mathematics, vol. 306 (2006), pp. 420--428, Elsevier
  5. M. Huber, Exact sampling from perfect matchings in dense regular graphs, Algorithmica, vol. 44 (2006), pp. 183--193, Springer Science+Business Media, Inc.
  6. 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, vol. 72 no. 031306 (2005), APS Journals
  7. Yuguo Chen, Ian Dinwoodie, Adrian Dobra, and Mark Huber, Lattice Point, contingency tables and sampling, Contemporary Mathematics, vol. 374 (2005), pp. 65--78, American Mathematical Society
  8. Mark Huber, Perfect sampling using bounding chains, The Annals of Applied Probability, vol. 14 no. 2 (August, 2004), pp. 734--753, Institute of Mathematical Statistics
  9. M. Huber, G. Reinert, The Stationary Distribution in the Antivoter Model: Exact Sampling and Approximations, in Stein's Method: Expository Lectures and Applications (2004), pp. 79--94
  10. Y. Chen, I. Dinwoodie, A. Dobra, and M. Huber, Lattice points, contingency tables, and sampling, 6th SIAM Conference on Dynamical Systems (2003)
  11. Mark L. Huber, A bounding chain for Swendsen-Wang, Random Structures and Algorithms, vol. 22 no. 1 (2002), pp. 53--59
  12. J. A. Fill and M. L. Huber, The Randomness Recycler approach to perfect sampling, 53rd Annual Meeting of the ISI (2001), pp. 69--72
  13. A. Benjamin, M. Huber, M. Fluet, Optimal Token Allocations in Solitaire Knock 'm Down, The Electronic Journal of Combinatorics, vol. 8 no. 2 (2001), pp. 1--8
  14. 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)
  15. Mark L. Huber, A faster method for sampling independent sets, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 624-626
  16. Stephen Ahearn, Mark L. Huber, Gary Sherman, Finite groups can be arbitrarily Hamiltonian, Communications in Algebra, vol. 27 no. 3 (1999), pp. 1013--1016
  17. M. Huber, Exact Sampling and Approximate Counting Techniques, Proc. 30th ACM Symposium on Theory of Computing (1998), pp. 31--40

Papers Accepted

  1. M. Huber, Perfect simulation with exponential tails, Random Structures and Algorithms (June, 2007)
  2. M. Huber and J. Law, Fast approximation of the permanent for very dense problems, in SODA 2008 (2007)

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)

Papers In Preparation

  1. J. Fill, M. Huber, Perfect simulation of perpetuities (2007)
  2. M. Huber, 2-part Sperner families in Multisets (2005)
  3. M. Huber, Uniform generation of regular graphs (2005)

Preprints

  1. M. Huber, Birth-Death-Swap chains for perfect simulation of repulsive point processes (2003)
  2. I. Dinwoodie, A. Dobra, Y. Chen, M. Huber, M. Nicholas, Generating from Hardy-Weinberg proportions , preprint 2002
  3. James A. Fill, Mark L. Huber, Linear expected time perfect generation of proper colorings of low degree graphs , preprint 2001
Last modified: 2008/04/03