Random walks in a convex body and an improved volume algorithm
From MaRDI portal
Recommendations
- Random walks and anO*(n5) volume algorithm for convex bodies
- Convex Hulls of Random Walks
- Efficient random-walk methods for approximating polytope volume
- Convex hulls of multidimensional random walks
- Convex hulls of random walks and their scaling limits
- scientific article; zbMATH DE number 4172100
- Convex hulls of stable random walks
- Properties of uniform random walks in bounded convex bodies
Cites work
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 18983 (Why is no real title available?)
- scientific article; zbMATH DE number 66476 (Why is no real title available?)
- scientific article; zbMATH DE number 3011213 (Why is no real title available?)
- Polytope Volume Computation
Cited in
(only showing first 100 items - show all)- Weighted Poincaré-type inequalities for Cauchy and other convex measures
- What do we know about the Metropolis algorithm?
- The polytope of win vectors
- Log-Sobolev inequalities and sampling from log-concave distributions
- Simulated annealing for complex portfolio selection problems.
- Query by committee, linear separation and random walks.
- Needle decompositions and isoperimetric inequalities in Finsler geometry
- Nonlinear geometric analysis on Finsler manifolds
- Systematics of aligned axions
- Polynomial-sized topological approximations using the permutahedron
- Fractional smoothness of images of logarithmically concave measures under polynomials
- Learning mixtures of separated nonspherical Gaussians
- Complexity and approximation of finding the longest vector sum
- A random polynomial time algorithm for well-routing convex bodies
- Local dimension-free estimates for volumes of sublevel sets of analytic functions
- Isoperimetric problems for convex bodies and a localization lemma
- Mixing times for uniformly ergodic Markov chains
- Leaves decompositions in Euclidean spaces
- Quantitative estimates for the Bakry-Ledoux isoperimetric inequality
- Dilation type inequalities for strongly-convex sets in weighted Riemannian manifolds
- Localization for hyperbolic measures on infinite-dimensional spaces
- On a non-homogeneous version of a problem of Firey
- Floating bodies and approximation of convex bodies by polytopes
- Oracle lower bounds for stochastic gradient sampling algorithms
- t-copula from the viewpoint of tail dependence matrices
- Sampling by intersections with random geodesics
- Concentration of information content for convex measures
- The family of alpha,[a,b] stochastic orders: risk vs. expected value
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic
- Polynomials on spaces with logarithmically concave measures
- Sharp and rigid isoperimetric inequalities in metric-measure spaces with lower Ricci curvature bounds
- Geometric random edge
- Approximating the volume of convex bodies
- On the computational complexity of MCMC-based estimators in large samples
- Gaussian concentration for a class of spherically invariant measures
- Sharp dilation-type inequalities with a fixed parameter of convexity
- Simple Monte Carlo and the Metropolis algorithm
- Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing
- An isoperimetric inequality for uniformly log-concave measures and uniformly convex bodies
- A sharp isoperimetric bound for convex bodies
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- A localization inequality for set functions.
- A generalized localization theorem and geometric inequalities for convex bodies
- Approximation of convex sets by polytopes
- Randomized interior point methods for sampling and optimization
- Isoperimetric inequality and the Poincaré inequality for distributions of polynomials on convex compact set
- Lower estimates of measure of deviation of polynomials from mathematical expectations
- Faster mixing via average conductance
- Online discrete optimization in social networks in the presence of Knightian uncertainty
- Random walks on polytopes and an affine interior point method for linear programming
- KLS-type isoperimetric bounds for log-concave probability measures
- Hit-and-run for numerical integration
- Dirichlet eigenvalues, local random walks, and analyzing clusters in graphs
- Random sampling: billiard walk algorithm
- A parallel implementation of an O^(n^4) volume algorithm
- Hyperbolic measures on infinite dimensional spaces
- Error bounds for computing the expectation by Markov chain Monte Carlo
- scientific article; zbMATH DE number 4172100 (Why is no real title available?)
- Sampling convex bodies: a random matrix approach
- Concentration phenomena in high dimensional geometry
- Stochastic Billiards for Sampling from the Boundary of a Convex Set
- Decoupling and Partial Independence
- A modification of the random walk over spheres algorithm which is convenient for practical application
- scientific article; zbMATH DE number 18983 (Why is no real title available?)
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
- scientific article; zbMATH DE number 1281304 (Why is no real title available?)
- Random walks and anO*(n5) volume algorithm for convex bodies
- scientific article; zbMATH DE number 1149839 (Why is no real title available?)
- Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces
- Kahane‐Khinchine type inequalities for negative exponent
- scientific article; zbMATH DE number 1559589 (Why is no real title available?)
- The Brunn-Minkowski inequality
- Gibbs/Metropolis algorithms on a convex polytope
- Fast MCMC sampling algorithms on polytopes
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- The accessibility of convex bodies and derandomization of the hit and run algorithm
- Network essence: PageRank completion and centrality-conforming Markov chains
- Practical polytope volume approximation
- Efficient random-walk methods for approximating polytope volume
- Efficient sampling from time-varying log-concave distributions
- A semidefinite bound for mixing rates of Markov chains
- Intrinsic random walks in Riemannian and sub-Riemannian geometry via volume sampling
- Perturbations in the Gaussian isoperimetric inequality
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
- scientific article; zbMATH DE number 1563189 (Why is no real title available?)
- Log-concavity and strong log-concavity: a review
- Uniformly Generating Origin Destination Tables
- Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- Localization for infinite-dimensional hyperbolic measures
- Geodesic Walks in Polytopes
- Local \(L^p\)-Brunn-Minkowski inequalities for \(p < 1\)
- Sampling the feasible sets of SDPs and volume approximation
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Random walks on polytopes and an affine interior point method for linear programming
- A GEOMETRIC APPROACH TO RADIAL CORRELATION TYPE PROBLEMS
- Local flow partitioning for faster edge connectivity
This page was built for publication: Random walks in a convex body and an improved volume algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284999)
