Bins and balls: Large deviations of the empirical occupancy process

Annals of Applied Probability

Volumn 12, Issue 2, 2002, Pages 607-636

  Boucheron, Stéphane ^a   Gamboa, Fabrice ^b,d   Léonard, Christian ^c,e  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

^c UNIVERSITÉ PARIS OUEST NANTERRE LA DÉFENSE   (France)

^d CNRS   (France)

^e CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

Author keywords

Large deviations; Occupancy; Orlicz spaces; Poisson approximation; Random graphs; Sanov theorem

Indexed keywords

EID: 0036338068     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1026915618     Document Type: Article

References (28)

1. BARBOUR, A., HOLST, L. and JANSON, S. (1992). Poisson Approximation. Clarendon Press, London.
2. BARTLETT, M. S. (1938). The characteristic function of a conditional statistic. J. London Math. Soc. 13 62-67.
3. BOLLOBÀS, B. (1985). Random Graphs. Academic Press, New York.
4. BOLLOBÀS, B. and FRIEZE, A. M. (1985). On matching and Hamiltonian cycles in random graphs. In Random Graphs 83. Annals of Discrete Mathematics 28 23-46.
5. BOUCHERON, S. and GARDY, D. (1997). An urn model from learning theory. Random Structures Algorithms 10 43-67.
6. CHVATAL, V. (1991). Almost all graphs with 1.44 edges are 3 colourable. Random Structures Algorithms 2 11-28.
7. DEMBO, A., VERSHIK, A. and ZEITOUNI, O. (2000). Large deviations for integer partitions. Markov Process. Related Fields 6 147-179.
8. DEMBO, A. and ZEITOUNI, O. (1999). Large Deviation Techniques and Applications. Springer, New York.
9. ETHIER, S. and KURTZ, T. G. (1986). Markov Processes, Characterization and Convergence. Wiley, New York.
10. FELLER, W. (1968). Probability Theory. Wiley, New York.
11. GILES, J. R. (1992). Convex analysis with application in the differentiation of convex functions. In Research Notes in Math. 58. Pitman, London.
12. JOHNSON, N. L. and KOTZ, S. (1977). Urn Models and Their Application. An Approach to Modern Discrete Probability Theory. Wiley, New York.
13. KOLCIN, V. F., SEVAST'JANOV, B. A. and CISTJAKOV, V. P. (1978). Random Allocations. Wiley, New York.
14. LÉONARD, C. (1995). Large deviations for particle systems associated with spatially homogeneous Boltzmann type equations. Probab. Theory Related Fields 101 1-44.
15. LÉONARD, C. (2000). Minimizers of energy functional under not very integrable constraints. Preprint.
16. LÉONARD, C. and NAJIM, J. (2000). An extension of Sanov's theorem, Application to the Gibbs conditioning principle. Preprint.
17. MCKAY, B. D. and WORMALD, N. C. (1998). The degree sequence of a random graph. Random Structures Algorithms 11 97-117.
18. MORRIS, C. (1975). Central Limit Theorems for multinomial sums. Ann. Statist. 3 165-168.
19. PALKA, Z. (1984). On the number of vertices of given degree in a random graph. J. Graph Theory 8 267-270.
20. PITTEL, B., SPENCER, J. and WORMALD, N. (1996). Sudden emergence of a giant k-core in a random graph. J. Combin. Theory Ser. B 67 111-151.
21. QUINE, M. P. (1979). A functional Central Limit Theorem for generalized occupancy numbers. Stochastic Process. Appl. 9 109-115.
22. QUINE, M. P. and ROBINSON, J. (1982). A Berry-Essen bound for an occupancy problem. Ann. Probab. 10 663-671.
23. QUINE, M. P. and ROBINSON, J. (1984). Normal approximations to sums of scores based on occupancy numbers. Ann. Probab. 12 794-804.
24. RAO, R. and REN, R. (1991). Theory of Orlicz Spaces. Marcel Dekker, New York.
25. ROCKAFELLAR, R. T. (1968). Integrals which are convex functionals. Pacific J. Math. 24 525-538.
26. SION, M. (1958). On general Minimax theorems. Pacific J. Math. 8 171-176.
27. VARADHAN, S. R. S. (1984). Large Deviations and Applications. SIAM, Philadelphia.
28. VITTER, J. S. and FLAJOLET, P. (1990). Average-case analysis of algorithms and data structures. In Handbook of Theoretical Computer Science A (J. Van Leeuwen, ed.) 431-524. Elsevier, Amsterdam.