COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Combinatorics Seminar > Tight anti-concentration of Rademacher sums
Tight anti-concentration of Rademacher sumsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact ibl10. We consider lower bounds on anti-concentration probabilities of the form P(|X| >= x), where X = a_1 ε_1 ... a_n ε_n is a Rademacher sum; ε_i are independent and uniform signs +1 or -1, and a_i > 0 are constants normalised so that Var(X) = 1. We determine the infimal value of P(|X| >= x) over Rademacher sums X for all values x >= 0, giving a partial answer to a question by Keller and Klein. In particular, for x = 1 we improve on a sequence of results to produce the optimal lower bound P(|X| >= 1) >= 7/32, confirming a conjecture of Hitczenko and Kwapień. This talk is part of the Combinatorics Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCausal Inference Reading Group Annual Disability Lecture Entrepreneurship Centre at Cambridge Judge Business SchoolOther talksCambridge RNA Club - June session IN PERSON Machine learning: applications to cancer GIT for linear systems of hypersurfaces ‘The Glorious Revolution that Wasn’t: Rural Elite Conflict and Demand for Democratization in Khedival Egypt’ (Co-authored with Allison Spencer Hartnett) Regional Variation of GDP per Head within China, 1080-1850: Implications for the Great Divergence Debate Zoe Todd on Prebiotic Chemistry in a Planetary Context |