Random mapping statistics

Abstract : Random mappings from a finite set into itself are either a heuristic or an exact model for a variety of applications in random number generation, computational number theory, cryptography, and the analysis of algorithms at large. This paper introduces a general framework in which the analysis of about twenty characteristic parameters of random mappings is carried out. These parameters are studied systematically through the use of generating functions and singularity analysis. In particular, an open problem of Knuth is solved, namely that of finding the expected diameter of a random mapping. The same approach is applicable to a larger class of discrete combinatorial models and possibilities of automated analysis using symbolic manipulation systems ("computer algebra") are also briefly discussed.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00075445
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 6:13:54 PM
Last modification on : Friday, September 16, 2016 - 3:11:38 PM
Long-term archiving on : Tuesday, April 12, 2011 - 7:02:45 PM

Identifiers

  • HAL Id : inria-00075445, version 1

Collections

Citation

Philippe Flajolet, Andrew M. Odlyzko. Random mapping statistics. [Research Report] RR-1114, INRIA. 1989. ⟨inria-00075445⟩

Share

Metrics

Record views

211

Files downloads

1305