Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry

DOI10.1007/978-3-642-03685-9_32zbMATH Open1255.90091OpenAlexW1542156448MaRDI QIDQ3638895FDOQ3638895

Authors: Karthekeyan Chandrasekaran, Amit Deshpande, Santosh S. Vempala 

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_32

Recommendations

• On limiting laws for the convex hull of a sample
• The geometry of logconcave functions and sampling algorithms
• Sampling inequalities in Sobolev spaces
• scientific article; zbMATH DE number 5564091
• Log-Sobolev inequalities and sampling from log-concave distributions
• Sampling for approximating $R$-limited functions
• Function spaces in Lipschitz domains and optimal rates of convergence for sampling
• Sampling of probability measures in the convex order by Wasserstein projection

Mathematics Subject Classification ID

Convex programming (90C25) Sums of independent random variables; random walks (60G50) Convexity of real functions of several variables, generalizations (26B25)

Cited In (5)

• The difficulty of Monte Carlo approximation of multivariate monotone functions
• Sufficient ensemble size for random matrix theory-based handling of singular covariance matrices
• Title not available (Why is that?)
• An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
• On sampling from multivariate distributions

This page was built for publication: Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638895)