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 Mathematics 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/territory level. Dive into details by clicking on the dots or
Projects
- 2 Active
-
Enhanced methods for approximating the structure of large networks
Australian Research Council (ARC)
4/05/20 → 3/05/23
Project: Research
-
Hypergraph models for complex discrete systems
Greenhill, C. S., Isaev, M. & McKay, B. D.
7/05/19 → 31/12/22
Project: Research
-
Spanning trees in random regular uniform hypergraphs
Greenhill, C., Isaev, M. & Liang, G., Jan 2022, In: Combinatorics, Probability and Computing. 31, 1, p. 29-53 25 p.Research output: Contribution to journal › Article › Research › peer-review
-
Stability estimates for reconstruction from the Fourier transform on the ball
Isaev, M. & Novikov, R. G., Jun 2021, In: Journal of Inverse and Ill-Posed Problems. 29, 3, p. 421-433 13 p.Research output: Contribution to journal › Article › Research › peer-review
2 Citations (Scopus) -
Subgraph counts for dense random graphs with specified degrees
Greenhill, C., Isaev, M. & Mckay, B. D., May 2021, In: Combinatorics, Probability and Computing. 30, 3, p. 460-497 38 p.Research output: Contribution to journal › Article › Research › peer-review
Open Access -
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 AccessFile -
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
Altman, D., Greenhill, C., Isaev, M. & Ramadurai, R., May 2020, In: Journal of Combinatorial Theory, Series B. 142, p. 307-373 67 p.Research output: Contribution to journal › Article › Research › peer-review
3 Citations (Scopus)
Prizes
-
EAIP Young Scientist Award
Isaev, Mikhail (Recipient), 2014
Prize: Prize (including medals and awards)
-
-