Limit theorem concerning random mapping patterns (Q1110176)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4072013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Limit theorem concerning random mapping patterns |
scientific article; zbMATH DE number 4072013 |
Statements
Limit theorem concerning random mapping patterns (English)
0 references
1988
0 references
Mapping patterns may be represented by unlabelled directed graphs in which each point has out-degree one. Assuming uniform probability distribution on the set of all mapping patterns on n points, we obtain limit distributions of some characteristics associated with the graphs of mapping patterns (connected and disconnected), as \(n\to \infty\). In particular, we study the number of points belonging to cycles, the number of cycles and components having prescribed (fixed) number of points and the total number of components.
0 references
Mapping patterns
0 references
directed graphs
0 references
limit distributions
0 references
0 references
0 references
0.88440835
0 references
0 references
