乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:25Z","timestamp":1725914665240},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_1","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:06:22Z","timestamp":1509501982000},"page":"1-17","source":"Crossref","is-referenced-by-count":2,"title":["Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions"],"prefix":"10.1007","author":[{"given":"Remco","family":"van der Hofstad","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"1_CR1","unstructured":"Angel, O., van der Hofstad, R., Holmgren, C.: Limit laws for self-loops and multiple edges in the configuration model. arXiv:1603.07172 [math.PR], Preprint (2016)"},{"issue":"5439","key":"1_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","volume":"24","author":"E Bender","year":"1978","unstructured":"Bender, E., Canfield, E.: The asymptotic number of labelled graphs with given degree sequences. J. Comb. Theory (A) 24, 296\u2013307 (1978)","journal-title":"J. Comb. Theory (A)"},{"issue":"4","key":"1_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Comb. 1(4), 311\u2013316 (1980)","journal-title":"Eur. J. Comb."},{"key":"1_CR5","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"},{"issue":"6","key":"1_CR7","doi-asserted-by":"crossref","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. J. Stat. Phys. 124(6), 1377\u20131397 (2006)","journal-title":"J. Stat. Phys."},{"key":"1_CR8","series-title":"Cambridge Series in Statistical and Probabilistic Mathematics","volume-title":"Random Graph Dynamics","author":"R Durrett","year":"2007","unstructured":"Durrett, R.: Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (2007)"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P Erd\u0151s","year":"1947","unstructured":"Erd\u0151s, P.: Some remarks on the theory of graphs. Bull. Am. Math. Soc. 53, 292\u2013294 (1947)","journal-title":"Bull. Am. Math. Soc."},{"key":"1_CR10","unstructured":"Erd\u0151s, P., Gallai, T.: Graphs with points of prescribed degrees. Mat. Lapok 11, 264\u2013274 (1960). (Hungarian)"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. Debrecen 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"1_CR12","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 5, 17\u201361 (1960)"},{"key":"1_CR13","first-page":"343","volume":"38","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Bull. Inst. Int. Stat. 38, 343\u2013347 (1961)","journal-title":"Bull. Inst. Int. Stat."},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the strength of connectedness of a random graph. Acta Math. Acad. Sci. Hungar. 12, 261\u2013267 (1961)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"C Faloutsos","year":"1999","unstructured":"Faloutsos, C., Faloutsos, P., Faloutsos, M.: On power-law relationships of the internet topology. Comput. Commun. Rev. 29, 251\u2013262 (1999)","journal-title":"Comput. Commun. Rev."},{"issue":"5","key":"1_CR16","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1017\/S0963548317000177","volume":"26","author":"L Federico","year":"2017","unstructured":"Federico, L., van der Hofstad, R.: Critical window for connectivity in the configuration model. Combin. Probab. Comput. 26(5), 660\u2013680 (2017)","journal-title":"Combin. Probab. Comput."},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.aim.2015.09.002","volume":"287","author":"P Gao","year":"2016","unstructured":"Gao, P., Wormald, N.: Enumeration of graphs with a heavy-tailed degree sequence. Adv. Math. 287, 412\u2013450 (2016)","journal-title":"Adv. Math."},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30, 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"van der Hofstad, R.: Random graphs and complex networks. Cambridge Series in Statistical and Probabilistic Mathematics, vol. 1. Cambridge University Press, Cambridge (2017)","DOI":"10.1017\/9781316779422"},{"key":"1_CR20","unstructured":"van der Hofstad, R.: Random graphs and complex networks, vol. 2 (2018+). In preparation, see http:\/\/www.win.tue.nl\/~rhofstad\/NotesRGCNII.pdf"},{"key":"1_CR21","unstructured":"van der Hofstad, R., Hooghiemstra, G., Van Mieghem, P.: Distances in random graphs with finite variance degrees. Random Struct. Algorithms 27(1), 76\u2013123 (2005)"},{"key":"1_CR22","unstructured":"van der Hofstad, R., Hooghiemstra, G., Znamenski, D.: Distances in random graphs with finite mean and infinite variance degrees. Electron. J. Probab. 12(25), 703\u2013766 (2007). (Electronic)"},{"key":"1_CR23","unstructured":"van der Hofstad, R., van Leeuwaarden, J., Stegehuis, C.: Hierarchical configuration model. arXiv:1512.08397 [math.PR], Preprint (2015)"},{"issue":"2","key":"1_CR24","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/rsa.20231","volume":"34","author":"S Janson","year":"2009","unstructured":"Janson, S., Luczak, M.: A new approach to the Giant component problem. Random Struct. Algorithms 34(2), 197\u2013216 (2009)","journal-title":"Random Struct. Algorithms"},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"JM Kleinberg","year":"2000","unstructured":"Kleinberg, J.M.: Navigation in a small world. Nature 406, 845 (2000)","journal-title":"Nature"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: The small-world phenomenon: an algorithm perspective. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 163\u2013170, May 2000","DOI":"10.1145\/335305.335325"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Krioukov, D., Kitsak, M., Sinkovits, R., Rideout, D., Meyer, D., Bogu\u00f1\u00e1, M.: Network cosmology. Sci. Rep. 2, Article number 793 (2012)","DOI":"10.1038\/srep00793"},{"issue":"1","key":"1_CR28","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"issue":"2\u20133","key":"1_CR29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6(2\u20133), 161\u2013179 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"1_CR30","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1017\/S0963548398003526","volume":"7","author":"M Molloy","year":"1998","unstructured":"Molloy, M., Reed, B.: The size of the Giant component of a random graph with a given degree sequence. Comb. Probab. Comput. 7(3), 295\u2013305 (1998)","journal-title":"Comb. Probab. Comput."},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"1_CR32","doi-asserted-by":"crossref","first-page":"7332","DOI":"10.1103\/PhysRevE.60.7332","volume":"60","author":"MEJ Newman","year":"1999","unstructured":"Newman, M.E.J., Watts, D.: Scaling and percolation in the small-world network model. Phys. Rev. E 60, 7332\u20137344 (1999)","journal-title":"Phys. Rev. E"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Stegehuis, C., van der Hofstad, R., van Leeuwaarden, J.: Epidemic spreading on complex networks with community structures. Sci. Rep. 6, 29748 (2016)","DOI":"10.1038\/srep29748"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Stegehuis, C., van der Hofstad, R., van Leeuwaarden, J.: Power-law relations in random networks with communities. Phys. Rev. E 94, 012302 (2016)","DOI":"10.1103\/PhysRevE.94.012302"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Watts, D.J.: Small Worlds. The Dynamics of Networks Between Order and Randomness. Princeton Studies in Complexity. Princeton University Press, Princeton (1999)","DOI":"10.1515\/9780691188331"},{"key":"1_CR36","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T16:50:10Z","timestamp":1693155010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}