Results 1  10
of
43
NonUniform Random Variate Generation
, 1986
"... This is a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various algorith ..."
Abstract

Cited by 1009 (25 self)
 Add to MetaCart
(Show Context)
This is a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various algorithms, before addressing modern topics such as indirectly specified distributions, random processes, and Markov chain methods.
Random Mapping Statistics
 IN ADVANCES IN CRYPTOLOGY
, 1990
"... 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 ..."
Abstract

Cited by 110 (6 self)
 Add to MetaCart
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.
The continuum random tree. II. An overview
 In Stochastic Analysis
, 1990
"... Many different models of random trees have arisen in a variety of applied setting, and there is a large but scattered literature on exact and asymptotic results for particular models. For several years I have been interested in what kinds of "general theory " (as opposed to ad hoc analysis ..."
Abstract

Cited by 106 (13 self)
 Add to MetaCart
(Show Context)
Many different models of random trees have arisen in a variety of applied setting, and there is a large but scattered literature on exact and asymptotic results for particular models. For several years I have been interested in what kinds of "general theory " (as opposed to ad hoc analysis of particular
Branching processes in the analysis of the heights of trees
 Acta Informatica
, 1987
"... Summary. It is shown how the theory of branching processes can be applied in the analysis of the expected height of random trees. In particular, we will study the height of random binary search trees, random kd trees, quadtrees and unionend trees under various models of randomization. For example, ..."
Abstract

Cited by 72 (22 self)
 Add to MetaCart
(Show Context)
Summary. It is shown how the theory of branching processes can be applied in the analysis of the expected height of random trees. In particular, we will study the height of random binary search trees, random kd trees, quadtrees and unionend trees under various models of randomization. For example, for the random binary search tree constructed from a random permutation of 1,..., n, it is shown that H„/(c log (n)) tends to 1 in probability and in the mean as n oo, where H „ is the height of the tree, and c =4.31107... is a solution of the equation c log (2e / = 1. In addition, we ~c ~ show that H „clog (n) = O (/log (n) loglog (n)) in probability.
Distributional limits for critical random graphs
 In preparation
, 2009
"... We consider the Erdős–Rényi random graph G(n, p) inside the critical window, that is when p = 1/n + λn −4/3, for some fixed λ ∈ R. Then, as a metric space with the graph distance rescaled by n −1/3, the sequence of connected components G(n, p) converges towards a sequence of continuous compact metri ..."
Abstract

Cited by 32 (8 self)
 Add to MetaCart
(Show Context)
We consider the Erdős–Rényi random graph G(n, p) inside the critical window, that is when p = 1/n + λn −4/3, for some fixed λ ∈ R. Then, as a metric space with the graph distance rescaled by n −1/3, the sequence of connected components G(n, p) converges towards a sequence of continuous compact metric spaces. The result relies on a bijection between graphs and certain marked random walks, and the theory of continuum random trees. Our result gives access to the answers to a great many questions about distances in critical random graphs. In particular, we deduce that the diameter of G(n, p) rescaled by n −1/3 converges in distribution to an absolutely continuous random variable with finite mean. Keywords: Random graphs, GromovHausdorff distance, scaling limits, continuum random tree, diameter. 2000 Mathematics subject classification: 05C80, 60C05.
Longest increasing subsequences in patternrestricted permutations
 Electron. J. Combin., 9(2):Research paper
, 2002
"... Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for patternrestricted permutations in which the pattern is any one of the six patterns of length 3. We ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
(Show Context)
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for patternrestricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)avoiding case is identical to the distribution of heights of ordered trees, and that the (321)avoiding case has interesting connections with a well known theorem of ErdősSzekeres. 1