%0 Journal Article %1 Newman2005Random %A Newman, Mark E. J. %B Handbook of Graphs and Networks %D 2005 %I Wiley-VCH Verlag GmbH & Co. KGaA %K percolation er-networks clustering %P 35--68 %R 10.1002/3527602755.ch2 %T Random graphs as models of networks %U http://dx.doi.org/10.1002/3527602755.ch2 %X * Introduction * Random graphs with specified degree distributions * Probability generating functions Properties of generating functionsExamples * Properties of undirected graphs Distribution of component sizesMean component sizeAbove the phase transition * Properties of directed graphs Generating functionsResults * Networks with clustering * Models defined on random graphs Network resilienceEpidemiologyThe SIR modelSolution of the SIR model * Summary * References

@article{Newman2005Random, abstract = {{* Introduction * Random graphs with specified degree distributions * Probability generating functions Properties of generating functionsExamples * Properties of undirected graphs Distribution of component sizesMean component sizeAbove the phase transition * Properties of directed graphs Generating functionsResults * Networks with clustering * Models defined on random graphs Network resilienceEpidemiologyThe SIR modelSolution of the SIR model * Summary * References}}, added-at = {2019-06-10T14:53:09.000+0200}, author = {Newman, Mark E. J.}, biburl = {https://www.bibsonomy.org/bibtex/22c6a459a9dd3e4449a0d10007a2f3c5a/nonancourt}, booktitle = {Handbook of Graphs and Networks}, citeulike-article-id = {9610309}, citeulike-linkout-0 = {http://dx.doi.org/10.1002/3527602755.ch2}, doi = {10.1002/3527602755.ch2}, interhash = {f2d77634c0f1df530d3a68c3d559bc68}, intrahash = {2c6a459a9dd3e4449a0d10007a2f3c5a}, keywords = {percolation er-networks clustering}, pages = {35--68}, posted-at = {2012-03-08 10:38:16}, priority = {2}, publisher = {Wiley-VCH Verlag GmbH \& Co. KGaA}, timestamp = {2019-08-01T16:10:21.000+0200}, title = {{Random graphs as models of networks}}, url = {http://dx.doi.org/10.1002/3527602755.ch2}, year = 2005 }