{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:26:48Z","timestamp":1774438008485,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319035352","type":"print"},{"value":"9783319035369","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03536-9_2","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T01:59:42Z","timestamp":1386554382000},"page":"14-25","source":"Crossref","is-referenced-by-count":13,"title":["A Spatial Preferential Attachment Model with Local Clustering"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Jacob","sequence":"first","affiliation":[]},{"given":"Peter","family":"M\u00f6rters","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/15427951.2008.10129305","volume":"5","author":"W. Aiello","year":"2009","unstructured":"Aiello, W., Bonato, A., Cooper, C., Janssen, J., Pra\u0142at, P.: A spatial web graph model with local influence regions. Internet Mathematics\u00a05, 175\u2013196 (2009)","journal-title":"Internet Mathematics"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Modern Phys.\u00a074, 47\u201397 (2002)","journal-title":"Rev. Modern Phys."},{"key":"2_CR3","doi-asserted-by":"publisher","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\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Berger, N., Borgs, C., Chayes, J., Saberi, A.: Asymptotic behavior and distributional limits of preferential attachment graphs. Ann. Prob. (to appear, 2013)","DOI":"10.1214\/12-AOP755"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1214\/12-AAP874","volume":"23","author":"M. Bloznelis","year":"2013","unstructured":"Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. Ann. Appl. Prob.\u00a023, 1254\u20131289 (2013)","journal-title":"Ann. Appl. Prob."},{"key":"2_CR6","first-page":"1","volume-title":"Handbook of Graphs and Networks","author":"B. Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s, B., Riordan, O.M.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, pp. 1\u201334. Wiley-VCH, Weinheim (2003)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/15427951.2012.625246","volume":"8","author":"A. Bonato","year":"2012","unstructured":"Bonato, A., Janssen, J., Pralat, P.: Geometric protean graphs. Internet Mathematics\u00a08, 2\u201328 (2012)","journal-title":"Internet Mathematics"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-30541-2_3","volume-title":"Algorithms and Models for the Web Graph","author":"C. Cooper","year":"2012","unstructured":"Cooper, C., Frieze, A., Pra\u0142at, P.: Some typical properties of the spatial preferred attachment model. In: Bonato, A., Janssen, J. (eds.) WAW 2012. LNCS, vol.\u00a07323, pp. 29\u201340. Springer, Heidelberg (2012)"},{"issue":"43","key":"2_CR9","first-page":"1222","volume":"14","author":"S. Dereich","year":"2009","unstructured":"Dereich, S., M\u00f6rters, P.: Random networks with sublinear preferential attachment: degree evolutions. Electron. J. Probab.\u00a014(43), 1222\u20131267 (2009)","journal-title":"Electron. J. Probab."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1365\/s13291-010-0011-6","volume":"113","author":"S. Dereich","year":"2011","unstructured":"Dereich, S., M\u00f6rters, P.: Random networks with concave preferential attachment rule. Jahresber. Dtsch. Math.-Ver.\u00a0113, 21\u201340 (2011)","journal-title":"Jahresber. Dtsch. Math.-Ver."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1214\/11-AOP697","volume":"41","author":"S. Dereich","year":"2013","unstructured":"Dereich, S., M\u00f6rters, P.: Random networks with sublinear preferential attachment: the giant component. Ann. Prob.\u00a041, 329\u2013384 (2013)","journal-title":"Ann. Prob."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/15427951.2006.10129124","volume":"3","author":"A.D. Flaxman","year":"2006","unstructured":"Flaxman, A.D., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks. Internet Math.\u00a03, 187\u2013205 (2006)","journal-title":"Internet Math."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-77004-6_4","volume-title":"Algorithms and Models for the Web-Graph","author":"A.D. Flaxman","year":"2007","unstructured":"Flaxman, A.D., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks II. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol.\u00a04863, pp. 41\u201355. Springer, Heidelberg (2007)"},{"key":"2_CR14","unstructured":"Jacob, E., M\u00f6rters, P.: Spatial preferential attachment networks: Power laws and clustering coefficients. arXiv:1210.3830 (2012)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.aam.2012.09.001","volume":"50","author":"J. Janssen","year":"2013","unstructured":"Janssen, J., Pralat, P., Wilson, R.: Geometric graph properties of the spatial preferred attachment model. Adv. Appl. Math.\u00a050, 243\u2013267 (2013)","journal-title":"Adv. Appl. Math."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1239\/aap\/1275055230","volume":"42","author":"J. Jordan","year":"2010","unstructured":"Jordan, J.: Degree sequences of geometric preferential attachment graphs. Adv. in Appl. Probab.\u00a042, 319\u2013330 (2010)","journal-title":"Adv. in Appl. Probab."},{"key":"2_CR17","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511895357","volume-title":"Continuum percolation","author":"R. Meester","year":"1996","unstructured":"Meester, R., Roy, R.: Continuum percolation. Cambridge Tracts in Mathematics, vol.\u00a0119. Cambridge University Press, Cambridge (1996)"},{"key":"2_CR18","series-title":"Oxford Studies in Probability","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random geometric graphs","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Random geometric graphs. Oxford Studies in Probability, vol.\u00a05. Oxford University Press, Oxford (2003)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1214\/aoap\/1042765669","volume":"13","author":"M.D. Penrose","year":"2003","unstructured":"Penrose, M.D., Yukich, J.E.: Weak laws of large numbers in geometric probability. Ann. Appl. Probab.\u00a013, 277\u2013303 (2003)","journal-title":"Ann. Appl. Probab."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1002\/rsa.20137","volume":"31","author":"A. Rudas","year":"2007","unstructured":"Rudas, A., T\u00f3th, B., Valk\u00f3, B.: Random trees and general branching processes. Random Structures Algorithms\u00a031, 186\u2013202 (2007)","journal-title":"Random Structures Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03536-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:49:51Z","timestamp":1676843391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03536-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035352","9783319035369"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03536-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}