๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the number of predecessors in constrained random mappings

โœ Scribed by Bernhard Gittenberger

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
253 KB
Volume
36
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 singularity analysis.

๐Ÿ“œ SIMILAR VOLUMES

On the independence number of random gra
On the independence number of random graphs
โœ A.M. Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

Let (Y(G~,~) denote the independence number of the random graph Gn,p. Let d = np. We show that if E > 0 is fixed then with probability going to 1 as n + m cu(G& -$t (log d -log log dlog 2 + 1) < 7 provided d, s d = o(n), where d, is some fixed constant.

On the number of hamilton cycles in a ra
On the number of hamilton cycles in a random graph
โœ C. Cooper; A. M. Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 576 KB

Let a random graph G be constructed by adding random edges one by one, starting with n isolated vertices. We show that with probability going to one as n goes to infinity, when G first has minimum degree two, it has at least (log n)('-')" distinct hamilton cycles for any fixed E > 0.