{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:46:45Z","timestamp":1775040405828,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642212857","type":"print"},{"value":"9783642212864","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21286-4_10","type":"book-chapter","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T01:39:29Z","timestamp":1307410769000},"page":"115-126","source":"Crossref","is-referenced-by-count":33,"title":["Efficient Generation of Networks with Given Expected Degrees"],"prefix":"10.1007","author":[{"given":"Joel C.","family":"Miller","sequence":"first","affiliation":[]},{"given":"Aric","family":"Hagberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"36113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V. Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E\u00a071, 036113 (2005)","journal-title":"Physical Review E"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/rsa.20168","volume":"31","author":"B. Bollob\u00e1s","year":"2007","unstructured":"Bollob\u00e1s, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Structures and Algorithms\u00a031(1), 3 (2007)","journal-title":"Random Structures and Algorithms"},{"issue":"6","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1007\/s10955-006-9168-x","volume":"124","author":"T. Britton","year":"2006","unstructured":"Britton, T., Deijfen, M., Martin-L\u00f6f, A.: Generating simple random graphs with prescribed degree distribution. Journal of Statistical Physics\u00a0124(6), 1377\u20131397 (2006)","journal-title":"Journal of Statistical Physics"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. In: WWW9: 9th International World Wide Web Conference, vol.\u00a033, pp. 309\u2013320 (2000)","DOI":"10.1016\/S1389-1286(00)00083-9"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Annals of Combinatorics\u00a06(2), 125\u2013145 (2002)","journal-title":"Annals of Combinatorics"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15427951.2004.10129081","volume":"1","author":"F. Chung","year":"2004","unstructured":"Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Internet Mathematics\u00a01(1), 91\u2013113 (2004)","journal-title":"Internet Mathematics"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1137\/050630106","volume":"20","author":"F. Chung","year":"2007","unstructured":"Chung, F., Lu, L.: The volume of the giant component of a random graph with given expected degrees. SIAM Journal on Discrete Mathematics\u00a020(2), 395\u2013411 (2007)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/15427951.2004.10129089","volume":"1","author":"F. Chung","year":"2004","unstructured":"Chung, F., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Internet Mathematics\u00a01(3), 257\u2013275 (2004)","journal-title":"Internet Mathematics"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10626-010-0092-5","volume":"21","author":"M. Draief","year":"2011","unstructured":"Draief, M., Ganesh, A.: A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents. Discrete Event Dynamic Systems\u00a021, 41\u201361 (2011)","journal-title":"Discrete Event Dynamic Systems"},{"key":"10_CR10","unstructured":"Eubank, S., Kumar, V.S., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 718\u2013727 (2004)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"del Genio, C.I., Kim, H., Toroczkai, Z., Bassler, K.E.: Efficient and exact sampling of simple graphs with given arbitrary degree sequence. PloS ONE\u00a05(4), e10012 (2010)","DOI":"10.1371\/journal.pone.0010012"},{"key":"10_CR12","unstructured":"van der Hofstad, R.: Critical behavior in inhomogeneous random graphs, arXiv:0902.0216v2 [math.PR] (2010)"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1098\/rsif.2005.0051","volume":"2","author":"M.J. Keeling","year":"2005","unstructured":"Keeling, M.J., Eames, K.T.D.: Networks and epidemic models. Journal of The Royal Society Interface\u00a02(4), 295\u2013307 (2005), doi:10.1098\/rsif.2005.0051","journal-title":"Journal of The Royal Society Interface"},{"key":"10_CR14","unstructured":"Kleinberg, J.: Complex networks and decentralized search algorithms. In: Proceedings of the International Congress of Mathematicians, ICM (2006)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Spread of epidemic disease on networks. Physical Review E\u00a066(1), 016128 (2002)","DOI":"10.1103\/PhysRevE.66.016128"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045, 167\u2013256 (2003)","journal-title":"SIAM Review"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1017\/S000186780000080X","volume":"38","author":"I. Norros","year":"2006","unstructured":"Norros, I., Reittu, H.: On a conditionally Poissonian graph process. Advances in Applied Probability\u00a038(1), 59\u201375 (2006)","journal-title":"Advances in Applied Probability"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21286-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T07:59:29Z","timestamp":1553759969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21286-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212857","9783642212864"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21286-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}