Random clique covers for graphs with local density and global sparsity

Sinead A. Williamson, Mauricio Tec

Large real-world graphs tend to be sparse, but they often contain many densely connected subgraphs and exhibit high clustering coefficients. While recent random graph models can ca…