Applications of size biased couplings for concentration of measures

Let $Y$ be a nonnegative random variable with mean $\mu$ and finite positive variance $\sigma^2$, and let $Y^s$, defined on the same space as $Y$, have the $Y$ size biased distribution, that is, the distribution characterized by $$ E[Yf(Y)]=\mu E f(Y^s) \quad \mbox{for all functions $f$ for which these expectations exist.} $$ Under a variety of conditions on the coupling of $Y$ and $Y^s$, including combinations of boundedness and monotonicity, concentration of measure inequalities such as $$ P\left(\frac{Y-\mu}{\sigma}\ge t\right)\le \exp\left(-\frac{t^2}{2(A+Bt)}\right) \quad \mbox{for all $t \ge 0$} $$ are shown to hold for some explicit $A$ and $B$ in \cite{cnm}. Such concentration of measure results are applied to a number of new examples: the number of relatively ordered subsequences of a random permutation, sliding window statistics including the number of $m$-runs in a sequence of coin tosses, the number of local maxima of a random function on a lattice, the number of urns containing exactly one ball in an urn allocation model, and the volume covered by the union of $n$ balls placed uniformly over a volume $n$ subset of $\mathbb{R}^d$.

[1]  Larry Goldstein,et al.  Size bias, sampling, the waiting time paradox, and infinite divisibility: when is the increment independent? , 2010, 1007.3910.

[2]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[3]  Subhankar Ghosh,et al.  Concentration of measures via size-biased couplings , 2009, 0906.3886.

[4]  Louis H. Y. Chen Poisson Approximation for Dependent Trials , 1975 .

[5]  D L Streiner,et al.  An Introduction to Multivariate Statistics , 1993, Canadian journal of psychiatry. Revue canadienne de psychiatrie.

[6]  Normal approximation for coverage models over binomial point processes , 2008, 0812.3084.

[7]  C. Stein Approximate computation of expectations , 1986 .

[8]  P. A. P. Moran The random volume of interpenetrating spheres in space , 1973 .

[9]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[10]  Andrew D. Barbour,et al.  Compound Poisson approximation: a user's guide , 2001 .

[11]  Richard S. Bird,et al.  An introduction to the theory of lists , 1987 .

[12]  A. Barbour,et al.  Poisson Approximation , 1992 .

[13]  Louis H. Y. Chen,et al.  An Introduction to Stein's Method , 2005 .

[14]  Yosef Rinott,et al.  Multivariate normal approximations by Stein's method and size bias couplings , 1996 .

[15]  A Berry Esseen Theorem for the Lightbulb Process , 2010, 1001.0612.

[16]  S. Chatterjee A NEW METHOD OF NORMAL APPROXIMATION , 2006, math/0611213.

[17]  Martin Raič CLT-related large deviation bounds based on Stein's method , 2007, Advances in Applied Probability.

[18]  Hua Zhou,et al.  Composition Markov chains of multinomial type , 2009, Advances in Applied Probability.

[19]  Neil O'Connell,et al.  Some large deviation results for sparse random graphs , 1998 .

[20]  M. P. Quine,et al.  A Berry-Esseen Bound for an Occupancy Problem , 1982 .

[21]  Claudia Klüppelberg,et al.  Some Aspects of Insurance Mathematics , 1994 .

[22]  C. J. Park Random Allocations (Valentin F. Kolchin, Boris A. Sevast’yanov and Vladimir P. Chistyakov) , 1980 .

[23]  P. Diaconis,et al.  Trailing the Dovetail Shuffle to its Lair , 1992 .

[24]  J. Yukich,et al.  Central limit theorems for some graphs in computational geometry , 2001 .

[25]  Donald L. Iglehart,et al.  Probability, Statistics, and Mathematics: Papers in Honor of Samuel Karlin , 1989 .

[26]  Berry Esseen Bounds for Combinatorial Central Limit Theorems and Pattern Occurrences, using Zero and Size Biasing , 2005, math/0511510.

[27]  J. Seaman Introduction to the theory of coverage processes , 1990 .

[28]  S. S. Wilks CERTAIN GENERALIZATIONS IN THE ANALYSIS OF VARIANCE , 1932 .

[29]  Louis H. Y. Chen,et al.  Normal Approximation by Stein's Method , 2010 .

[30]  G. Reinert,et al.  Multivariate normal approximation with Stein’s method of exchangeable pairs under a general linearity condition , 2007, 0711.1082.

[31]  M. Ledoux The concentration of measure phenomenon , 2001 .

[32]  Calyampudi R. Rao,et al.  One Bulb? Two Bulbs? How Many Bulbs Light Up? - A Discrete Probability Problem Involving Dermal Patches , 2007 .

[33]  Mathew D. Penrose,et al.  Normal Approximation for Isolated Balls in an Urn Allocation Model , 2009, 0901.3493.

[34]  S. Chatterjee Stein’s method for concentration inequalities , 2006, math/0604352.

[35]  F. Steutel Some recent results in infinite divisibility , 1973 .

[36]  L. Gordon Bounds for the Distribution of the Generalized Variance , 1989 .

[37]  JI f. Some Large Deviation Results for Sparse Random Graphs , 2001 .

[38]  Pierre Baldi,et al.  A Normal Approximation for the Number of Local Maxima of a Random Function on a Graph , 1989 .

[39]  Gunnar Englund,et al.  A Remainder Term Estimate for the Normal Approximation in Classical Occupancy , 1981 .

[40]  Hiroshi Midzuno,et al.  On the sampling system with probability proportionate to sum of sizes , 1951 .

[41]  C. Stein A bound for the error in the normal approximation to the distribution of a sum of dependent random variables , 1972 .

[42]  Andrzej Rucinski,et al.  A central limit theorem for decomposable random variables with applications to random graphs , 1989, J. Comb. Theory B.