Random walks in a convex body and an improved volume algorithm
From MaRDI portal
Publication:4284999
DOI10.1002/RSA.3240040402zbMath0788.60087OpenAlexW2159000620WikidataQ59410512 ScholiaQ59410512MaRDI QIDQ4284999
Publication date: 1 June 1994
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240040402
Geometric probability and stochastic geometry (60D05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (only showing first 100 items - show all)
Tropical Monte Carlo quadrature for Feynman integrals ⋮ Sharp Rosenthal‐type inequalities for mixtures and log‐concave variables ⋮ Analysis of high-dimensional distributions using pathwise methods ⋮ A universal bound in the dimensional Brunn-Minkowski inequality for log-concave measures ⋮ Geometric and functional inequalities for log-concave probability sequences ⋮ John’s walk ⋮ Convergence of Gibbs sampling: coordinate hit-and-run mixes fast ⋮ Quantitative Obata's theorem ⋮ Dimension-free mixing times of Gibbs samplers for Bayesian hierarchical models ⋮ Bayesian Robustness: A Nonasymptotic Viewpoint ⋮ Sharp Sobolev inequalities on noncompact Riemannian manifolds with \(\mathrm{Ric} \geq 0\) via optimal transport theory ⋮ Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo ⋮ Isoperimetric inequality for Finsler manifolds with non-negative Ricci curvature ⋮ Convergence rates of Metropolis-Hastings algorithms ⋮ Graph curvature and local discrepancy ⋮ On the approximation of one Markov chain by another ⋮ 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 ⋮ Localization for hyperbolic measures on infinite-dimensional spaces ⋮ On a non-homogeneous version of a problem of Firey ⋮ On the mixing time of coordinate Hit-and-Run ⋮ Geometric random edge ⋮ KLS-type isoperimetric bounds for log-concave probability measures ⋮ The Brunn-Minkowski inequality ⋮ Random sampling: billiard walk algorithm ⋮ Floating bodies and approximation of convex bodies by polytopes ⋮ Oracle lower bounds for stochastic gradient sampling algorithms ⋮ A parallel implementation of an \(O^\ast(n^4)\) volume algorithm ⋮ Hyperbolic measures on infinite dimensional spaces ⋮ Concentration phenomena in high dimensional geometry ⋮ Isoperimetric problems for convex bodies and a localization lemma ⋮ \(t\)-copula from the viewpoint of tail dependence matrices ⋮ Unnamed Item ⋮ Stochastic Billiards for Sampling from the Boundary of a Convex Set ⋮ On the computational complexity of MCMC-based estimators in large samples ⋮ Needle decompositions and isoperimetric inequalities in Finsler geometry ⋮ Geodesic Walks in Polytopes ⋮ Faster mixing and small bottlenecks ⋮ Hit-and-Run for Numerical Integration ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume ⋮ Random walks and local cuts in graphs ⋮ Small ball probability and Dvoretzky's Theorem ⋮ Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs ⋮ Computing heat kernel PageRank and a local clustering algorithm ⋮ Sampling by intersections with random geodesics ⋮ Local 𝐿^{𝑝}-Brunn–Minkowski inequalities for 𝑝<1 ⋮ Concentration of information content for convex measures ⋮ Nonlinear geometric analysis on Finsler manifolds ⋮ Computational results of an \(O^{\ast }(n^{4})\) volume algorithm ⋮ Simulated annealing for complex portfolio selection problems. ⋮ Network Essence: PageRank Completion and Centrality-Conforming Markov Chains ⋮ Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor ⋮ Systematics of aligned axions ⋮ Gibbs/Metropolis algorithms on a convex polytope ⋮ Unnamed Item ⋮ Gaussian concentration for a class of spherically invariant measures ⋮ Mixing times for uniformly ergodic Markov chains ⋮ Perturbations in the Gaussian isoperimetric inequality ⋮ Sharp dilation-type inequalities with a fixed parameter of convexity ⋮ Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions ⋮ On sub-determinants and the diameter of polyhedra ⋮ Log-concavity and strong log-concavity: a review ⋮ Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts ⋮ Polynomial-sized topological approximations using the permutahedron ⋮ Localization for infinite-dimensional hyperbolic measures ⋮ Simple Monte Carlo and the Metropolis algorithm ⋮ Leaves decompositions in Euclidean spaces ⋮ The family of alpha,[a,b stochastic orders: risk vs. expected value] ⋮ Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing ⋮ Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions ⋮ Dispersion of mass and the complexity of randomized geometric algorithms ⋮ Nash inequalities for finite Markov chains ⋮ A semidefinite bound for mixing rates of Markov chains ⋮ Convex geometry and waist inequalities ⋮ An isoperimetric inequality for uniformly log-concave measures and uniformly convex bodies ⋮ Fractional smoothness of images of logarithmically concave measures under polynomials ⋮ Uniformly Generating Origin Destination Tables ⋮ A sharp isoperimetric bound for convex bodies ⋮ A polynomial number of random points does not determine the volume of a convex body ⋮ Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm ⋮ A localization inequality for set functions. ⋮ Learning mixtures of separated nonspherical Gaussians ⋮ Approximating the volume of unions and intersections of high-dimensional geometric objects ⋮ Unnamed Item ⋮ A generalized localization theorem and geometric inequalities for convex bodies ⋮ Local Flow Partitioning for Faster Edge Connectivity ⋮ Concentration of the information in data with log-concave distributions ⋮ Complexity and approximation of finding the longest vector sum ⋮ Measuring exposure to dependence risk with random Bernstein copula scenarios ⋮ Explicit error bounds for lazy reversible Markov chain Monte Carlo ⋮ Error bounds for computing the expectation by Markov chain Monte Carlo ⋮ A GEOMETRIC APPROACH TO RADIAL CORRELATION TYPE PROBLEMS ⋮ Approximation of convex sets by polytopes ⋮ Weighted Poincaré-type inequalities for Cauchy and other convex measures ⋮ What do we know about the Metropolis algorithm? ⋮ Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces ⋮ Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty ⋮ Quantitative estimates for the Bakry-Ledoux isoperimetric inequality
Cites Work
This page was built for publication: Random walks in a convex body and an improved volume algorithm
