Results 1  10
of
160
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 109 (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.
Boltzmann Samplers For The Random Generation Of Combinatorial Structures
 Combinatorics, Probability and Computing
, 2004
"... This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call Boltzmann models. The idea is to perform random generation of possibly complex structured objects by placing an appropriate measure spread over the whole of a combina ..."
Abstract

Cited by 107 (3 self)
 Add to MetaCart
(Show Context)
This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call Boltzmann models. The idea is to perform random generation of possibly complex structured objects by placing an appropriate measure spread over the whole of a combinatorial class  an object receives a probability essentially proportional to an exponential of its size. As demonstrated here, the resulting algorithms based on realarithmetic operations often operate in linear time. They can be implemented easily, be analysed mathematically with great precision, and, when suitably tuned, tend to be very efficient in practice.
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 103 (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
Varieties of Increasing Trees
, 1992
"... An increasing tree is a labelled rooted tree in which labels along any branch from the root go in increasing order. Under various guises, such trees have surfaced as tree representations of permutations, as data structures in computer science, and as probabilistic models in diverse applications. We ..."
Abstract

Cited by 80 (7 self)
 Add to MetaCart
An increasing tree is a labelled rooted tree in which labels along any branch from the root go in increasing order. Under various guises, such trees have surfaced as tree representations of permutations, as data structures in computer science, and as probabilistic models in diverse applications. We present a unified generating function approach to the enumeration of parameters on such trees. The counting generating functions for several basic parameters are shown to be related to a simple ordinary differential equation which is non linear and autonomous. Singularity analysis applied to the intervening generating functions then permits to analyze asymptotically a number of parameters of the trees, like: root degree, number of leaves, path length, and level of nodes. In this way it is found that various models share common features: path length is O(n log n), the distributions of node levels and number of leaves are asymptotically normal, etc.
Basic Analytic Combinatorics of Directed Lattice Paths
 Theoretical Computer Science
, 2001
"... This paper develops a unified enumerative and asymptotic theory of directed 2dimensional lattice paths in halfplanes and quarterplanes. The lattice paths are speci ed by a finite set of rules that are both time and space homogeneous, and have a privileged direction of increase. (They are then ess ..."
Abstract

Cited by 78 (12 self)
 Add to MetaCart
(Show Context)
This paper develops a unified enumerative and asymptotic theory of directed 2dimensional lattice paths in halfplanes and quarterplanes. The lattice paths are speci ed by a finite set of rules that are both time and space homogeneous, and have a privileged direction of increase. (They are then essentially 1dimensional objects.) The theory relies on a specific "kernel method" that provides an important decomposition of the algebraic generating functions involved, as well as on a generic study of singularities of an associated algebraic curve. Consequences are precise computable estimates for the number of lattice paths of a given length under various constraints (bridges, excursions, meanders) as well as a characterization of the limit laws associated to several basic parameters of paths.
Probability Distributions on Cladograms
 In Random Discrete Structures
, 1996
"... By analogy with the theory surrounding the Ewens sampling formula in neutral population genetics, we ask whether there exists a natural oneparameter family of probability distributions on cladograms ("evolutionary trees") which plays a central role in neutral evolutionary theory. Unfortuna ..."
Abstract

Cited by 66 (2 self)
 Add to MetaCart
(Show Context)
By analogy with the theory surrounding the Ewens sampling formula in neutral population genetics, we ask whether there exists a natural oneparameter family of probability distributions on cladograms ("evolutionary trees") which plays a central role in neutral evolutionary theory. Unfortunately the answer seems to be "no"  see Conjecture 2. But we can embed the two most popular models into an interesting family which we call "betasplitting" models. We briefly describe some mathematical results about this family, which exhibits qualitatively different behavior for different ranges of the parameter fi. 1 Probability distributions on partitions and neutral population genetics The first few sections give some conceptual background. The reader wishing to "get right to the point" should skim these and proceed to section 3. For each n there is a finite set of partitions of f1; 2; : : : ; ng into unordered families fA 1 ; A 2 ; : : : ; A k g of subsets. A oneparameter family (P (n) ` ) o...
Random maps, coalescing saddles, singularity analysis, and Airy phenomena
 Random Structures & Algorithms
, 2001
"... A considerable number of asymptotic distributions arising in random combinatorics and analysis of algorithms are of the exponentialquadratic type, that is, Gaussian. We exhibit a class of "universal" phenomena that are of the exponentialcubic type, corresponding to distributions that i ..."
Abstract

Cited by 57 (6 self)
 Add to MetaCart
(Show Context)
A considerable number of asymptotic distributions arising in random combinatorics and analysis of algorithms are of the exponentialquadratic type, that is, Gaussian. We exhibit a class of "universal" phenomena that are of the exponentialcubic type, corresponding to distributions that involve the Airy function. In this paper, such Airy phenomena are related to the coalescence of saddle points and the confluence of singularities of generating functions. For about a dozen types of random planar maps, a common Airy distribution (equivalently, a stable law of exponent 3/2) describes the sizes of cores and of largest (multi)connected components. Consequences include the analysis and fine optimization of random generation algorithms for multiply connected planar graphs. Based on an extension of the singularity analysis framework suggested by the Airy case, the paper also presents a general classification of compositional schemas in analytic combinatorics.
Random cutting and records in deterministic and random trees
 Alg
, 2006
"... Abstract. We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned random labels. Limit theorems are given for this number, in particular when the tree is a random conditioned ..."
Abstract

Cited by 49 (9 self)
 Add to MetaCart
(Show Context)
Abstract. We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned random labels. Limit theorems are given for this number, in particular when the tree is a random conditioned Galton–Watson tree. We consider both the distribution when both the tree and the cutting (or labels) are random, and the case when we condition on the tree. The proofs are based on Aldous ’ theory of the continuum random tree. 1.