Mapping patterns may be represented by unlabelled directed graphs in which each point has outdegree one. We consider the uniform probability measure on the set of all mapping patterns on \(n\) points and derive the limiting distribution of the size of the largest tree as \(n \rightarrow \infty\). It
Predecessors in a random mapping
β Scribed by Jerzy Jaworski
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 208 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
β¦ Synopsis
A random mapping T ; q of a finite set V, V s 1, 2, . . . , n into itself assigns independently to each i g V its unique image j g V with probability q if i s j and with Ε½ . Ε½ . probability Ps 1 y q r n y 1 if i / j. The number of predecessors of elements from a given subset of V is studied. Exact results and limit theorems for the distribution of this random variable, the quasi-binomial distribution, are given. The results are applied to an Ε½ . inverse epidemic process on a random digraph G representing T ; q .
π SIMILAR VOLUMES
## Abstract We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the abilityβfo
We prove that the probability of each second order monadic property of a random mapping u converges as n Βͺ Ο±.
We determine the limiting distribution of the maximum vertex degree 2 n in a random triangulation of an n-gon, and show that it is the same as that of the maximum of n independent identically distributed random variables G 2 , where G 2 is the sum of two independent geometric(1Γ2) random variables.