Six ways of looking at Burtin's lemma

American Mathematical Monthly

Volumn 106, Issue 4, 1999, Pages 345-351

  Anoulova, S ^a   Bennies, J ^a   Lenhard, J ^a   Metzler, D ^a   Sung, Y ^a   Weber, A ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033247631     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2589557     Document Type: Article

References (9)

1. B. Bollobas, Graph Theory: An Introductory Course, Springer Verlag (1979), Graduate Texts in Mathematics 63.
2. Y. D. Burtin, On a Simple Formula for Random Mappings and its Applications, J. Appl. Prob. 17 (1980) 403-414.
3. j), J. Appl. Prob. 21 (1984), 186-191.
4. L. Kac, Probability of Indecomposability of a Random Mapping Function, Ann. Math. Statist. 26 (1955) 512-517.
5. D. E. Knuth, The Art of Computer Programming, Vol.1 (1968), Addison Wesley.
6. M. D. Kruskal, The Expected Number of Components Under a Random Mapping Function, Amer. Math. Monthly 61 (1954) 392-397.
7. N. Metropolis and S. Ulam, A Property of Randomness of an Arithmetical Function, Amer. Math. Monthly 60 (1953) 252-253.
8. J. G. Propp and D. B. Wilson, How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph, preprint (1998), http://dimacs.rutgers.edu/ ~ dbwilson/exact.html/
9. S. M. Ross, A Random Graph, J. Appl. Prob. 18 (1981), 309-315