Random mapping statistics

@article{citeulike:1767450, 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...}, author = {Flajolet, P. and Odlyzko, A. M. }, citeulike-article-id = {1767450}, journal = {Lecture Notes in Computer Science}, keywords = {math, numbers, random, statistics}, pages = {329--354}, posted-at = {2007-10-14 18:54:26}, priority = {3}, title = {Random mapping statistics}, url = {http://citeseer.ist.psu.edu/flajolet90random.html}, volume = {434}, year = {1990} }

TY - JOUR ID - citeulike:1767450 L3 - citeulike-article-id:1767450 TI - Random mapping statistics JF - Lecture Notes in Computer Science VL - 434 SP - 329 EP - 354 N2 - 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... KW - math KW - numbers KW - random KW - statistics AU - Flajolet, P AU - Odlyzko, AM PY - 1990/// UR - http://citeseer.ist.psu.edu/flajolet90random.html ER -