Hamiltonicity of random graphs in the stochastic block model
Combinatorics
2019-10-29 v1
Abstract
We study the Hamiltonicity of the following model of a random graph. Suppose that we partition [n] into V_1,V_2,...,V_k and add edge {x,y} to our graph with probability p if there exists i such that x,y\in V_i. Otherwise, we add the edge with probbability q. We denote this model by G(n, p,q) and give tight results for Hamiltonicity, including a critical window analysis, under various conditions.
Cite
@article{arxiv.1910.12594,
title = {Hamiltonicity of random graphs in the stochastic block model},
author = {Michael Anastos and Alan Frieze and Pu Gao},
journal= {arXiv preprint arXiv:1910.12594},
year = {2019}
}