Compound random mappings

Journal of Applied Probability

Volumn 39, Issue 4, 2002, Pages 712-729

  Hansen, Jennie C ^a   Jaworski, Jerzy ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Component structure; Poisson Dirichlet distribution; Random mappings

Indexed keywords

EID: 0037000639     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1037816014     Document Type: Article

References (39)

1. ALDOUS, D. (1985). Exchangeability and Related Topics (Lecture Notes Math. 1117). Springer, New York.
2. ANOULOVA, S. et al. (1999). Six ways of looking at Burtin's lemma. Amer. Math. Monthly 106, 345-351.
3. ARRATIA, R. AND TAVARÉ, S. (1992). Limit theorems for combinatorial structures via discrete process approximations. Random Structures Algorithms 3, 321-345.
4. ARRATIA, R., BARBOUR, A. D. AND TAVARÉ, S. (2000). Limits of logarithmic combinatorial structures. Ann. Prob. 28, 1620-1644.
5. ARRATIA, R., STARK, D. AND TAVARÉ, S. (1995). Total variation asymptotics for Poisson process approximations of logarithmic combinatorial assemblies. Ann. Prob. 23, 1347-1388.
6. AUSTIN, T. L. (1959). The enumeration of point labelled chromatic graphs and trees. Canad. J. Math. 12, 535-545.
7. AUSTIN, T. L., FAGEN, R. E., PENNEY, W. F. AND RIORDAN, J. (1959). The number of components in random linear graphs. Ann. Math. Statist. 30, 747-754.
8. BALL, F., MOLLISON, D. AND SCALIA-TOMBA, G. (1997). Epidemics with two levels of mixing. Ann. Appl. Prob. 7, 46-89.
9. BERG, S. (1981). On snowball sampling, random mappings and related problems. J. Appl. Prob. 18, 283-290.
10. BERG, S. (1983). Random contact processes, snowball sampling and factorial series distributions. J. Appl. Prob. 20, 31-46.
11. BOLLOBÁS, B. (1985). Random Graphs. Academic Press, London.
12. BURTIN, Y. D. (1980). On a simple formula for random mappings and its applications. J. Appl. Prob. 17, 403-414.
13. DIACONIS, P. AND HOLMES, S. (2002). A Bayesian peek into Feller Volume 1. To appear in Sankhyā
14. FELLER, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.
15. FOLKERT, J. E. (1955). The distribution of the number of components of a random mapping function. Doctoral Thesis, Michigan State University.
16. FORD, G. W. AND UHLENBECK, G. E. (1957). Combinatorial problems in the theory of graphs. Proc. Nat. Acad. Sci. USA 43, 163-167.
17. GERTSBAKH, I. B. (1977). Epidemic processes on a random graph: some preliminary results. J. Appl. Prob. 14, 427-438.
18. HANSEN, J. C. (1989). A functional central limit theorem for random mappings. Ann. Prob. 17, 317-332.
19. HANSEN, J. C. (1994). Order statistics for decomposable combinatorial structures. Random Structures Algorithms 5, 517-533.
20. HANSEN, J. C. (1997). Limit laws for the optimal directed tree with random costs. Combin. Prob. Comput. 6, 315-335.
21. HANSEN, J. C. AND JAWORSKI, J. (2000). Large components of bipartite random mappings. Random Structures Algorithms 17, 317-342.
22. HANSEN, J. C. AND SCHMUTZ, E. (2001). Near-optimal bounded-degree spanning trees. Algorithmica 29, 148-180.
23. HARDY, G. H., LITTLEWOOD, J. E. AND PÓLYA, G. (1952). Inequalities. Cambridge University Press.
24. HARRIS, B. (1960). Probability distribution related to random mappings. Ann. Math. Statist. 31, 1045-1062.
25. JAWORSKI, J. (1981). On the connectedness of a random bipartite mapping. In Graph Theory (Lecture Notes Math. 1018), eds M. Berowiecki, J. W. Kennedy and M. M. Sysło, Springer, New York, pp. 69-74.
26. j). J. Appl. Prob. 21, 186-191.
27. JAWORSKI, J. (1985). A random bipartite mapping. Ann. Discrete Math. 28, 137-158.
28. JAWORSKI, J. (1990). Random mappings with independent choices of the images. In Random Graphs, Vol. 1. eds M. Karoński, J. Jaworski and A. Ruciński, John Wiley, Chichester, pp. 89-101.
29. JAWORSKI, J. (1998). Predecessors in a random mapping. Random Structures Algorithms 13, 501-519.
30. JAWORSKI, J. (1999). Epidemic processes on digraphs of random mappings. J. Appl. Prob. 36, 780-798.
31. KATZ, L. (1955). Probability of indecomposability of a random mapping function. Ann. Math. Statist. 26, 512-517.
32. KOLCHIN, V. F. (1986). Random Mappings. Optimization Software, New York.
33. MUTAFCHIEV, L. (1981). Epidemic processes on random graphs and their threshold function. Serdica 7, 153-159.
34. MUTAFCHIEV, L. (1982). A limit distribution related to random mappings and its application to an epidemic process. Serdica 8, 197-203.
35. MUTAFCHIEV, L. (1984). On some stochastic problems of discrete mathematics. In Proc. XIII Spring Conf. Union Bulgarian Mathematicians (Sunny Beach, April 1984), ed. G. Geror, Bulgarian Academy of Science, Sofia, pp. 57-80.
36. PITTEL, B. (1983). On distributions related to transitive closures of random finite mappings. Ann. Prob. 11, 428-441.
37. Ross, S. M. (1981). A random graph. J. Appl. Prob. 18, 309-315.
38. Ross, S. M. (1996). Stochastic Processes, 2nd edn. John Wiley, New York.
39. RUBIN, H. AND SITGREAVES, R. (1954). Probability distributions related to random transformations on a finite set. Tech. Rep. 19A, Applied Mathematics and Statistics Laboratory, Stanford University.