Improving the Florentine algorithms: recovering algorithms for Motzkin and Schröder paths

02/16/2018
by   Axel Bacher, et al.
0

We present random sampling procedures for Motzkin and Schröder paths, following previous work on Dyck paths. Our algorithms follow the anticipated rejection method of the Florentine algorithms (Barcucci et al. 1994+), but introduce a recovery idea to greatly reduce the probability of rejection. They use an optimal amount of randomness and achieve a better time complexity than the Florentine algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2021

Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics

We classify which local problems with inputs on oriented paths have so-c...
research
04/02/2023

Algorithms for Construction, Classification and Enumeration of Closed Knight's Paths

Two algorithms for construction of all closed knight's paths of lengths ...
research
07/09/2019

Faster provable sieving algorithms for the Shortest Vector Problem and the Closest Vector Problem on lattices in ℓ_p norm

In this paper we give provable sieving algorithms for the Shortest Vecto...
research
05/02/2019

Alternative Techniques for Mapping Paths to HLAI

The only systematic mapping of the HLAI technical landscape was conducte...
research
05/01/2023

Temporal Betweenness Centrality on Shortest Paths Variants

Betweenness centrality has been extensively studied since its introducti...
research
07/18/2022

Bernoulli Factories for Flow-Based Polytopes

We construct explicit combinatorial Bernoulli factories for the class of...
research
07/13/2020

Reconstruction of Line-Embeddings of Graphons

Consider a random graph process with n vertices corresponding to points ...

Please sign up or login with your details

Forgot password? Click here to reset