Connection probability for random graphs with given degree sequence

arXiv0708.2610MaRDI QIDQ6206534FDOQ6206534

Publication date: 20 August 2007

Abstract: Recently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review the applications of this model and derive analytical expression for connection probability by the expanding coefficient method. We also use our expanding coefficient method to obtain the connection probability for the directed configuration model.

This page was built for publication: Connection probability for random graphs with given degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206534)