AbstractA direct Monte Carlo method for volume estimation of star-shaped or convex domains is presented, and is generalized to a Markov Chain Monte Carlo method for high-dimensional problems. The direct approach itself, which is closely related to a method proposed by Fok and Crevier, is already applicable to some moderately high-dimensional problems. The combination with a Markov Chain Monte Carlo method and nested sampling or thermodynamic integration extends its scope considerably. Applications to the volume estimation for high-dimensional polytopes are presented, and the method is tested using exact results for the first 10 Birkho_ polytopes
The population Monte Carlo algorithm is an iterative importance sampling scheme for solving static p...
In this report, our goal is to find a way to get some information such as the mean out of high dimen...
Diusion equation posed on a high dimensional space may occur as a sub-problem in advection-diusion p...
We tackle the problem of efficiently approximating the volume of convex polytopes, when these are gi...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
Computing the volume of a polytope in high dimensions is computationally challenging but has wide ap...
International audienceComputing the volume of a polytope in high dimensions is computationally chall...
Abstract. The hard-disk problem, the statics and the dynamics of equal two-dimensional hard spheres ...
Computing the volume of a high dimensional polytope is a fundamental problem in geometry, also conne...
International audienceComputing the volume of a high dimensional polytope is a fundamental problem i...
International audienceComputing the volume of a high dimensional polytope is a fundamental problem i...
Ce manuscrit présente de nouvelles marches aléatoires pour le calcul des densités d'états, un problè...
We present some new results that extend the geometric approach to trans- dimensional Markov chain Mo...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
Given a high dimensional convex body K ⊆ IRn by a separation oracle, we can approx-imate its volume ...
The population Monte Carlo algorithm is an iterative importance sampling scheme for solving static p...
In this report, our goal is to find a way to get some information such as the mean out of high dimen...
Diusion equation posed on a high dimensional space may occur as a sub-problem in advection-diusion p...
We tackle the problem of efficiently approximating the volume of convex polytopes, when these are gi...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
Computing the volume of a polytope in high dimensions is computationally challenging but has wide ap...
International audienceComputing the volume of a polytope in high dimensions is computationally chall...
Abstract. The hard-disk problem, the statics and the dynamics of equal two-dimensional hard spheres ...
Computing the volume of a high dimensional polytope is a fundamental problem in geometry, also conne...
International audienceComputing the volume of a high dimensional polytope is a fundamental problem i...
International audienceComputing the volume of a high dimensional polytope is a fundamental problem i...
Ce manuscrit présente de nouvelles marches aléatoires pour le calcul des densités d'états, un problè...
We present some new results that extend the geometric approach to trans- dimensional Markov chain Mo...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
Given a high dimensional convex body K ⊆ IRn by a separation oracle, we can approx-imate its volume ...
The population Monte Carlo algorithm is an iterative importance sampling scheme for solving static p...
In this report, our goal is to find a way to get some information such as the mean out of high dimen...
Diusion equation posed on a high dimensional space may occur as a sub-problem in advection-diusion p...