Mark Huber Talks

    Invited and Conference Talks

  1. Fast approximation algorithms for partition functions of Gibbs distributions
    (27 June 2012)

    Special Topic Session, World Meeting of ISBA, Kyoto, Japan
    [pdf]

  2. Fast approximation algorithms for partition functions of Gibbs distributions
    (24 May 2012)

    Statistics and Biostatistics Seminar, The Ohio State University Department of Statistics
    [pdf]

  3. Perfect simulation of repuslive point processes (29 Nov 2011)
    Statistics Speakers Series, UCLA Department of Statistics
    [pdf]

  4. Partially Recursive Acceptance Rejection (13 Oct 2011)
    Mathematics and Computer Science Colloquium, University of Missouri St. Louis
    [pdf]

  5. The Paired Product Estimator for normalizing constants of Gibbs distribution (31 May 2011)
    Greek stochastics γ, Crete, Greece
    [pdf]

  6. Partially Recursive Acceptance Rejection (29 Mar 2011)
    Algebra, Number Theory, and Combinatorics Seminar, Claremont University Consortium
    [pdf]

  7. Adaptive Monte Carlo Methods for Numerical Integration (8 Mar 2011)
    Natural Sciences Colloquium, Pepperdine University
    [pdf]

  8. Perfect simulation with PRAR (10 Feb 2011)
    Information Theory and Applications, UC San Diego
    [pdf]

  9. Fast approximate counting of linear extensions (9 Jan 2011)
    Joint Mathematics Meetings, AMS Session on Probability
    [pdf]

  10. What I wish I knew before my job search (8 Jan 2011)
    Panel Discussant at Joint Mathematics Meetings
    [pdf]

  11. Randomized adaptive cooling schedules for Monte Carlo Integration (27 Oct 2010)
    UC Santa Barbara Statistics and Applied Probability Seminar
    [pdf]

  12. Near linear time perfect simulation of corrugated surfaces (9 Oct 2010)
    Fall Western Sectional AMS meeting
    [pdf]

  13. Using TPA for Monte Carlo integration (20 Aug 2010)
    9th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing
    [pdf]

  14. Using TPA for Bayesian inference (5 Jun 2010)
    Adaptive cooling schedules for the product estimator
    Ninth Valencia/Tenth ISBA World Meeting
    [pdf]

  15. Better numerical integration through random cooling schedules (14 Apr 2010)
    Adaptive cooling schedules for the product estimator
    UC Santa Cruz Applied Mathematics and Statistics Colloquium
    [pdf]

  16. Approximating the permanent of a matrix with nonnegative entries (30 Mar 2010)
    Perfect simulation (and approximate counting) of perfect matchings
    Algebra/Number Theory/Combinatorics Seminar of the Claremont Colleges
    [pdf]

  17. Approximation of normalizing constants using random cooling schedules (2 Feb 2010)
    Adaptive cooling schedules for the product estimator
    UC Riverside Statistics Department Seminar
    [pdf]

  18. Spatial Birth-Death-Swap chains (14 Jan 2010)
    Adding a swap move to continuous time birth-death chains
    Joint Mathematics Meetings
    [pdf]

  19. Better numerical integration through randomness (18 Nov 2009)
    Adaptive cooling schedules for the product estimator
    Claremont Colleges Colloquium
    [pdf]

  20. Simulation reductions for the Ising model (8 Nov, 2009)
    Simulation complexity classes
    AMS Fall Western Sectional Meeting
    [pdf]

  21. Simulation reductions for the Ising model (15 Sep, 2009)
    Simulation complexity classes
    Algebra/Number Theory/Combinatorics Seminar of the Claremont Colleges

  22. Speeding up the product estimator using random temperatures (5 Aug 2009)
    Adaptive cooling schedules for the product estimator
    Joint Statistical Meetings 2009
    [pdf]

  23. Using the swap move with spatial point processes (20 May 2009)
    Swap move Markov chains
    Aalborg University Department of Mathematical Sciences Seminar
    [pdf]

  24. Perfect simulation of Mate\'ern Type III point processes (17 Mar 2009)
    Algorithmic repulsive point processes
    EPSRC Workshop on MCMC at University of Warwick
    [pdf]

  25. Older talks

Last update: 8 Dec 2011.
Note: All downloads provided solely for use within the restrictions of the Fair Use Act, and all copyrights remain with their respective owners.