5 citations · 5 across the 7 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.PR2021
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…
cs.SI2021
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…
math.CO2021★ 5 cited
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…