Embedding theorems for random graphs with specified degrees

Pu Gao, Yuval Ohapkin

Given an $n\times n$ symmetric matrix $W\in [0,1{]}^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $…