Exact uniform sampling over catalan structures

03/11/2018
by   Alexandros Angelopoulos, et al.
0

We present a new framework for creating elegant algorithms for exact uniform sampling of important Catalan structures, such as triangulations of convex polygons, Dyck words, monotonic lattice paths and mountain ranges. Along with sampling, we obtain optimal coding, and optimal number of random bits required for the algorithm. The framework is based on an original two-parameter recursive relation, where Ballot and Catalan numbers appear and which may be regarded as to demonstrate a generalized reduction argument. We then describe (a) a unique n× n matrix to be used for any of the problems -the common pre-processing step of our framework- and (b) a linear height tree, where leaves correspond one by one to all distinct solutions of each problem; sampling is essentially done by selecting a path from the root to a leaf - the main algorithm. Our main algorithm is linear for a number of the problems mentioned.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/10/2020

An Improved Exact Sampling Algorithm for the Standard Normal Distribution

In 2016, Karney proposed an exact sampling algorithm for the standard no...
11/08/2020

Sampling Constraint Satisfaction Solutions in the Local Lemma Regime

We give a Markov chain based algorithm for sampling almost uniform solut...
01/03/2022

The exact complexity of a Robinson tiling

We find the exact formula for the number of distinct n × n square patter...
03/20/2021

A note on sampling recovery of multivariate functions in the uniform norm

We study the recovery of multivariate functions from reproducing kernel ...
06/14/2011

From Causal Models To Counterfactual Structures

Galles and Pearl claimed that "for recursive models, the causal model fr...
05/26/2021

Boltzmann sampling of irreducible context-free structures in linear time

We continue our program of improving the complexity of so-called Boltzma...
09/23/2017

A new indexed approach to render the attractors of Kleinian groups

One widespread procedure to render the attractor of Kleinian groups, pub...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.