A simply obtained asymptotic expansion for the probability that a random mapping is connected (Q919700)
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 4161766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simply obtained asymptotic expansion for the probability that a random mapping is connected |
scientific article; zbMATH DE number 4161766 |
Statements
A simply obtained asymptotic expansion for the probability that a random mapping is connected (English)
0 references
1989
0 references
A mapping f of the set \(V=\{1,2,...,n\}\) into itself is selected at random from the set of all such mappings with probability \(n^{-n}\). The author obtains asymptotic expansions for the probability of connectedness of the corresponding graph \(G_ f=(V\), \(\{\) (i,f(i)); \(i\in V\})\) and for its expected number of components.
0 references
random mapping
0 references
asymptotic expansions
0 references
probability of connectedness
0 references
0.8650643229484558
0 references
0.8470748662948608
0 references
