The DOI matches its Crossref record.
Probability Distributions Related to Random Mappings
Open accessAbstract
A Random Mapping Space $(X, \mathcal{J}, P)$ is a triplet, where $X$ is a finite set of elements $x$ of cardinality $n, \mathcal{J}$ is a set of transformations $T$ of $X$ into $X$, and $P$ is a probability measure over $\mathcal{J}$. In this paper, four choices of $\mathcal{J}$ are considered (I) $\mathcal{J}$ is the set of all transformations of $X$ into $X$. (II) $\mathcal{J}$ is the set of all transformations of $X$ into $X$ such that for each $x \varepsilon X Tx \neq x$. (III) $\mathcal{J}$ is the set of one-to-one mappings of $X$ onto $X$. (IV) $\mathcal{J}$ is the set of one-to-one mappings of $X$ onto $X$, such that for each $x \varepsilon X, Tx \neq x$. In each case $P$ is taken as the uniform probability distribution over $\mathcal{J}$. If $x \varepsilon X$ and $T \varepsilon \mathcal{J}$, we will define $T^kx$ as the $k$th iteration of $T$ on $x$, where $k$ is an integer, i.e. $T^kx = T(T^{k-1}x)$, and $T^0x = x$ for all $x$. The reader should note that, in general, $T^kx, k < 0$, may not exist or may not be uniquely determined. If for some $k \geqq 0, T^kx = y$, then $y$ is said to be a $k$th image of $x$ in $T$. The set of successors of $x$ in $T, S_T(x)$ is the set of all images of $x$ in $T$, i.e., $S_T(x) = \{x, Tx, T^2x, \cdots, T^{n-1}x\},$ which need not be all distinct elements. If for some $k \leqq 0, T^kx = y, y$ is said to be a $k$th inverse of $x$ in $T$. The set of all $k$th inverses of $x$ in $T$ is $T^{(k)} (x)$ and $P_T(x) = \mathbf{\bigcup}^0_{k=-n} T^{(k)} (x)$ is the set of predecessors of $x$ in $T$. If there exists an $m > 0$, such that $T^mx = x$, then $x$ is a cyclical element of $T$ and the set of elements $x, Tx, T^2x, \cdots, T^{m-1}x$ is the cycle containing $x, C_T(x)$. If $m$ is the smallest positive integer for which $T^m x = x$, then $C_T(x)$ has cardinality $m$. We note further an interesting equivalence relation induced by $T$. If there exists a pair of integers $k_1, k_2$ such that $T^{k_1}x = T^{k_2}y,$ then $x \sim y$ under $T$. It is readily seen that this is in fact an equivalence, and hence decomposes $X$ into equivalence classes, which we shall call the components of $X$ in $T$; and designate by $K_T(x)$ the component containing $x$. We define $s_T(x)$ to be the number of elements in $S_T(x), p_T(x)$ to be the number of elements in $P_T(x)$, and $l_T(x)$ to be the number of elements in the cycle contained in $K_T(x)$ (i.e. $l(x) =$ the number of elements in $C_T(x)$ if $x$ is cyclical). We designate by $q_T$ the number of elements of $X$ cyclical in $T$, and by $r_T$ the number of components of $X$ in $T$. Rubin and Sitgreaves [9] in a Stanford Technical Report have obtained the distributions of $s, p, l, q,$ and have given a generating function for the distribution of $r$ in case I. Folkert [3], in an unpublished doctoral dissertation has obtained the distribution of $r$ in cases I and II. The distribution of $r$ in case III is classical and may be found in Feller [2], Gontcharoff [4], and Riordan [8]. In the present paper, a number of these earlier results are rederived and extended. Specifically, for cases I and II, we compute the probability distributions of $s, p, l, q$ and $r$. In cases III and IV the distributions of $l$ and $r$ are given. In addition some asymptotic distributions and low order moments are obtained. For the convenience of the reader, an index of notations having a fixed meaning is provided in the appendix to the paper.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Statistical mechanics of cellular automata
Wolfram, S. (1983) · Reviews of Modern Physics · doi:10.1103/revmodphys.55.601 · Cited by 3,114
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Random sequence generation by cellular automata
Wolfram, S. (1986) · Advances in Applied Mathematics · doi:10.1016/0196-8858(86)90028-x · Cited by 494
Boolean Dynamics with Random Couplings
Aldana, M., Coppersmith, S., & Kadanoff, L. P. (2003) · Perspectives and Problems in Nolinear Science · doi:10.1007/978-0-387-21789-5_2 · Cited by 313
Flajolet, P., & Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_34 · Cited by 274
Metadata
- Authors
- Harris, B.
- Venue
- The Annals of Mathematical Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 1960-12
- Volume
- 31
- Issue
- 4
- Pages
- 1045-1062
- ISSN
- 0003-4851 (ISSN-L)
- OpenAlex
- W1970252670
- Cited by
- 212
- References
- 0
- FWCI
- 0.43
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Probability Distributions Related to Random Mappings. https://app.cochat.ai/papers/10.1214/aoms/1177705677
- The paper
- Harris, B. (1960). Probability Distributions Related to Random Mappings. The Annals of Mathematical Statistics. https://doi.org/10.1214/aoms/1177705677
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.