{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T06:36:00Z","timestamp":1773729360066,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,6]],"date-time":"2014-06-06T00:00:00Z","timestamp":1402012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00446-014-0219-2","type":"journal-article","created":{"date-parts":[[2014,6,5]],"date-time":"2014-06-05T19:58:30Z","timestamp":1401998310000},"page":"55-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Information spreading in dynamic graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Andrea","family":"Clementi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,6]]},"reference":[{"key":"219_CR1","unstructured":"Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs, Chap. 14 (1999). http:\/\/www.stat.berkeley.edu\/aldous\/RWG\/book.html"},{"key":"219_CR2","doi-asserted-by":"crossref","unstructured":"Avin, C., Koucky, M., Lotker, Z.: How to explore a fast-changing world. In: Proceedings of 35th ICALP\u201908, LNCS, vol. 5125, pp. 121\u2013132 (2008)","DOI":"10.1007\/978-3-540-70575-8_11"},{"issue":"1","key":"219_CR3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocation. SIAM J. Comput. 29(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"219_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s00446-011-0133-9","volume":"24","author":"H Baumann","year":"2011","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distrib. Comput. 24(1), 31\u201344 (2011)","journal-title":"Distrib. Comput."},{"key":"219_CR5","unstructured":"Becchetti, L., Clementi, A.E.F., Pasquale, F., Resta, G., Santi, P., Silvestri, R.: Information spreading in opportunistic networks is fast. arXiv:1107.5241v1 (2011)"},{"key":"219_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/TMC.2003.1233531","volume":"2","author":"C Bettstetter","year":"2003","unstructured":"Bettstetter, C., Resta, G., Santi, P.: The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. Mob. Comput. 2, 257\u2013269 (2003)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"5","key":"219_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1002\/wcm.72","volume":"2","author":"T Camp","year":"2002","unstructured":"Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. Wirel. Commun. Mob. Comput. 2(5), 483\u2013502 (2002)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"219_CR8","unstructured":"Camp, T., Navidi, W., Bauer, N.: Improving the accuracy of random waypoint simulations through steady-state initialization. In: Proceedings of 15th Interantional Conference on Modelling and Simulation, pp. 319\u2013326 (2004)"},{"issue":"24","key":"219_CR9","doi-asserted-by":"crossref","first-page":"2602","DOI":"10.1016\/j.tcs.2010.11.001","volume":"412","author":"F Chierichetti","year":"2011","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumor spreading in social networks. Theor. Comput. Sci. 412(24), 2602\u20132610 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"219_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.jcss.2008.10.004","volume":"75","author":"A Clementi","year":"2009","unstructured":"Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4), 213\u2013230 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"219_CR11","doi-asserted-by":"crossref","first-page":"1694","DOI":"10.1137\/090756053","volume":"24","author":"A Clementi","year":"2010","unstructured":"Clementi, A., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time of edge-Markovian evolving graphs. SIAM J. Discrete Math. 24(4), 1694\u20131712 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"9","key":"219_CR12","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1109\/TPDS.2011.33","volume":"22","author":"A Clementi","year":"2011","unstructured":"Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Information spreading in stationary markovian evolving graphs. IEEE Trans. Parallel Distrib. Syst. 22(9), 1425\u20131432 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"219_CR13","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TNET.2012.2204407","volume":"21","author":"A Clementi","year":"2013","unstructured":"Clementi, A., Pasquale, F., Silvestri, R.: Opportunistic manets: high mobility can make up for low transmission power. IEEE\/ACM Trans. Netw. 21(2), 610\u2013620 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"219_CR14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00446-012-0182-8","volume":"26","author":"A Clementi","year":"2013","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Flooding over Manhattan. Distrib. Comput. 26(1), 25\u201338 (2013)","journal-title":"Distrib. Comput."},{"issue":"6","key":"219_CR15","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1016\/j.adhoc.2010.09.002","volume":"9","author":"A Clementi","year":"2011","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Modelling mobility: a discrete revolution. Ad Hoc Netw. 9(6), 998\u20131014 (2011)","journal-title":"Ad Hoc Netw."},{"issue":"8","key":"219_CR16","doi-asserted-by":"crossref","first-page":"2577","DOI":"10.1016\/j.dam.2006.04.026","volume":"154","author":"T Dimitriou","year":"2006","unstructured":"Dimitriou, T., Nikoletseas, S., Spirakis, P.: The infection time of graphs. Discrete Appl. Math. 154(8), 2577\u20132589 (2006)","journal-title":"Discrete Appl. Math."},{"key":"219_CR17","doi-asserted-by":"crossref","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets. Cambridge University Press, Cambridge (2010)","DOI":"10.1017\/CBO9780511761942"},{"issue":"1","key":"219_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1137\/S0097539795292208","volume":"29","author":"B Ghosh","year":"1999","unstructured":"Ghosh, B., Leighton, F.T., Maggs, B.M., Muthukrishnan, S., Plaxton, C.G., Rajaraman, R., Richa, A.W., Tarjan, R.E., Zuckerman, D.I.: Tight analyses of two local load balancing algorithms. SIAM J. Comput. 29(1), 29\u201364 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2115","key":"219_CR19","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1098\/rspa.2009.0456","volume":"466","author":"P Grindrod","year":"2010","unstructured":"Grindrod, P., Higham, D.J.: Evolving graphs: dynamical models, inverse problems and propagation. Proc. R. Soc. A 466(2115), 753\u2013770 (2010)","journal-title":"Proc. R. Soc. A"},{"key":"219_CR20","doi-asserted-by":"crossref","first-page":"5001","DOI":"10.1109\/TIT.2010.2059830","volume":"56","author":"P Jacquet","year":"2010","unstructured":"Jacquet, P., Mans, B., Rodolakis, G.: Information propagation speed in mobile and delay tolerant networks. IEEE Trans. Inf. Theory 56, 5001\u20135015 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"219_CR21","doi-asserted-by":"crossref","unstructured":"Karagiannis, T., Le Boudec, J.-Y., Vojnovic, M.: Power law and exponential decay of inter contact times between mobile devices. In: Proceedings of 13th ACM MOBICOM, pp. 183\u2013194 (2007)","DOI":"10.1145\/1287853.1287875"},{"issue":"6","key":"219_CR22","doi-asserted-by":"crossref","first-page":"2402","DOI":"10.1214\/009117905000000413","volume":"33","author":"H Kesten","year":"2005","unstructured":"Kesten, H., Sidoravicius, V.: The spread of a rumor or infection in a moving population. Ann. Probab. 33(6), 2402\u20132462 (2005)","journal-title":"Ann. Probab."},{"key":"219_CR23","doi-asserted-by":"crossref","unstructured":"Khun, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of 42nd ACM STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"1","key":"219_CR24","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F Khun","year":"2011","unstructured":"Khun, F., Oshman, R.: Dynamic networks: models and algorithms. ACM SIGACT News 42(1), 82\u201396 (2011)","journal-title":"ACM SIGACT News"},{"key":"219_CR25","doi-asserted-by":"crossref","unstructured":"Lam, H., Liu, Z., Mitzenmacher, M., Sun, X., Wang, Y.: Information dissemination via random walks in d-dimensional space. In: Proceedings of 23rd ACM-SIAM SODA, pp. 1612\u20131622 (2012)","DOI":"10.1137\/1.9781611973099.128"},{"issue":"6","key":"219_CR26","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1109\/TNET.2006.886311","volume":"14","author":"J-Y Boudec Le","year":"2006","unstructured":"Le Boudec, J.-Y., Vojnovic, M.: The random trip model: stability, stationary regime, and perfect simulation. IEEE\/ACM Trans. Netw. 14(6), 1153\u20131166 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"219_CR27","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.peva.2006.03.001","volume":"64","author":"J-Y Boudec Le","year":"2007","unstructured":"Le Boudec, J.-Y.: Understanding the simulation of mobility models with palm calculus. Perform. Eval. 64(2), 126\u2013147 (2007)","journal-title":"Perform. Eval."},{"key":"219_CR28","doi-asserted-by":"crossref","unstructured":"Peres, Y., Sinclair, A., Sousi, P., Stauffer, A.: Mobile geometric graphs: detection, coverage and percolation. In: Proceedings of 22nd ACM-SIAM SODA, pp. 412\u2013428 (2011)","DOI":"10.1137\/1.9781611973082.33"},{"key":"219_CR29","doi-asserted-by":"crossref","unstructured":"Pettarin, A., Pietracaprina, A., Pucci, G., Upfal, E.: Tight bounds on information dissemination in sparse mobile networks. In: Proceedings of 30th ACM PODC, pp. 355\u2013362 (2011)","DOI":"10.1145\/1993806.1993882"},{"key":"219_CR30","doi-asserted-by":"crossref","unstructured":"Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of Markov chains and the analysis of iterative load-balancing schemes. In: Proceedings of 39th IEEE FOCS, pp. 694\u2013703 (1998)","DOI":"10.1109\/SFCS.1998.743520"},{"issue":"1","key":"219_CR31","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1504\/IJAACS.2008.019198","volume":"1","author":"T Spyropoulos","year":"2008","unstructured":"Spyropoulos, T., Jindal, A., Psounis, K.: An analytical study of fundamental mobility properties for encounter based protocols. Int. J. Auton. Adapt. Commun. Syst. 1(1), 4\u201340 (2008)","journal-title":"Int. J. Auton. Adapt. Commun. Syst."},{"key":"219_CR32","doi-asserted-by":"crossref","unstructured":"Vojnovic, M., Proutier, A.: Hop limited flooding over dynamic networks. In: Proceedings of 30th IEEE INFOCOM, pp. 685\u2013693 (2011)","DOI":"10.1109\/INFCOM.2011.5935249"},{"issue":"5","key":"219_CR33","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1109\/TCOMM.2011.020811.090163","volume":"59","author":"J Whitbeck","year":"2011","unstructured":"Whitbeck, J., Conan, V., de Amorim, M.D.: Performance of opportunistic epidemic routing on edge-Markovian dynamic graphs. IEEE Trans. Commun. 59(5), 1259\u20131263 (2011)","journal-title":"IEEE Trans. Commun."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0219-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0219-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0219-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T07:19:54Z","timestamp":1746256794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0219-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,6]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["219"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0219-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,6]]}}}