Mikhail Isaev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mikhail Isaev has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Brendan D. McKay
School of Computing, Australian National University, Canberra, ACT 2601, Australia
3 shared publications - Angus Southwell
School of Physics and Astronomy, Monash University, Melbourne, VIC, Australia
1 shared publication - Fedor Goncharov
Université Paris Saclay, CEA, LIST
1 shared publication - Maksim Zhukovskii
University of Sheffield
1 shared publication - Pu Gao
School of Mechanical Engineering, Beijing Institute of Technology, Beijing, China
1 shared publication - Rodion Zaytsev
Skolkovo Institute of Science and Technology
1 shared publication
Latest Publications
- Open Access
Sandwiching between random regular graphs and Erdős-Rényi graphs: configuration model and unions of perfect matchings
We establish new couplings among several random graph and multigraph models related to the random regular graph $G(n,d)$, including the configuration model and unions of random perfect matchings. As a main result, we verify the Kim-Vusandwich conjecture for all large degrees $d=n-O(\log^4 n)$ and prove a weakened version for $d=O(\log^4 n)$, which are the only remaining open cases. Our approach introduces a coupling framework that links $G(n,d)$ and $G(n,p)$ through a chain of intermediate models.Open AccessSandwiching between random regular graphs and Erdős-Rényi graphs: configuration model and unions of perfect matchings
We establish new couplings among several random graph and multigraph models related to the random regular graph $G(n,d)$, including the configuration model and unions of random perfect matchings. As a main result, we verify the Kim-Vusandwich conjecture for all large degrees $d=n-O(\log^4 n)$ and prove a weakened version for $d=O(\log^4 n)$, which are the only remaining open cases. Our approach introduces a coupling framework that links $G(n,d)$ and $G(n,p)$ through a chain of intermediate models. - Open Access
Asymptotic enumeration of graph factors by cumulant expansion
Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence $\boldsymbol d$ to arbitrary precision. The average degree can be any power of $n$ and the variation in degrees can be very large. The method uses an explicit bound on the tail of the cumulant generating function found by the first author. As a first application, we prove that there is an asymptotic expansion for the number of regular graphs and find several terms explicitly. We believe that this is the first combinatorial application of the Fourier inversion method for which the integral outside the dominant regions cannot be bounded by the integral of the absolute value, and we give a general method for dealing with that situation.Open AccessAsymptotic enumeration of graph factors by cumulant expansion
Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence $\boldsymbol d$ to arbitrary precision. The average degree can be any power of $n$ and the variation in degrees can be very large. The method uses an explicit bound on the tail of the cumulant generating function found by the first author. As a first application, we prove that there is an asymptotic expansion for the number of regular graphs and find several terms explicitly. We believe that this is the first combinatorial application of the Fourier inversion method for which the integral outside the dominant regions cannot be bounded by the integral of the absolute value, and we give a general method for dealing with that situation. - 4 April 2025
- Published by Springer Nature
- p. 345-353
Super-resolution Reconstruction from Truncated Hankel Transform
- 4 April 2025
- Published by Springer Nature
- p. 345-353
Super-resolution Reconstruction from Truncated Hankel Transform
- Open Access
Enumeration of regular multipartite hypergraphs
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
Open AccessEnumeration of regular multipartite hypergraphs
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
- Open Access
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-20
Sprinkling with random regular graphs
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices tends to infinity. We verify this conjecture for the cases when the graphs are sufficiently dense or sparse. We also prove an asymptotic formula for the expected number of spanning regular subgraphs in a random regular graph.
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-20
Open AccessSprinkling with random regular graphs
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices tends to infinity. We verify this conjecture for the cases when the graphs are sufficiently dense or sparse. We also prove an asymptotic formula for the expected number of spanning regular subgraphs in a random regular graph.