Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-10T02:07:24.431Z Has data issue: false hasContentIssue false
  • English
  • Français

Compound random mappings

Part of: Combinatorial probability Limit theorems Graph theory

Published online by Cambridge University Press:  14 July 2016

Jennie C. Hansen  and
Jerzy Jaworski
Jennie C. Hansen*
Affiliation:
Heriot-Watt University
Jerzy Jaworski*
Affiliation:
Adam Mickiewicz University
*
∗ Postal address: Department of Actuarial Mathematics and Statistics, Heriot-Watt University, Edinburgh EH14 4AS, UK. Email address: j.hansen@ma.hw.ac.uk
∗∗ Postal address: Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Poznań, Poland.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we introduce a compound random mapping model which can be viewed as a generalization of the basic random mapping model considered by Ross and by Jaworski. We investigate a particular example, the Poisson compound random mapping, and compare results for this model with results known for the well-studied uniform random mapping model. We show that, although the structure of the components of the random digraph associated with a Poisson compound mapping differs from the structure of the components of the random digraph associated with the uniform model, the limiting distribution of the normalized order statistics for the sizes of the components is the same as in the uniform case, i.e. the limiting distribution is the Poisson-Dirichlet (½) distribution on the simplex {{x i } : ∑ x i ≤ 1, x i ≥ x i+1 ≥ 0 for every i ≥ 1}.

Keywords

Random mappingsPoisson-Dirichlet distributioncomponent structure

MSC classification

Primary: 60C05: Combinatorial probability
Secondary: 60F05: Central limit and other weak theorems 05C80: Random graphs

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 39 , Issue 4 , December 2002 , pp. 712 - 729
Copyright
Copyright © Applied Probability Trust 2002 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]. Aldous, D. (1985). Exchangeability and Related Topics (Lecture Notes Math. 1117). Springer, New York.Google Scholar
[2]. Anoulova, S. et al. (1999). Six ways of looking at Burtin's lemma. Amer. Math. Monthly 106, 345–351.Google Scholar
[3]. Arratia, R. and Tavaré, S. (1992). Limit theorems for combinatorial structures via discrete process approximations. Random Structures Algorithms 3, 321–345.Google Scholar
[4]. Arratia, R., Barbour, A. D. and Tavaré, S. (2000). Limits of logarithmic combinatorial structures. Ann. Prob. 28, 1620–1644.Google Scholar
[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.Google Scholar
[6]. Austin, T. L. (1959). The enumeration of point labelled chromatic graphs and trees. Canad. J. Math. 12, 535–545.CrossRefGoogle Scholar
[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.Google Scholar
[8]. Ball, F., Mollison, D., and Scalia-Tomba, G. (1997). Epidemics with two levels of mixing. Ann. Appl. Prob. 7, 46–89.CrossRefGoogle Scholar
[9]. Berg, S. (1981). On snowball sampling, random mappings and related problems. J. Appl. Prob. 18, 283–290.Google Scholar
[10]. Berg, S. (1983). Random contact processes, snowball sampling and factorial series distributions. J. Appl. Prob. 20, 31–46.Google Scholar
[11]. Bollobás, B. (1985). Random Graphs. Academic Press, London.Google Scholar
[12]. Burtin, Y. D. (1980). On a simple formula for random mappings and its applications. J. Appl. Prob. 17, 403–414.Google Scholar
[13]. Diaconis, P., and Holmes, S. (2002). A Bayesian peek into Feller Volume 1. Preprint. To appear in Sankhyā.Google Scholar
[14]. Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.Google Scholar
[15]. Folkert, J. E. (1955). The distribution of the number of components of a random mapping function. Doctoral Thesis, Michigan State University.Google Scholar
[16]. Ford, G. W., and Uhlenbeck, G. E. (1957). Combinatorial problems in the theory of graphs. Proc. Nat. Acad. Sci. USA 43, 163–167.CrossRefGoogle ScholarPubMed
[17]. Gertsbakh, I. B. (1977). Epidemic processes on a random graph: some preliminary results. J. Appl. Prob. 14, 427–438.CrossRefGoogle Scholar
[18]. Hansen, J. C. (1989). A functional central limit theorem for random mappings. Ann. Prob. 17, 317–332.Google Scholar
[19]. Hansen, J. C. (1994). Order statistics for decomposable combinatorial structures. Random Structures Algorithms 5, 517–533.Google Scholar
[20]. Hansen, J. C. (1997). Limit laws for the optimal directed tree with random costs. Combin. Prob. Comput. 6, 315–335.Google Scholar
[21]. Hansen, J. C., and Jaworski, J. (2000). Large components of bipartite random mappings. Random Structures Algorithms 17, 317–342.Google Scholar
[22]. Hansen, J. C., and Schmutz, E. (2001). Near-optimal bounded-degree spanning trees. Algorithmica 29,Google Scholar
[23]. Hardy, G. H., Littlewood, J. E. and Pólya, G. (1952). Inequalities. Cambridge University Press.Google Scholar
[24]. Harris, B. (1960). Probability distribution related to random mappings. Ann. Math. Statist. 31, 1045–1062.Google Scholar
[25]. Jaworski, J. (1981). On the connectedness of a random bipartite mapping. In Graph Theory (Lecture Notes Math. 1018), eds Berowiecki, M., Kennedy, J. W. and Sysło, M. M., Springer, New York, pp. 69–74.Google Scholar
[26]. Jaworski, J. (1984). On a random mapping (T, Pj ). J. Appl. Prob. 21, 186–191.Google Scholar
[27]. Jaworski, J. (1985). A random bipartite mapping. Ann. Discrete Math. 28, 137–158.Google Scholar
[28]. Jaworski, J. (1990). Random mappings with independent choices of the images. In Random Graphs, Vol. 1, eds Karoński, M., Jaworski, J. and Ruciński, A., John Wiley, Chichester, pp. 89–101.Google Scholar
[29]. Jaworski, J. (1998). Predecessors in a random mapping. Random Structures Algorithms 13, 501–519.3.0.CO;2-0>CrossRefGoogle Scholar
[30]. Jaworski, J. (1999). Epidemic processes on digraphs of random mappings. J. Appl. Prob. 36, 780–798.Google Scholar
[31]. Katz, L. (1955). Probability of indecomposability of a random mapping function. Ann. Math. Statist. 26, 512–517.Google Scholar
[32]. Kolchin, V. F. (1986). Random Mappings. Optimization Software, New York.Google Scholar
[33]. Mutafchiev, L. (1981). Epidemic processes on random graphs and their threshold function. Serdica 7, 153–159.Google Scholar
[34]. Mutafchiev, L. (1982). A limit distribution related to random mappings and its application to an epidemic process. Serdica 8, 197–203.Google Scholar
[35]. Mutafchiev, L. (1984). On some stochastic problems of discrete mathematics. In Proc. XIII Spring Conf. Union Bulgarian Mathematicians (Sunny Beach, April 1984), ed. Geror, G., Bulgarian Academy of Science, Sofia, pp. 57–80.Google Scholar
[36]. Pittel, B. (1983). On distributions related to transitive closures of random finite mappings. Ann. Prob. 11, 428–441.Google Scholar
[37]. Ross, S. M. (1981). A random graph. J. Appl. Prob. 18, 309–315.CrossRefGoogle Scholar
[38]. Ross, S. M. (1996). Stochastic Processes, 2nd edn. John Wiley, New York.Google Scholar
[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.Google Scholar