scientific article
From MaRDI portal
Publication:3976408
zbMath0754.68052MaRDI QIDQ3976408
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sums of independent random variables; random walks (60G50) Parallel algorithms in computer science (68W10)
Related Items
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm, Approximating the volume of convex bodies, Largest \(j\)-simplices in \(n\)-polytopes, Isoperimetric problems for convex bodies and a localization lemma, Isoperimetric inequalities in unbounded convex bodies, Random walks in a convex body and an improved volume algorithm, Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes, Geodesic Walks in Polytopes, Fixed Precision MCMC Estimation by Median of Products of Averages, Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume, On the diffusion geometry of graph Laplacians and applications, Geometric and functional inequalities for log-concave probability sequences, An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions, Mixing times of lozenge tiling and card shuffling Markov chains, Poincaré inequality in mean value for Gaussian polytopes, Counting linear extensions, Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts, Approximating the Hausdorff distance by \(\alpha\)-dense curves, Likelihood-based inference for Matérn type-III repulsive point processes, Dispersion of mass and the complexity of randomized geometric algorithms, Nash inequalities for finite Markov chains, Normalizing constants of log-concave densities, Unnamed Item, The Shapley value for cooperative games under precedence constraints, Random Construction of Interpolating Sets for High-Dimensional Integration, A sharp isoperimetric bound for convex bodies, Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm, Computational complexity of stochastic programming problems, A slowly mixing Markov chain with implications for Gibbs sampling, Approximation of convex sets by polytopes, A random polynomial time algorithm for well-routing convex bodies, Isoperimetric inequalities in Euclidean convex bodies, Polynomial-time counting and sampling of two-rowed contingency tables, Balanced pairs in partial orders, Faster random generation of linear extensions, Approximation algorithms for the normalizing constant of Gibbs distributions
