5 papers
Running minimum in the best-choice problem
Alexander Gnedin, Patryk Kozieł, Małgorzata Sulkowska
We consider the best-choice problem for independent (not necessarily iid) observations with the aim of selecting the sample minimum. We show that in this full ge…
Preferential attachment hypergraph with high modularity
Frédéric Giroire, Nicolas Nisse, Thibaud Trolliet +1
Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by…
An Optimal Algorithm for Stopping on the Element Closest to the Center of an Interval
Ewa M. Kubicka, Grzegorz Kubicki, Małgorzata Kuchta +1
Real numbers from the interval [0, 1] are randomly selected with uniform distribution. There are of them and they are revealed one by one. However, we do not know their values…
Protection numbers in simply generated trees and Pólya trees
Bernhard Gittenberger, Zbigniew Gołębiewski, Isabella Larcher +1
We determine the limit of the expected value and the variance of the protection number of the root in simply generated trees, in Pólya trees, and in unlabelled non-plane binary tre…
Uniform random posets
Patryk Kozieł, Małgorzata Sulkowska
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 gene…