40,777 research outputs found
Uniform random sampling of planar graphs in linear time
This article introduces new algorithms for the uniform random generation of
labelled planar graphs. Its principles rely on Boltzmann samplers, as recently
developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the
Boltzmann framework, a suitable use of rejection, a new combinatorial bijection
found by Fusy, Poulalhon and Schaeffer, as well as a precise analytic
description of the generating functions counting planar graphs, which was
recently obtained by Gim\'enez and Noy. This gives rise to an extremely
efficient algorithm for the random generation of planar graphs. There is a
preprocessing step of some fixed small cost. Then, the expected time complexity
of generation is quadratic for exact-size uniform sampling and linear for
approximate-size sampling. This greatly improves on the best previously known
time complexity for exact-size uniform sampling of planar graphs with
vertices, which was a little over .Comment: 55 page
Boltzmann samplers for random generation of lambda terms
Randomly generating structured objects is important in testing and optimizing
functional programs, whereas generating random -terms is more specifically
needed for testing and optimizing compilers. For that a tool called QuickCheck
has been proposed, but in this tool the control of the random generation is
left to the programmer. Ten years ago, a method called Boltzmann samplers has
been proposed to generate combinatorial structures. In this paper, we show how
Boltzmann samplers can be developed to generate lambda-terms, but also other
data structures like trees. These samplers rely on a critical value which
parameters the main random selector and which is exhibited here with
explanations on how it is computed. Haskell programs are proposed to show how
samplers are actually implemented
A Beta-splitting model for evolutionary trees
In this article, we construct a generalization of the Blum-Fran\c{c}ois
Beta-splitting model for evolutionary trees, which was itself inspired by
Aldous' Beta-splitting model on cladograms. The novelty of our approach allows
for asymmetric shares of diversification rates (or diversification `potential')
between two sister species in an evolutionarily interpretable manner, as well
as the addition of extinction to the model in a natural way. We describe the
incremental evolutionary construction of a tree with n leaves by splitting or
freezing extant lineages through the Generating, Organizing and Deleting
processes. We then give the probability of any (binary rooted) tree under this
model with no extinction, at several resolutions: ranked planar trees giving
asymmetric roles to the first and second offspring species of a given species
and keeping track of the order of the speciation events occurring during the
creation of the tree, unranked planar trees, ranked non-planar trees and
finally (unranked non-planar) trees. We also describe a continuous-time
equivalent of the Generating, Organizing and Deleting processes where tree
topology and branch-lengths are jointly modeled and provide code in
SageMath/python for these algorithms.Comment: 23 pages, 3 figures, 1 tabl
A construction of a -coalescent via the pruning of Binary Trees
Considering a random binary tree with labelled leaves, we use a pruning
procedure on this tree in order to construct a -coalescent
process. We also use the continuous analogue of this construction, i.e. a
pruning procedure on Aldous's continuum random tree, to construct a continuous
state space process that has the same structure as the -coalescent
process up to some time change. These two constructions unable us to obtain
results on the coalescent process such as the asymptotics on the number of
coalescent events or the law of the blocks involved in the last coalescent
event
Tracing evolutionary links between species
The idea that all life on earth traces back to a common beginning dates back
at least to Charles Darwin's {\em Origin of Species}. Ever since, biologists
have tried to piece together parts of this `tree of life' based on what we can
observe today: fossils, and the evolutionary signal that is present in the
genomes and phenotypes of different organisms. Mathematics has played a key
role in helping transform genetic data into phylogenetic (evolutionary) trees
and networks. Here, I will explain some of the central concepts and basic
results in phylogenetics, which benefit from several branches of mathematics,
including combinatorics, probability and algebra.Comment: 18 pages, 6 figures (Invited review paper (draft version) for AMM
Controlled non uniform random generation of decomposable structures
Consider a class of decomposable combinatorial structures, using different
types of atoms \Atoms = \{\At_1,\ldots ,\At_{|{\Atoms}|}\}. We address the
random generation of such structures with respect to a size and a targeted
distribution in of its \emph{distinguished} atoms. We consider two
variations on this problem. In the first alternative, the targeted distribution
is given by real numbers \TargFreq_1, \ldots, \TargFreq_k such that 0 <
\TargFreq_i < 1 for all and \TargFreq_1+\cdots+\TargFreq_k \leq 1. We
aim to generate random structures among the whole set of structures of a given
size , in such a way that the {\em expected} frequency of any distinguished
atom \At_i equals \TargFreq_i. We address this problem by weighting the
atoms with a -tuple \Weights of real-valued weights, inducing a weighted
distribution over the set of structures of size . We first adapt the
classical recursive random generation scheme into an algorithm taking
\bigO{n^{1+o(1)}+mn\log{n}} arithmetic operations to draw structures from
the \Weights-weighted distribution. Secondly, we address the analytical
computation of weights such that the targeted frequencies are achieved
asymptotically, i. e. for large values of . We derive systems of functional
equations whose resolution gives an explicit relationship between \Weights
and \TargFreq_1, \ldots, \TargFreq_k. Lastly, we give an algorithm in
\bigO{k n^4} for the inverse problem, {\it i.e.} computing the frequencies
associated with a given -tuple \Weights of weights, and an optimized
version in \bigO{k n^2} in the case of context-free languages. This allows
for a heuristic resolution of the weights/frequencies relationship suitable for
complex specifications. In the second alternative, the targeted distribution is
given by a natural numbers such that
where is the number of undistinguished atoms.
The structures must be generated uniformly among the set of structures of size
that contain {\em exactly} atoms \At_i (). We give
a \bigO{r^2\prod_{i=1}^k n_i^2 +m n k \log n} algorithm for generating
structures, which simplifies into a \bigO{r\prod_{i=1}^k n_i +m n} for
regular specifications
The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
We consider a probability distribution on the set of Boolean functions in n
variables which is induced by random Boolean expressions. Such an expression is
a random rooted plane tree where the internal vertices are labelled with
connectives And and OR and the leaves are labelled with variables or negated
variables. We study limiting distribution when the tree size tends to infinity
and derive a relation between the tree size complexity and the probability of a
function. This is done by first expressing trees representing a particular
function as expansions of minimal trees representing this function and then
computing the probabilities by means of combinatorial counting arguments
relying on generating functions and singularity analysis
- …