The geometry of logconcave functions and sampling algorithms

Authors:
László Lovász;Santosh Vempala
Affiliations:
Microsoft Research, One Microsoft Way, Redmond, Washington;Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
Random Structures & Algorithms
Year:
2007

Citing 8
Cited 12

A random polynomial time algorithm for approximating the volume of convex bodies

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Approximating the permanent

SIAM Journal on Computing
Sampling and integration of near log-concave functions

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Random walks and an O*(n5) volume algorithm for convex bodies

Random Structures & Algorithms
Faster mixing via average conductance

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient algorithms for universal portfolios

The Journal of Machine Learning Research
Solving convex programs by random walks

Journal of the ACM (JACM)
Hit-and-Run from a Corner

SIAM Journal on Computing

Logconcave random graphs

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Robust PCA and clustering in noisy mixtures

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Random walks on polytopes and an affine interior point method for linear programming

Proceedings of the forty-first annual ACM symposium on Theory of computing
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Spectral Algorithms

Foundations and Trends® in Theoretical Computer Science
Learning Halfspaces with Malicious Noise

The Journal of Machine Learning Research
Efficiently learning mixtures of two Gaussians

Proceedings of the forty-second ACM symposium on Theory of computing
A random-sampling-based algorithm for learning intersections of halfspaces

Journal of the ACM (JACM)
Thin partitions: isoperimetric inequalities and a sampling algorithm for star shaped bodies

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On sampling from multivariate distributions

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximation to the expected width, and the correlation ...