An Urn Model from Learning Theory

Random Structures and Algorithms

Volumn 10, Issue 1-2, 1997, Pages 43-67

  Boucheron, Stéphane ^a   Gardy, Danièle ^b  

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

^b UNIVERSITY OF VERSAILLES   (France)

Author keywords

Bessel functions; Exchangeable variables; Gaussian process; Generating function; Urn models

Indexed keywords

EID: 0031539969     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199701/03)10:1/2<43::aid-rsa3>3.0.co;2-x     Document Type: Article

References (21)

1. D. Barraez, Diametro de transmission, ciclos dominantes y el problema classica de colocaciones, Ph.D. thesis, Universidad de Caracas, Venezuela, 1994.
2. E. A. Bender and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration, ii: Multivariate generating functions, J. Combinat. Theor. Ser. A, 34, 255-265 (1983).
3. H. E. Daniels, Saddlepoint approximations in statistics, Ann. Math. Stat., 25, 631-650 (1954).
4. P. Diaconis and D. Freedman, A dozen de Finetti-style results in search of a theory, Ann. Inst. H. Poincaré, 23(2), 397-423 (1987).
5. P. Flajolet and M. Soria, Gaussian limiting distributions for the number of components in combinatorial structures, J. Combinat. Theor. Ser. A, 53(2), 165-182 (1990).
6. P. Flajolet and J. Vitter, in Handbook of Theoretical Computer Science, Average-case analysis of algorithms and data structures, J. Van Leeuwen, Ed., North-Holland, Amsterdam, 1989.
7. D. Gardy, Méthode de col et lois limites en analyse combinatoire, Theor. Comput. Sci. Part A, 94(2), 261-280 (1992).
8. D. Gardy, Join sizes, urn models and normal limiting distributions, Theor. Comput. Sci. Part A, 131, 375-414 (1994).
9. D. Gardy, Some results on the asymptotic behaviour of coefficients of large powers of functions, Discrete Math., 139, 189-217 (1995).
10. I. J. Good, Saddle-point methods for the multinomial distribution, Ann. Math. Stat., 28, 861-881 (1957).
11. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
12. D. Haussler, M. Kearns, H. S. Seung, and N. Tishby, Rigorous learning curve bounds from statistical mechanics, Proc. 7th Annual ACM Workshop on Computer Learning Theory, ACM Press, New York, 1994, pp. 76-87.
13. N. L. Johnson and S. Kotz, Urn Models and Their Application, Wiley, New York, 1977.
14. M. Kearns and U. Vazirani, Topics in Learning Theory, MIT Press, Cambridge, MA, 1994.
15. V. Kolchin, B. Sevast'yanov, and V. Chistyakov, Random Allocations, Wiley, New York, 1978.
16. K. Nishimura and M. Sibuya, Occupancy with two types of balls, Ann. Inst. Stat. Math., 40(1), 77-91 (1988).
17. T. Yu. Popova, Limit theorems in a model of distribution of particles of two types, SIAM J. Theor. Probab. Appl., 511-516 (1967).
18. B. I. Selivanov, On waiting time in the schema of random allocation of colored particles, Discrete Math. Appl., 5(1), 73-82 (1995).
19. H. S. Seung, H. Sompolinsky, and N. Tishby, Statistical mechanics of learning from examples, Phys. Rev. A, 45(8), 6056-6091 (1992).
20. G. N. Watson, Theory of Bessel Functions, Cambridge University Press, Cambridge, UK, 1922, 2nd ed., 1941.
21. E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, 4th ed., Cambridge University Press, Cambridge, UK, 1927.