no code implementations • 20 Jan 2021 • Maria Krivoshapko, Maksim Zhukovskii
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.
Combinatorics
no code implementations • 6 Dec 2020 • Yury Demidovich, Maksim Zhukovskii
The clique chromatic number of a graph is the minimum number of colors required to assign to its vertex set so that no inclusion maximal clique is monochromatic.
Combinatorics 05C80, 05C15
no code implementations • NeurIPS 2016 • Lev Bogolubsky, Pavel Dvurechenskii, Alexander Gasnikov, Gleb Gusev, Yurii Nesterov, Andrei M. Raigorodskii, Aleksey Tikhonov, Maksim Zhukovskii
In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for features of nodes and edges.
