Uniform random posets

DOI10.1016/J.INS.2019.12.018MaRDI QIDQ6308111arXivWikidataFDO

Authors Patryk Kozieł, Małgorzata Sulkowska

Publication date 12 October 2018

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.INS.2019.12.018

Mathematics Subject Classification ID

Partial orders, general (06A06) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probabilistic methods, stochastic differential equations (65C99)

arXiv classification

math.CO

Abstract: We propose a simple algorithm generating labelled posets of given size according to the almost uniform distribution. By "almost uniform" we understand that the distribution of generated posets converges in total variation to the uniform distribution. Our method is based on a Markov chain generating directed acyclic graphs.

This page was built for publication: Uniform random posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6308111)