Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
The geometry of logconcave functions and sampling algorithms
Random Structures & Algorithms
Simulated Annealing for Convex Optimization
Mathematics of Operations Research
D-decomposition technique state-of-the-art
Automation and Remote Control
Random walks on polytopes and an affine interior point method for linear programming
Proceedings of the forty-first annual ACM symposium on Theory of computing
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Thin partitions: isoperimetric inequalities and a sampling algorithm for star shaped bodies
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Estimating Haplotype Frequencies by Combining Data from Large DNA Pools with Database Information
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An analysis of a variation of hit-and-run for uniform sampling from general regions
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On sampling from multivariate distributions
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Pattern discrete and mixed Hit-and-Run for global optimization
Journal of Global Optimization
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
Mathematics of Operations Research
Lower bounds for hit-and-run direct search
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Probabilistic Temporal Logic Falsification of Cyber-Physical Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
Computational Optimization and Applications
| Hi-index | 0.00 |
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, the ball walk can take exponentially many steps from some starting points. The proof extends to sampling an exponential density over a convex body.