scientific article; zbMATH DE number 5019925
From MaRDI portal
Publication:5290281
ball walkconductanceconvex bodyconvex optimisationefficient samplinggeometric random walkgrid walkhit-and-runisoperimetrymixing ratestationary distributionvolume computation
Random convex sets and integral geometry (aspects of convex geometry) (52A22) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Computational aspects related to convexity (52B55) Geometric probability and stochastic geometry (60D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Random walks with geometric jumps
- scientific article; zbMATH DE number 3967514
- scientific article; zbMATH DE number 2149329
- Large deviations for geodesic random walks
- The geometry of random walk isomorphism theorems
- Geodesics and recurrence of random walks in disordered systems
- A note on the central limit theorem for geodesic random walks
- Geometry of the random walk range conditioned on survival among Bernoulli obstacles
- Récurrence des marches aléatoires et ergodicité du flot géodésique sur les graphes réguliers.
Cited in
(53)- Rapid mixing of geodesic walks on manifolds with positive curvature
- Geodesics and recurrence of random walks in disordered systems
- The geometry of random walk isomorphism theorems
- Large scale model predictive control with neural networks and primal active sets
- Mixing time guarantees for unadjusted Hamiltonian Monte Carlo
- Efficient sampling in spectrahedra and volume approximation
- Optimal scaling of random-walk Metropolis algorithms on general target distributions
- Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics
- Uniform distributions and random variate generation over generalized \(l_p\) balls and spheres
- Geometric random edge
- On the computational complexity of MCMC-based estimators in large samples
- Heat-bath random walks with Markov bases
- Simple Monte Carlo and the Metropolis algorithm
- Efficient random walks in the presence of complex two-dimensional geometries
- Randomized interior point methods for sampling and optimization
- Heat flow and a faster algorithm to compute the surface area of a convex body
- An economical acceptance-rejection algorithm for uniform random variate generation over constrained simplexes
- Concentration phenomena in high dimensional geometry
- Stochastic Billiards for Sampling from the Boundary of a Convex Set
- Hit-and-run from a corner
- scientific article; zbMATH DE number 1281304 (Why is no real title available?)
- Fast MCMC sampling algorithms on polytopes
- Convex hulls of multidimensional random walks
- The accessibility of convex bodies and derandomization of the hit and run algorithm
- Efficient sampling from time-varying log-concave distributions
- Random Walks and Geometry
- Geodesic walks in polytopes
- scientific article; zbMATH DE number 7626762 (Why is no real title available?)
- Geodesic Walks in Polytopes
- Sampling the feasible sets of SDPs and volume approximation
- Smart Contract Execution - the (+-)-Biased Ballot Problem.
- Cross-entropy reduction of data matrix with restriction on information capacity of projectors and their norms
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- Blocking Conductance and Mixing in Random Walks
- Hit-and-Run from a Corner
- On multivariate quantiles under partial orders
- A Gibbs Sampler for a Class of Random Convex Polytopes
- Complexity results for MCMC derived from quantitative bounds
- Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions
- John’s walk
- Finite-sample complexity of sequential Monte Carlo estimators
- Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
- A quick estimate for the volume of a polyhedron
- Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes
- Analysis of Multiple-try Metropolis via Poincaré inequalities
- Accelerated convergence in Hit-and-Run Monte Carlo and a coordinate-free randomized Kaczmarz algorithm
- Resolving the mixing time of the Langevin algorithm to its stationary distribution for log-concave sampling
- Sequential Monte Carlo for cut-Bayesian posterior computation
- A ``thermodynamic approach to multi-robot cooperative localization
- In-and-out: algorithmic diffusion for sampling convex bodies
- Learning Markov random walks for robust subspace clustering and estimation
- Dispersion of mass and the complexity of randomized geometric algorithms
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5290281)
