Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
暂无分享,去创建一个
Jay Bartroff | Larry Goldstein | Umit Icslak | L. Goldstein | J. Bartroff | Um.it Icslak | Umit Icslak
[1] Martin Raič,et al. Concentration of measure for the number of isolated vertices in the Erdős–Rényi random graph by size bias couplings , 2011, 1106.0048.
[2] J. Keilson,et al. Some Results for Discrete Unimodality , 1971 .
[3] F. Chung,et al. Complex Graphs and Networks , 2006 .
[4] M. Bagnoli,et al. Log-concave probability and its applications , 2004 .
[5] Gunnar Englund,et al. A Remainder Term Estimate for the Normal Approximation in Classical Occupancy , 1981 .
[6] Noga Alon,et al. The Probabilistic Method, Third Edition , 2008, Wiley-Interscience series in discrete mathematics and optimization.
[7] B. Efron,et al. Did Shakespeare write a newly-discovered poem? , 1987 .
[8] Gábor Lugosi,et al. Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.
[9] C. Stein. Approximate computation of expectations , 1986 .
[10] I. Weiss. Limiting Distributions in Some Occupancy Problems , 1958 .
[11] Bruce A. Reed,et al. Concentration for self‐bounding functions and an inequality of Talagrand , 2006, Random Struct. Algorithms.
[12] P. McCullagh. Estimating the Number of Unseen Species: How Many Words did Shakespeare Know? , 2008 .
[13] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[14] Jay Bartroff,et al. A Berry-Esseen bound for the uniform multinomial occupancy model , 2012, 1202.0909.
[15] L. Goldstein. A Berry–Esseen bound with applications to vertex degree counts in the Erdős–Rényi random graph , 2010, 1005.4390.
[16] N. Starr. Linear Estimation of the Probability of Discovering a New Species , 1979 .
[17] Ronald E. Harrel. SPHERE PACKINGS (Universitext) , 2001 .
[18] W. Ehm. Binomial approximation to the Poisson binomial distribution , 1991 .
[19] C. Stein. A bound for the error in the normal approximation to the distribution of a sum of dependent random variables , 1972 .
[20] Andrzej Rucinski,et al. A central limit theorem for decomposable random variables with applications to random graphs , 1989, J. Comb. Theory B.
[21] K. Joag-dev,et al. Negative Association of Random Variables with Applications , 1983 .
[22] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[23] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[24] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .
[26] Subhankar Ghosh,et al. Concentration of measures via size-biased couplings , 2009, 0906.3886.
[27] Subhankar Ghosh,et al. Applications of size biased couplings for concentration of measures , 2011 .
[28] Richard Arratia,et al. Bounded size bias coupling: a Gamma function bound, and universal Dickman-function behavior , 2013, 1306.0157.
[29] Patrick Thiran,et al. Latency of wireless sensor networks with uncoordinated power saving mechanisms , 2004, MobiHoc '04.
[30] A. Rucinski,et al. Poisson convergence and semi-induced properties of random graphs , 1987, Mathematical Proceedings of the Cambridge Philosophical Society.
[31] Normal approximation for coverage models over binomial point processes , 2008, 0812.3084.
[32] Larry Goldstein,et al. Size biased couplings and the spectral gap for random regular graphs , 2015, 1510.06013.
[33] B. Efron. Increasing Properties of Polya Frequency Function , 1965 .
[34] Larry Goldstein,et al. Size bias for one and all , 2013, Probability Surveys.
[35] Nathan Ross. Fundamentals of Stein's method , 2011, 1109.1880.
[36] Martin Raič,et al. Normal Approximation by Stein ’ s Method , 2003 .
[37] Richard H. Liang. Stein ’ s method for concentration inequalities , 2007 .
[38] Yosef Rinott,et al. Multivariate normal approximations by Stein's method and size bias couplings , 1996 .
[39] Stefan Grosskinsky Warwick,et al. Interacting Particle Systems , 2016 .
[40] B. Efron,et al. Estimating the number of unseen species: How many words did Shakespeare know? Biometrika 63 , 1976 .
[41] J. Darroch. On the Distribution of the Number of Successes in Independent Trials , 1964 .
[42] Peter J. Bickel,et al. On estimating the total probability of the unobserved outcomes of an experiment , 1986 .
[43] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .
[44] Jenny Andersson,et al. The influence of grain size variation on metal fatigue , 2005 .
[45] Stochastic Orders , 2008 .
[46] S. Janson,et al. The asymptotic distributions of generalized U-statistics with applications to random graphs , 1991 .
[47] A. Chao,et al. Estimating the number of species via a martingale estimating function , 1996 .
[48] M. Ledoux. The concentration of measure phenomenon , 2001 .
[49] M. Talagrand. Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.
[50] Thomas C. Hales. Sphere packings, I , 1997, Discret. Comput. Geom..
[51] Mathew D. Penrose,et al. Normal Approximation for Isolated Balls in an Urn Allocation Model , 2009, 0901.3493.
[52] Mark A. McComb. Comparison Methods for Stochastic Models and Risks , 2003, Technometrics.
[53] G. Reinert,et al. Joint Vertex Degrees in the Inhomogeneous Random Graph Model ℊ(n,{pij }) , 2012, Advances in Applied Probability.
[54] J. Pach,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[55] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.