Cycles in random k-ary maps and the poor performance of random random number generation

Simple item page
dc.creatorPemantle, Robin
dc.date2004-04-05
dc.date.accessioned2026-07-07T05:07:10Z
dc.date.available2026-07-07T05:07:10Z
dc.descriptionKnuth shows that iterations of a random function perform poorly on average as a random number generator. He proposes a generalization in which the next value depends on two or more previous values. This note demonstrates, via an analysis of the cycle length of a random k-ary map, the equally poor performance of a random instance in Knuth's more general model.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/math/0404103
dc.identifierhttp://arxiv.org/abs/math/0404103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70750
dc.subjectProbability
dc.subject65C10
dc.titleCycles in random k-ary maps and the poor performance of random random number generation
dc.typetext

Files

Collections

arXiv