Some probabilistic aspects of set partitions

American Mathematical Monthly

Volumn 104, Issue 3, 1997, Pages 201-209

  Pitman, Jim ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031532214     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2974785     Document Type: Article

References (59)

1. R. Arratia and S. Tavaré. The cycle structure of random permutations, Ann. Prob., 20:1567-1591, 1992.
2. R. Arratia and S. Tavaré. Independent process approximations for random combinatorial structures, Adv. Math., 104:90-154, 1994.
3. E. T. Bell. Exponential numbers, Amer. Math. Monthly, 41:411-419, 1934.
4. E. T. Bell. Exponential polynomials, Annals of Mathematics, 35:258-277, 1934.
5. C. Berge. Principles of Combinatorics. Academic Press, New York and London, 1971.
6. P. Billingsley. Probability and Measure, 2nd ed. Wiley, New York, 1986.
7. C. R. Blyth and P. K. Pathak. A note on easy proofs of Stirling's theorem, Amer. Math. Monthly, 93:376-379, 1986.
8. A. Di Bucchianico. Representations of Sheffer polynomials, Studies in Applied Math., 93:1-14, 1994.
9. Ch. A. Charalambides and J. Singh. A review of the Stirling numbers, their generalizations and statistical applications, Commun. Statist .-Theory Meth., 17:2533-2595, 1988.
10. B. Chen and Y.-N. Yeh. Some explanations of Dobinski's formula. Studies in Applied Math., 92:191-199, 1994.
11. L. Comtet. Advanced Combinatorics. D. Reidel Pub. Co., Boston, 1974. (translated from French).
12. G. M. Constantine and T. H. Savits. A stochastic representation of partition identities, SLAM J. Discrete Math., 7:194-202, 1994.
13. K. Dale and I. Skau. The (generalized) secretary's packet problem and the Bell numbers, Discrete Math., 137:357-360, 1995.
14. F. N. David and D. E. Barton. Combinatorial Chance. Griffins, London, 1962.
15. J. M. DeLaurentis and B. G. Pittel. Counting subsets of the random partition and the 'Brownian bridge' process, Stochastic Processes and their Applications, 15:155-167, 1983.
16. P. Diaconis and D. Freedman. An elementary proof of Stirling's formula, Amer. Math. Monthly, 93:123-125, 1986.
17. P. Diaconis and M. Shahshahani. On the eigenvalues of random matrices, J. Applied Probability, Special vol. 31A:49-62, 1994.
18. m/n! für m = 1, 2, 3, 4, 5, . . . , Grunert Archiv (Arch. für Mat. und Physik), 61:333-336, 1877.
19. E. B. Dynkin. Gaussian and non-Gaussian random fields associated with Markov processes, J. Funct. Anal., 55:344-376, 1984.
20. W. Feller. An Introduction to Probability Theory and its Applications, Vol. 1, 3rd ed. Wiley, New York, 1968.
21. Ph. Flajolet, P. Zimmerman, and B. V. Cutsem. A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, 132:1-35, 1994.
22. D. Foata. La série génératrice exponentielle dans les problèmes d'énumeration, volume 54 of Séminaire de Mathématiques supérieures. Presses de l'Université de Montréal, 1974.
23. B. Fristedt. The structure of partitions of large sets, Technical Report 86-154, University of Minnesota Mathematics Dept., Minneapolis, Minnesota, 1987.
24. M. Gardner. Fractal music, hypercards and more - : mathematical recreations from Scientific American magazine. W.H. Freeman, New York, 1992.
25. C. D. Godsil. Algebraic Combinatorics. Chapman & Hall, New York, 1993.
26. W. M. Y. Goh and E. Schmutz. Random set partitions, SIAM J. Discrete Math., 7:419-436, 1994.
27. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics: a foundation for computer science, 2nd ed. Addison-Wesley, Reading, Mass., 1989.
28. J. Haigh. Random equivalence relations, Journal of Combinatorial Theory, 13:287-295, 1972.
29. L. H. Harper. Stirling behavior is asymptotically normal, Ann. Math. Stat., 38:410-414, 1966.
30. L. Holst. On numbers related to partitions of unlike objects and occupancy problems, Europ. J. Combinatorics, 2:231-237, 1981.
31. J. O. Irwin. A unified derivation of some well-known frequency distribution of interest in biometry and statistics, J.R. Statist. Soc., 118:389-404, 1955.
32. G. D. James and A. Kerber. The representation theory of the symmetric group, volume 16 of Encyclopedia of mathematics and its applications. Addison-Wesley, Reading, Mass., 1981.
33. J. F. C. Kingman. Poisson Processes. Clarendon Press, Oxford, 1993.
34. V. F. Kolchin, B. A. Sevastyanov, and V. P. Christyakov. Random Allocations. V. H. Winston & Sons, Washington, D. C., 1978.
35. P. S. Laplace. Théorie Analytique des Probabilités, 2nd ed.. Paris, 1814.
36. L. Lovász. Combinatorial Problems and Exercises, 2nd ed. North-Holland, Amsterdam, 1993.
37. A. Lupas. Dobiński-type formula for binomial polynomials, Stud. Univ. Babes-Bolyai Math., 33(2):40-44, 1988.
38. V. Namias. A simple derivation of Stirling's asymptotic series, Amer. Math. Monthly, 93:25-29, 1986.
39. A. Nijenhuis and H. S. Wilf. A method and two algorithms on the theory of partitions, J. Combin. Theory A, 18:219-222, 1975.
40. A. Nijenhuis and H. S. Wilf. Combinatorial algorithms for computers and calculators, 2nd ed. Academic Press, New York, 1978.
41. A. M. Odlyzko. Asymptotic enumeration methods, in R. L. Graham, M. Grötschel, and L. Lovász, editors, Handbook of Combinatorics Vol. II, pp. 1063-1229. Elsevier, New York, 1995.
42. C. Philipson. A note on the moments of a Poisson probability distribution, Skand. Aktuarietidskrift, 46:243-4, 1963.
43. J. Pitman, Probability. Springer-Verlag, New York, 1993.
44. J. Pitman. Probabilistic bounds on the coefficients of polynomials with only real zeros, Technical Report 453, Dept. Statistics, U.C. Berkeley, 1996. To appear in J. Comb. Theory A.
45. J. Pitman. Probabilistic bounds on the coefficients of polynomials with only real zeros, Technical Report 453, Dept. Statistics, U.C. Berkeley, 1996. To appear in J. Comb. Theory A.
46. C. Reid. The search for E. T. Bell: also known as John Taine. MAA Spectrum. Mathematical Association of America, Washington, DC, 1993.
47. J. Riordan. Moment recurrence relations for the binomial Poisson and hypergeometric probability distributions, Ann. Math. Stat., 8:103-111, 1937.
48. J. Riordan. An Introduction to Combinatorial Analysis. Wiley, New York, 1958.
49. J. Riordan. Combinatorial Identities. Wiley, New York, 1968.
50. S. Roman. The Umbral Calculus. Academic Press, New York, 1984.
51. G.-C. Rota. The number of partitions of a set, Amer. Math. Monthly, 71:498-504, 1964.
52. V. N. Sachkov. Random partitions of sets, Theory Probab. Appl., 19:184-190, 1973.
53. A. J. Stam. Polynomials of binomial type and compound Poisson processes, Journal of Mathematical Analysis and Applications, 130:151, 1988.
54. A. J. Stam. Generation of a random partition of a set by an urn model, J. Combin. Theory A, 35:231-240, 1983.
55. R. P. Stanley. Enumerative Combinatorics, Vol I. Wadsworth & Brooks/Cole, Monterey, California, 1986.
56. J. M. Steele. Gibbs' measures on combinatorial objects and the central limit theorem for an exponential family of random trees, Probability in the Engineering and Informational Sciences, 1:47-59, 1987.
57. L. Takács. The problem of coincidences, Arch. Hist. Exact. Sci., 21:229-244, 1980.
58. V. A. Vatutin and V. G. Mikhailov. Limit theorems for the number of empty cells in an equiprobable scheme for group allocation of particles, Theory of Probability and its Applications (Trans. of Teorija Verojatnostei i ee Primenenija), 27:734-743, 1982.
59. H. Wilf. Generatingfunctionology. Academic Press, San Diego, 1990.