Projects per year
Personal profile
Biography
Mikhail Isaev completed two postgraduate programs in 2014:
1) PhD in Applied Mathematics at Ecole Polytechnique, France.
2) PhD in Mathematics and Physics at Moscow Institute of Physics and Technology, Russia.
Then he came to Australia to work with B.D. McKay as a Research Fellow at Australian National University from Jan 2015 to Jun 2016. Afterwards, Mikhail had another postdoc position under the supervision of C. Greenhill at University of New South Wales until he joined School of Mathematical Sciences at Monash University in Aug 2017.
Personal Webpage of Mikhail Isaev is here.
Research area keywords
- Combinatorial Enumeration
- random structures
- graph theory
- probabilistic combinatorics
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Projects
Hypergraph models for complex discrete systems
Greenhill, C. S., Isaev, M. & McKay, B. D.
7/05/19 → 6/05/22
Project: Research
Enhanced methods for approximating the structure of large networks
Australian Research Council (ARC)
4/05/20 → 3/05/23
Project: Research
Research Output
Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
Isaev, M., Iyer, T. & McKay, B. D., 1 Jan 2020, In : Electronic Journal of Combinatorics. 27, 1, 30 p., P1.26.Research output: Contribution to journal › Article › Research › peer-review
Open Access
File
Sandwiching random regular graphs between binomial random graphs
Gao, P., Isaev, M. & McKay, B. D., 2020, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial & Applied Mathematics (SIAM), p. 690-701 12 p.Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research
Open Access
File
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
Altman, D., Greenhill, C., Isaev, M. & Ramadurai, R., 13 Nov 2019, (Accepted/In press) In : Journal of Combinatorial Theory, Series B. 67 p.Research output: Contribution to journal › Article › Research › peer-review
Complex martingales and asymptotic enumeration
Isaev, M. & McKay, B. D., 1 Jul 2018, In : Random Structures and Algorithms. 52, 4, p. 617-661 45 p.Research output: Contribution to journal › Article › Research › peer-review
6
Citations
(Scopus)
The average number of spanning trees in sparse graphs with given degrees
Greenhill, C., Isaev, M., Kwan, M. & McKay, B. D., 1 Jun 2017, In : European Journal of Combinatorics. 63, p. 6-25 20 p.Research output: Contribution to journal › Article › Research › peer-review
3
Citations
(Scopus)