{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T09:16:06Z","timestamp":1791450966737,"version":"4.3.3"},"reference-count":31,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"name":"Vanier Canada Graduate Scholarships"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009059","name":"Pacific Institute for Mathematical Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009059","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2017,1]]},"abstract":"<jats:p>Rumor spreading is a protocol for modeling the spread of information through a network via user-to-user interaction. The spatial preferred attachment (SPA) model is a random graph model for complex networks: Vertices are placed in a metric space, and the link probability depends on the metric distance between vertices and on their degree. We show that the SPA model typically produces graphs that have small effective diameter, i.e., $O(\\log^2 n)$, while rumor spreading is relatively slow, namely, polynomial in $n$.<\/jats:p>","DOI":"10.1137\/16m1083256","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T17:39:16Z","timestamp":1509039556000},"page":"2414-2428","source":"Crossref","is-referenced-by-count":7,"title":["Rumors Spread Slowly in a Small-World Spatial Network"],"prefix":"10.1137","volume":"31","author":[{"given":"Jeannette","family":"Janssen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abbas","family":"Mehrabian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129305"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0106052"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625246"},{"key":"atypb4","first-page":"13","author":"Bonato A.","year":"2014","journal-title":"New York"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129304"},{"key":"atypb6","unstructured":"K. Bringmann, R. Keusch, and J. Lengler,\n                      Average Distance in a General Class of Scale-Free Networks with Underlying Geometry\n                      , preprint,arXiv:1602.05712, 2016."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.05.007"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.796301"},{"key":"atypb9","first-page":"1","author":"Demers A.","year":"1987","journal-title":"New York"},{"key":"atypb10","first-page":"21","author":"Doerr B.","year":"2011","journal-title":"New York"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010406"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2007.10129137"},{"key":"atypb13","first-page":"1642","author":"Fountoulakis N.","year":"2012","journal-title":"New York"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9710-y"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1214\/12-AIHP498"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1214\/14-AAP1006"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOP1098"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.671149"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2012.09.001"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2015.1110543"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"R. Karp, C. Schindelhauer, S. Shenker, and B. Vo\u0308cking,\n                      Randomized rumor spreading\n                      , in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2000, pp. 565-574,https:\/\/doi.org\/10.1109\/SFCS.2000.892324.","DOI":"10.1109\/SFCS.2000.892324"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, and E. Tardos,\n                      Maximizing the spread of influence through a social network\n                      , in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 137-146.","DOI":"10.1145\/956750.956769"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.116.208302"},{"key":"atypb25","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1297332.1297334","volume":"1","author":"Leskovec J.","year":"2007","journal-title":"ACM Trans. Knowledge Discovery Data"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1093\/icc\/13.1.263"},{"key":"atypb28","first-page":"115","author":"Ostroumova Prokhorenkova L.","year":"2016","journal-title":"New York"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.63.066117"},{"key":"atypb30","doi-asserted-by":"crossref","unstructured":"M. Penrose,\n                      Random Geometric Graphs\n                      , Oxford Stud. Probab., Oxford University Press, Oxford, UK, 2003.","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"atypb31","first-page":"5","author":"Zuev K.","year":"2015","journal-title":"Nature Sci. Rep."}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1083256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:43:14Z","timestamp":1787319794000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1083256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1137\/16M1083256"],"URL":"https:\/\/doi.org\/10.1137\/16m1083256","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}