
Polynomial tuning of multiparametric combinatorial samplers
Boltzmann samplers and the recursive method are prominent algorithmic fr...
read it

Statistical properties of lambda terms
We present a quantitative, statistical analysis of random lambda terms i...
read it

An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time
Trees are useful entities allowing to model data structures and hierarch...
read it

Combinatorial and computational investigations of NeighborJoining bias
The NeighborJoining algorithm is a popular distancebased phylogenetic ...
read it

Operads in algebraic combinatorics
The main ideas developed in this habilitation thesis consist in endowing...
read it

Diversity in Combinatorial Optimization
When modeling an application of practical relevance as an instance of a ...
read it

A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
The Longest Common Increasing Subsequence (LCIS) is a variant of the cla...
read it
Tuning as convex optimisation: a polynomial tuner for multiparametric combinatorial samplers
Combinatorial samplers are algorithmic schemes devised for the approximate and exactsize generation of large random combinatorial structures, such as contextfree words, various treelike data structures, maps, tilings, or even RNA sequences. In their multiparametric variants, combinatorial samplers are adapted to combinatorial specifications with additional parameters, allowing for a more flexible control over the output profile of parametrised combinatorial patterns. One can control, for instance, the number of leaves, profile of node degrees in trees or the number of certain subpatterns in generated strings. However, such a flexible control requires an additional and nontrivial tuning procedure. Using techniques of convex optimisation, we present an efficient polynomial tuning algorithm for multiparametric combinatorial specifications. For a given combinatorial system of description length L with d tuning parameters and target size parameter value n, our algorithm runs in time O(d^3.5 L log n). We demonstrate the effectiveness of our method on a series of practical examples, including rational, algebraic, and socalled Pólya specifications. We show how our method can be adapted to a broad range of less typical combinatorial constructions, including symmetric polynomials, labelled sets and cycles with cardinality lower bounds, simple increasing trees or substitutions. Finally, we discuss some practical aspects of our prototype tuner implementation and provide its benchmark results.
READ FULL TEXT
Comments
There are no comments yet.