Mark Huber, Ph.D.

Fletcher Jones Professor of Mathematics and Statistics and George R. Roberts Fellow


Mathematical Sciences

Areas of Expertise

Computer Science
Data Science
Adams Hall

Office Hours

Monday, Tuesday, Wednesday, Thursday 3:00-4:00 over Zoom (email me for the link)
By appointment for in person


I work in the area of computational probability, designing Monte Carlo methods for applications in statistics and computer science.


B.S., Harvey Mudd College; Ph.D., Cornell University.

Awards and Affiliations


NSF Postdoctoral Fellow in Mathematical Sciences NSF CAREER award

Research and Publications

M. Huber. Spatial point processes. In S. Brooks, A. Gelman, G. Jones, and X. Meng, editors, Handbook of MCMC, pages 227–252. Chapman & Hall/CRC Press, 2011.

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

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

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.

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