Complex martingales and asymptotic enumeration
From MaRDI portal
Publication:4584913
DOI10.1002/rsa.20754zbMath1396.05010arXiv1604.08305OpenAlexW2344791152MaRDI QIDQ4584913
Mikhail Isaev, Brendan D. McKay
Publication date: 5 September 2018
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.08305
diameterasymptotic enumerationrandom graphdegree sequencecomplex martingaleDoob martingale processmultidimensional Laplace integraltruncated Gaussian measures
Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)
Related Items
Degree sequences of sufficiently dense random uniform hypergraphs, Independent sets of a given size and structure in the hypercube, Distribution of tree parameters by martingale approach, Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges, Factorisation of the complete bipartite graph into spanning semiregular factors, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Subgraph distributions in dense random regular graphs, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Factorisation of the complete graph into spanning regular factors, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence, Subgraph counts for dense random graphs with specified degrees, Sandwiching dense random regular graphs between binomial random graphs
