Random weighting, asymptotic counting, and inverse isoperimetry

DOI10.1007/s11856-007-0008-8zbMath1204.60014arXivmath/0302177OpenAlexW2127007261MaRDI QIDQ995359

Alex Samorodnitsky, Alexander I. Barvinok

Publication date: 3 September 2007

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0302177

zbMATH Keywords

weightssymmetric probability distributioncomputationally efficient approximation algorithmsinverse isoperimetric problemisoperimetric inequalities in the Boolean cube

Mathematics Subject Classification ID

Combinatorial probability (60C05) Extremal set theory (05D05)

Related Items

Hafnians, perfect matchings and Gaussian matrices, Asymptotic Properties of Random Weighted Empirical Distribution Function, Weighted probability density estimator with updated bandwidths, Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid, Weak convergence for random weighting estimation of smoothed quantile processes, A bound for the number of vertices of a polytope with applications, Random weighting estimation of kernel density, Random Weighting Estimation of Confidence Intervals for Quantiles, Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An asymptotic isoperimetric inequality
• Sudakov minoration principle and supremum of some processes
• Concentration of measure and isoperimetric inequalities in product spaces
• The asymptotic distribution of the trimmed mean
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• The Supremum of Some Canonical Processes
• The distance approach to approximate combinatorial counting