• Bernoulli
  • Volume 24, Number 4B (2018), 3283-3317.

Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models

Jay Bartroff, Larry Goldstein, and Ümit Işlak

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


Threshold-type counts based on multivariate occupancy models with log concave marginals admit bounded size biased couplings under weak conditions, leading to new concentration of measure results for random graphs, germ-grain models in stochastic geometry and multinomial allocation models. The results obtained compare favorably with classical methods, including the use of McDiarmid’s inequality, negative association, and self bounding functions.

Article information

Bernoulli, Volume 24, Number 4B (2018), 3283-3317.

Received: December 2016
Revised: May 2017
First available in Project Euclid: 18 April 2018

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

concentration coupling log concave occupancy Poisson Binomial distribution


Bartroff, Jay; Goldstein, Larry; Işlak, Ümit. Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models. Bernoulli 24 (2018), no. 4B, 3283--3317. doi:10.3150/17-BEJ961.

Export citation


  • [1] Alon, N. and Spencer, J.H. (2008). The Probabilistic Method, 3rd ed. Wiley-Interscience Series in Discrete Mathematics and Optimization. Hoboken, NJ: Wiley.
  • [2] Andersson, J. (2005). The influence of grain size variation on metal fatigue. Int. J. Fatigue 27 847–852.
  • [3] Arratia, R. and Baxendale, P. (2015). Bounded size bias coupling: A Gamma function bound, and universal Dickman-function behavior. Probab. Theory Related Fields 162 411–429.
  • [4] Arratia, R., Goldstein, L. and Kochman, F. (2013). Size bias for one and all. Preprint. Available at arXiv:1308.2729.
  • [5] Azuma, K. (1967). Weighted sums of certain dependent random variables. Tohoku Math. J. (2) 19 357–367.
  • [6] Bagnoli, M. and Bergstrom, T. (2005). Log-concave probability and its applications. Econom. Theory 26 445–469.
  • [7] Barbour, A.D., Karoński, M. and Ruciński, A. (1989). A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Theory Ser. B 47 125–145.
  • [8] Bartroff, J. and Goldstein, L. (2013). A Berry–Esseen bound for the uniform multinomial occupancy model. Electron. J. Probab. 18 no. 27, 1–29.
  • [9] Boucheron, S., Lugosi, G. and Massart, P. (2013). Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford: Oxford Univ. Press.
  • [10] Brown, M., Peköz, E.A. and Ross, S.M. (2011). Finding expectations of monotone functions of binary random variables by simulation, with applications to reliability, finance, and round Robin tournaments. In Stochastic Analysis, Stochastic Systems, and Applications to Finance 101–113. Hackensack, NJ: World Sci. Publ.
  • [11] Chao, A., Yip, P. and Lin, H.-S. (1996). Estimating the number of species via a martingale estimating function. Statist. Sinica 6 403–418.
  • [12] Chatterjee, S. (2007). Stein’s method for concentration inequalities. Probab. Theory Related Fields 138 305–321.
  • [13] Chen, L.H.Y., Goldstein, L. and Shao, Q.-M. (2011). Normal Approximation by Stein’s Method. Probability and Its Applications (New York). Heidelberg: Springer.
  • [14] Chung, F. and Lu, L. (2006). Complex Graphs and Networks. CBMS Regional Conference Series in Mathematics 107. Providence, RI: Amer. Math. Soc.
  • [15] Conway, J.H. and Sloane, N.J.A. (1999). Sphere Packings, Lattices and Groups, 3rd ed. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 290. New York: Springer.
  • [16] Cook, N., Goldstein, L. and Johnson, T. Size biased couplings and the spectral gap for random regular graphs. Ann. Probab. To appear.
  • [17] Dousse, O., Mannersalo, P. and Thiran, P. (2004). Latency of wireless sensor networks with uncoordinated power saving mechanisms. In Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing 109–120.
  • [18] Dubhashi, D. and Ranjan, D. (1998). Balls and bins: A study in negative dependence. Random Structures Algorithms 13 99–124.
  • [19] Efron, B. (1965). Increasing properties of Pólya frequency functions. Ann. Math. Stat. 36 272–279.
  • [20] Efron, B. and Thisted, R. (1976). Estimating the number of unseen species: How many words did Shakespeare know? Biometrika 63 435–448.
  • [21] Ehm, W. (1991). Binomial approximation to the Poisson binomial distribution. Statist. Probab. Lett. 11 7–16.
  • [22] Englund, G. (1981). A remainder term estimate for the normal approximation in classical occupancy. Ann. Probab. 9 684–692.
  • [23] Ghosh, S. and Goldstein, L. (2011). Concentration of measures via size-biased couplings. Probab. Theory Related Fields 149 271–278.
  • [24] Ghosh, S. and Goldstein, L. (2011). Applications of size biased couplings for concentration of measures. Electron. Commun. Probab. 16 70–83.
  • [25] Ghosh, S., Goldstein, L. and Raič, M. (2011). Concentration of measure for the number of isolated vertices in the Erdős–Rényi random graph by size bias couplings. Statist. Probab. Lett. 81 1565–1570.
  • [26] Goldstein, L. (2013). A Berry–Esseen bound with applications to vertex degree counts in the Erdős–Rényi random graph. Ann. Appl. Probab. 23 617–636.
  • [27] Goldstein, L. and Penrose, M.D. (2010). Normal approximation for coverage models over binomial point processes. Ann. Appl. Probab. 20 696–721.
  • [28] Goldstein, L. and Rinott, Y. (1996). Multivariate normal approximations by Stein’s method and size bias couplings. J. Appl. Probab. 33 1–17.
  • [29] Hoeffding, W. (1956). On the distribution of the number of successes in independent trials. Ann. Math. Stat. 27 713–721.
  • [30] Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13–30.
  • [31] Janson, S. and Nowicki, K. (1991). The asymptotic distributions of generalized $U$-statistics with applications to random graphs. Probab. Theory Related Fields 90 341–375.
  • [32] Joag-Dev, K. and Proschan, F. (1983). Negative association of random variables, with applications. Ann. Statist. 11 286–295.
  • [33] Karoński, M. and Ruciński, A. (1987). Poisson convergence and semi-induced properties of random graphs. Math. Proc. Cambridge Philos. Soc. 101 291–300.
  • [34] Keilson, J. and Gerber, H. (1971). Some results for discrete unimodality. J. Amer. Statist. Assoc. 66 386–389.
  • [35] Kolchin, V.F., Sevast’yanov, B.A. and Chistyakov, V.P. (1978). Random Allocations. Scripta Series in Mathematics. Washington, DC: V. H. Winston & Sons. Translated from the Russian, Translation edited by A. V. Balakrishnan.
  • [36] Kordecki, W. (1990). Normal approximation and isolated vertices in random graphs. In Random Graphs ’87 (Poznań, 1987) 131–139. Chichester: Wiley.
  • [37] Ledoux, M. (2001). The Concentration of Measure Phenomenon. Mathematical Surveys and Monographs 89. Providence, RI: Amer. Math. Soc.
  • [38] Liggett, T.M. (1985). Interacting Particle Systems. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 276. New York: Springer.
  • [39] Lin, K. and Reinert, G. (2012). Joint vertex degrees in the inhomogeneous random graph model $g(n,\{p_{ij}\})$. Adv. in Appl. Probab. 44 139–165.
  • [40] McDiarmid, C. (1989). On the method of bounded differences. In Surveys in Combinatorics, 1989 (Norwich, 1989). London Mathematical Society Lecture Note Series 141 148–188. Cambridge: Cambridge Univ. Press.
  • [41] McDiarmid, C. and Reed, B. (2006). Concentration for self-bounding functions and an inequality of Talagrand. Random Structures Algorithms 29 549–557.
  • [42] Müller, A. and Stoyan, D. (2002). Comparison Methods for Stochastic Models and Risks. Wiley Series in Probability and Statistics. Chichester: Wiley.
  • [43] Penrose, M.D. (2009). Normal approximation for isolated balls in an urn allocation model. Electron. J. Probab. 14 2156–2181.
  • [44] Rényi, A. (1962). Three new proofs and a generalization of a theorem of Irving Weiss. Magy. Tud. Akad. Mat. Kut. Intéz. Közl. 7 203–214.
  • [45] Robbins, H.E. (1968). Estimating the total probability of the unobserved outcomes of an experiment. Ann. Math. Stat. 39 256–257.
  • [46] Ross, N. (2011). Fundamentals of Stein’s method. Probab. Surv. 8 210–293.
  • [47] Schoenberg, I.J. (1951). On Pólya frequency functions. I. The totally positive functions and their Laplace transforms. J. Anal. Math. 1 331–374.
  • [48] Shaked, M. and Shanthikumar, J.G. (2007). Stochastic Orders. Springer Series in Statistics. New York: Springer.
  • [49] Sheridan, G., Jones, O., Nyman, P. and Lane, P. (2011). A stochastic germ-grain model to estimate wildfire induced debris flow risks in a changing climate. American Geophysical Union, Fall Meeting 2011, abstract #EP31B-0823.
  • [50] Starr, N. (1979). Linear estimation of the probability of discovering a new species. Ann. Statist. 7 644–652.
  • [51] Stein, C. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In Proc. Sixth Berkeley Symp. Math. Stat. Prob. 583–602.
  • [52] Stein, C. (1986). Approximate Computation of Expectations. Institute of Mathematical Statistics Lecture Notes—Monograph Series 7. Hayward, CA: IMS.
  • [53] Talagrand, M. (1995). Concentration of measure and isoperimetric inequalities in product spaces. Publ. Math. Inst. Hautes Études Sci. 81 73–205.
  • [54] Thisted, R. and Efron, B. (1987). Did Shakespeare write a newly-discovered poem? Biometrika 74 445–455.
  • [55] Weiss, I. (1958). Limiting distributions in some occupancy problems. Ann. Math. Stat. 29 878–884.
  • [56] Zong, C. (1999). Sphere Packings. Universitext. New York: Springer.