{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:53:40Z","timestamp":1742943220960,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_16","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"177-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees"],"prefix":"10.1007","author":[{"given":"Nans","family":"Lefebvre","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"16_CR1","volume-title":"Convergence of Probability Measures","author":"P Billingsley","year":"2009","unstructured":"Billingsley, P.: Convergence of Probability Measures. Wiley, New York (2009)"},{"key":"16_CR2","unstructured":"Bordenave, C.: Notes on random graphs and combinatorial optimization. Lecture notes. http:\/\/www.math.univ-toulouse.fr\/ bordenave\/coursRG.pdf"},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/107","volume-title":"Complex Graphs and Networks","author":"FRK Chung","year":"2006","unstructured":"Chung, F.R.K., Lu, L.: Complex Graphs and Networks, vol. 107. American mathematical society, Providence (2006)"},{"issue":"01","key":"16_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.2307\/2272945","volume":"41","author":"R Fagin","year":"1976","unstructured":"Fagin, R.: Probabilities on finite models. J. Symbolic Logic 41(01), 50\u201358 (1976)","journal-title":"J. Symbolic Logic"},{"key":"16_CR5","first-page":"17","volume":"5","author":"YV Glebskii","year":"1969","unstructured":"Glebskii, Y.V., Kogan, D.I., Liogonki, M.I., Talanov, V.A.: Range and degree of realizability of formulas in the restricted predicate calculus. Kibernetika 5, 17\u201327 (1969)","journal-title":"Kibernetika"},{"issue":"3\u20134","key":"16_CR6","first-page":"389","volume":"1","author":"S Haber","year":"2010","unstructured":"Haber, S., Krivelevich, M.: The logic of random regular graphs. J. Comb. 1(3\u20134), 389\u2013440 (2010)","journal-title":"J. Comb."},{"issue":"04","key":"16_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S0963548300001735","volume":"4","author":"S Janson","year":"1995","unstructured":"Janson, S.: Random regular graphs: asymptotic distributions and contiguity. Comb. Probab. Comput. 4(04), 369\u2013405 (1995)","journal-title":"Comb. Probab. Comput."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Janson, S.: The probability that a random multigraph is simple, II. preprint (2013). arXiv:1307.6344","DOI":"10.1239\/jap\/1417528471"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/rsa.3240030105","volume":"3","author":"JF Lynch","year":"1992","unstructured":"Lynch, J.F.: Probabilities of sentences about very sparse random graphs. Random Struct. Algorithms 3(1), 33\u201353 (1992)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/1094622.1094627","volume":"6","author":"JF Lynch","year":"2005","unstructured":"Lynch, J.F.: Convergence law for random graphs with specified degree sequence. ACM Trans. Comput. Log. (TOCL) 6(4), 727\u2013748 (2005)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics, and Computation","author":"M Mezard","year":"2009","unstructured":"Mezard, M., Montanari, A.: Information, Physics, and Computation. Oxford University Press, Oxford (2009)"},{"key":"16_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04538-1","volume-title":"The Strange Logic of Random Graphs","author":"J Spencer","year":"2001","unstructured":"Spencer, J.: The Strange Logic of Random Graphs, vol. 22. Springer, Berlin (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T10:14:24Z","timestamp":1675851264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}