23 citations · 74 across the 23 of their papers we have counts for
26 papers
Decomposing random regular graphs into stars
Michelle Delcourt, Catherine Greenhill, Mikhail Isaev +2
We study -star decompositions, that is, partitions of the edge set into disjoint stars with edges, in the uniformly random -regular graph model . Using…
Numerical reconstruction from the Fourier transform on the ball using prolate spheroidal wave functions
Mikhail Isaev, Roman G. Novikov, Grigory V. Sabinin
We implement numerically formulas of [Isaev, Novikov, arXiv:2107.07882] for finding a compactly supported function on , , from its Fourier transform $\ma…
On the chromatic number of graphons
Mikhail Isaev, Mihyun Kang
We extend Bollobas' classical result on the chromatic number of a binomial random graph to the exchangeable random graph model defined by a graphon $W:[0,1]^2 \r…
On the chromatic number in the stochastic block model
Mikhail Isaev, Mihyun Kang
We prove a generalisation of Bollobás' classical result on the asymptotics of the chromatic number of the binomial random graph to the stochastic block model. In addition, by allow…
Reconstruction from the Fourier transform on the ball via prolate spheroidal wave functions
Mikhail Isaev, Roman G. Novikov
We give new formulas for finding a compactly supported function on , , from its Fourier transform given within the ball . For the on…
Degree sequences of sufficiently dense random uniform hypergraphs
Catherine Greenhill, Mikhail Isaev, Tamás Makai +1
We find an asymptotic enumeration formula for the number of simple -uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula…