1 citations · 1 across the 12 of their papers we have counts for
5 papers · 1 filter
Sandwiching between random regular graphs and Erdős-Rényi graphs: configuration model and unions of perfect matchings
Pu Gao, Mikhail Isaev, Xavier Perez-Gimenez
We establish new couplings among several random graph and multigraph models related to the random regular graph , including the configuration model and unions of random per…
On Pauling's residual entropy estimate for regular graphs with growing degree
M. Hasheminezhad, M. Isaev, B. D. McKay +1
In 1935, Pauling proposed an estimate for the number of Eulerian orientations of a graph in the context of the theoretical behaviour of water ice. The logarithm of the number of Eu…
A tail bound for cumulant series for complex functions of independent random variables
Mikhail Isaev
We obtain explicit bounds on the truncation error of the cumulant series of a bounded complex function of a random vector with independent components. The bounds are based on multi…
Asymptotic enumeration of graph factors by cumulant expansion
Mikhail Isaev, Brendan D. McKay
Let be a dense graph with good expansion properties and not too close to being bipartite. Let be a graphical degree sequence. Under very weak conditions, we fin…
Enumeration of regular multipartite hypergraphs
Mikhail Isaev, Tamás Makai, Brendan D. McKay
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.