A guide to Monte Carlo simulations in statistical physics, 2014. ,
Monte Carlo statistical methods, 2013. ,
Handbook of Markov Chain Monte Carlo, 2011. ,
A conceptual introduction to Hamiltonian Monte Carlo, 2017. ,
MCMC using Hamiltonian Dynamics, Handbook of Markov Chain Monte Carlo, pp.113-162, 2012. ,
Exact volume computation for polytopes: a practical study, Polytopes -combinatorics and computation, pp.131-154, 2000. ,
On the complexity of computing the volume of a polyhedron, SIAM Journal on Computing, vol.17, issue.5, pp.967-974, 1988. ,
Computing the volume is difficult, Discrete & Computational Geometry, vol.2, issue.4, pp.319-326, 1987. ,
Flavors of Geometry, 1997. ,
A random polynomial-time algorithm for approximating the volume of convex bodies, Journal of the ACM (JACM), vol.38, issue.1, pp.1-17, 1991. ,
Simulated annealing in convex bodies and an O * (n 4 ) volume algorithm, Journal of Computer and System Sciences, vol.72, issue.2, pp.392-417, 2006. ,
A practical volume algorithm, Mathematical Programming Computation, vol.8, issue.2, pp.133-160, 2016. ,
Bypassing KLS: Gaussian cooling and an O * (n 3 ) volume algorithm, ACM STOC, pp.539-548, 2015. ,
Gaussian cooling and O * (n 3 ) algorithms for volume and gaussian volume, SIAM Journal on Computing, vol.47, issue.3, pp.1237-1273, 2018. ,
Faster mixing via average conductance, Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, STOC '99, pp.282-287, 1999. ,
Hit-and-run mixes fast, Mathematical Programming, Series B, vol.86, pp.443-461, 1999. ,
Hit-and-run is fast and fun. preprint, Microsoft Research, 2003. ,
Hit-and-run from a corner, Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, STOC '04, pp.310-314, 2004. ,
CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models, Bioinformatics, vol.33, issue.11, pp.1741-1743, 2017. ,
, Random sampling: Billiard walk algorithm. arXiv, 2014.
Efficient random-walk methods for approximating polytope volume, Proceedings of the thirtieth annual symposium on Computational geometry, p.318, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01897272
Practical polytope volume approximation, ACM Trans. on Math. Software, vol.44, issue.4, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01897272
Markov chains and mixing times, vol.107, 2017. ,
Billiard walk-a new sampling algorithm for control and optimization, IFAC Proceedings Volumes, vol.47, pp.6123-6128, 2014. ,
Computational geometry: an introduction, 1985. ,
Handbook of floating-point arithmetic, 2018. ,
URL : https://hal.archives-ouvertes.fr/ensl-00379167
Classroom examples of robustness problems in geometric computations, Computational Geometry, vol.40, issue.1, pp.61-78, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00344515
The exact computation paradigm, Computing in Euclidean Geometry, pp.452-492, 1995. ,
, Computational Geometry Algorithms Library
Reflection, refraction, and Hamiltonian Monte Carlo, Advances in Neural Information Processing Systems, pp.3007-3015, 2015. ,
General state space Markov chains and MCMC algorithms, Probability Surveys, 2004. ,
Continuity and differentiability of solutions ,
Exact hamiltonian Monte Carlo for truncated multivariate gaussians, Journal of Computational and Graphical Statistics, vol.23, issue.2, pp.518-542, 2014. ,
The iRRAM: Exact arithmetic in C++, Computability and Complexity in Analysis, pp.222-252, 2001. ,
The Structural Bioinformatics Library: modeling in biomolecular science and beyond, Bioinformatics, vol.7, issue.33, pp.1-8, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01570848