{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:21:09Z","timestamp":1743099669147,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"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-662-47666-6_37","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"467-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Symmetric Graph Properties Have Independent Edges"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Achlioptas","sequence":"first","affiliation":[]},{"given":"Paris","family":"Siminelakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Siminelakis, P.: Navigability is a robust property. CoRR, abs\/1501.04931 (2015)","DOI":"10.1007\/978-3-319-26784-5_7"},{"key":"37_CR2","unstructured":"Bollob\u00e1s, B.: Random graphs, vol. 73. Cambridge Studies in Advanced Mathematics, 2nd edn. Cambridge University Press, Cambridge (2001)"},{"key":"37_CR3","unstructured":"Borgs, C., Chayes, J.T., Cohn, H., Zhao, Y.: An $${\\$} {\\rm L} \\hat{\\,} {\\rm p}$$ $${\\$}$$ theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions. ArXiv e-prints, January 2014"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Chung, F.R.K., Lu, L.: Complex graphs and networks, vol. 107. American mathematical society Providence (2006)","DOI":"10.1090\/cbms\/107"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Durrett, R.: Random graph dynamics, vol. 20. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546594"},{"key":"37_CR6","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. Publicationes Mathematicae Debrecen 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae Debrecen"},{"issue":"2","key":"37_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A Frieze","year":"1999","unstructured":"Frieze, A., Kannan, R.: Quick approximation to matrices and applications. Combinatorica 19(2), 175\u2013220 (1999)","journal-title":"Combinatorica"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Gilbert, E.N.: Random graphs. The Annals of Mathematical Statistics, 1141\u20131144 (1959)","DOI":"10.1214\/aoms\/1177706098"},{"issue":"2","key":"37_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1561\/2200000005","volume":"2","author":"A Goldenberg","year":"2010","unstructured":"Goldenberg, A., Zheng, A.X., Fienberg, S.E., Airoldi, E.M.: A survey of statistical network models. Found. Trends Mach. Learn. 2(2), 129\u2013233 (2010)","journal-title":"Found. Trends Mach. Learn."},{"key":"37_CR10","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"issue":"6798","key":"37_CR11","doi-asserted-by":"publisher","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(6798), 845 (2000)","journal-title":"Nature"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Small-world phenomena and the dynamics of information. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) NIPS, pp. 431\u2013438. MIT Press (2001)","DOI":"10.7551\/mitpress\/1120.003.0060"},{"key":"37_CR13","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: An approach to modeling networks. The Journal of Machine Learning Research 11, 985\u20131042 (2010)","journal-title":"The Journal of Machine Learning Research"},{"issue":"2","key":"37_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Large networks and graph limits, vol. 60. American Mathematical Soc. (2012)","DOI":"10.1090\/coll\/060"},{"key":"37_CR16","unstructured":"Mode, C.J.: Multitype branching processes: theory and applications. Modern analytic and computational methods in science and mathematics. American Elsevier Pub. Co. (1971)"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Newman, M.: Networks: an introduction. Oxford University Press (2010)","DOI":"10.1093\/acprof:oso\/9780199206650.003.0001"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T16:11:23Z","timestamp":1717949483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_37","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":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}