I’ll review a general probabilistic framework and large n asymptotics for unlabeled random graphs,introduced by B. and Chen(2009)PNAS. I will show, how various standard models ;block, Chung-Lu, and preferential attachment fall into this framework and will review the asymptotic performance of some standard algorithms.If there is time I will discuss some weaknesses of the approach and a possible cure.