By Dr Mikhail Isaev

Preprints

Isaev M; Novikov RG, 2020, Hölder-logarithmic stability in Fourier synthesis, http://dx.doi.org/10.1088/1361-6420/abb5df

Isaev M; Southwell A; Zhukovskii M, 2019, Distribution of tree parameters by martingale approach, http://dx.doi.org/10.1017/S0963548321000523

Isaev M; Iyer T; McKay BD, 2019, Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence, http://arxiv.org/abs/1908.01309v2

Gao P; Isaev M; McKay B, 2019, Sandwiching random regular graphs between binomial random graphs, http://arxiv.org/abs/1906.02886v5

Greenhill C; Isaev M; McKay BD, 2018, Subgraph counts for dense random graphs with specified degrees, http://dx.doi.org/10.1017/S0963548320000498

Altman D; Greenhill C; Isaev M; Ramadurai R, 2016, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, http://arxiv.org/abs/1611.09423v6

Greenhill C; Isaev M; Kwan M; McKay BD, 2016, The average number of spanning trees in sparse graphs with given degrees, http://arxiv.org/abs/1606.01586v3

Isaev M; McKay BD, 2016, Complex martingales and asymptotic enumeration, http://dx.doi.org/10.1002/rsa.20754

Back to profile page