𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The limit distribution of the number of nodes in low strata of a random mapping

✍ Scribed by Ljuben R Mutafchiev

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
224 KB
Volume
7
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The distribution of nodes of given degre
The distribution of nodes of given degree in random trees
✍ Drmota, Michael; Gittenberger, Bernhard πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 391 KB πŸ‘ 2 views

Let T n denote the set of unrooted unlabeled trees of size n and let k β‰₯ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value ∼ Β΅ k n and variance ∼ Οƒ 2 k n with positive constants Β΅

On the number of predecessors in constra
On the number of predecessors in constrained random mappings
✍ Bernhard Gittenberger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 253 KB

We consider random mappings from an n-element set into itself with constraints on coalescence as introduced by Arney and Bender. A local limit theorem for the distribution of the number of predecessors of a random point in such a mapping is presented by using a generating function approach and singu

Limit distribution for the existence of
Limit distribution for the existence of hamiltonian cycles in a random graph
✍ JΓ‘nos KomlΓ³s; Endre SzemerΓ©di πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 874 KB

P&a proved that a random graph with clt log n edges is Hamiltonian with probability tending to 1 if c >3. Korsunov improved this by showing that, if Gn is a random graph with \*n log n + in log log n + f(n)n edges and f(n) --\*m, then G" is Hamiltonian, with probability tending to 1. We shall prove