5 citations · 5 across the 7 of their papers we have counts for
12 papers
Preferential attachment hypergraph with vertex deactivation
Frédéric Giroire, Nicolas Nisse, Kostiantyn Ohulchanskyi +2
In the field of complex networks, hypergraph models have so far received significantly less attention than graphs. However, many real-life networks feature multiary relations (co-a…
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…
Modularity of minor-free graphs
Michał Lasoń, Małgorzata Sulkowska
We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the numb…
Counting embeddings of rooted trees into families of rooted trees
Bernhard Gittenberger, Zbigniew Gołębiewski, Isabella Larcher +1
The number of embeddings of a partially ordered set in a partially ordered set is the number of subposets of isomorphic to . If both, and , have only one uniq…
What Do Our Choices Say About Our Preferences?
Krzysztof Grining, Marek Klonowski, Małgorzata Sulkowska
Taking online decisions is a part of everyday life. Think of buying a house, parking a car or taking part in an auction. We often take those decisions publicly, which may breach ou…
Maximizing the expected number of components in an online search of a graph
Fabrício Siqueira Benevides, Małgorzata Sulkowska
The following optimal stopping problem is considered. The vertices of a graph are revealed one by one, in a random order, to a selector. He aims to stop this process at a time…
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…
How to Cooperate Locally to Improve Global Privacy in Social Networks? On Amplification of Privacy Preserving Data Aggregation
Krzysztof Grining, Marek Klonowski, Małgorzata Sulkowska
In many systems privacy of users depends on the number of participants applying collectively some method to protect their security. Indeed, there are numerous already classic resul…
From directed path to linear order - the best choice problem for powers of directed path
Andrzej Grzesik, Michał Morayne, Małgorzata Sulkowska
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through th powers of a…