Article
Licensed
Unlicensed
Requires Authentication
The limit distribution of the number of cyclic vertices in a random mapping in a special case
-
I. A. Cheplyukova
Published/Copyright:
August 1, 2004
We consider the number of cyclic vertices in a random single-valued mapping of a set of size n whose graph contains m cycles. We obtain a theorem that describes the limit behaviour of this characteristic as n → ∞, m / lnn → ∞, m / lnn = O(lnn).
Published Online: 2004-08-01
Published in Print: 2004-08-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Limit theorems for sizes of trees in the unlabelled graph of a random mapping
- The limit distribution of the number of cyclic vertices in a random mapping in a special case
- The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences
- Polynomial transformations of GEO-rings of prime characteristic
- On optimal exact coverings of a graph in the class of weakly dense bases
- On a generalisation of the method of boundary functionals
- On characteristic polynomials of periodic graphs
Articles in the same Issue
- Limit theorems for sizes of trees in the unlabelled graph of a random mapping
- The limit distribution of the number of cyclic vertices in a random mapping in a special case
- The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences
- Polynomial transformations of GEO-rings of prime characteristic
- On optimal exact coverings of a graph in the class of weakly dense bases
- On a generalisation of the method of boundary functionals
- On characteristic polynomials of periodic graphs
