Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Sułkowska Małgorzata"'
Autor:
Giroire, Frédéric, Nisse, Nicolas, Ohulchanskyi, Kostiantyn, Sulkowska, Małgorzata, Trolliet, Thibaud
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-authorship, protein reactions) may therefore be modeled way better by h
Externí odkaz:
http://arxiv.org/abs/2205.00071
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2023 Apr 01. 17(1), 1-24.
Externí odkaz:
https://www.jstor.org/stable/27281392
We consider the best-choice problem for independent (not necessarily iid) observations $X_1, \cdots, X_n$ with the aim of selecting the sample minimum. We show that in this full generality the monotone case of optimal stopping holds and the stopping
Externí odkaz:
http://arxiv.org/abs/2110.05338
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 hypergraphs. Few models for generating random hypergraphs exist and no
Externí odkaz:
http://arxiv.org/abs/2103.01751
Autor:
Lasoń, Michał, Sulkowska, Małgorzata
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 number of edges tends to infinity.
Comment: 7 pages, 1 figure
Comment: 7 pages, 1 figure
Externí odkaz:
http://arxiv.org/abs/2102.07253
The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in which the ma
Externí odkaz:
http://arxiv.org/abs/2008.08312
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 our privacy - a party observing our choices may learn a lot about our pr
Externí odkaz:
http://arxiv.org/abs/2005.01586
The following optimal stopping problem is considered. The vertices of a graph $G$ are revealed one by one, in a random order, to a selector. He aims to stop this process at a time $t$ that maximizes the expected number of connected components in the
Externí odkaz:
http://arxiv.org/abs/2004.00938
Real numbers from the interval [0, 1] are randomly selected with uniform distribution. There are $n$ of them and they are revealed one by one. However, we do not know their values but only their relative ranks. We want to stop on recently revealed nu
Externí odkaz:
http://arxiv.org/abs/1904.12600
We determine the limit of the expected value and the variance of the protection number of the root in simply generated trees, in P\'olya trees, and in unlabelled non-plane binary trees, when the number of vertices tends to infinity. Moreover, we comp
Externí odkaz:
http://arxiv.org/abs/1904.03519