{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:41:47Z","timestamp":1771623707839,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662451731","type":"print"},{"value":"9783662451748","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45174-8_23","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T15:28:20Z","timestamp":1412004500000},"page":"333-345","source":"Crossref","is-referenced-by-count":11,"title":["Random Walks on Evolving Graphs with Recurring Topologies"],"prefix":"10.1007","author":[{"given":"Oksana","family":"Denysyuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Unpublished (1995)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science, FOCS 1979, pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C. Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1365815.1365817","volume":"26","author":"Z. Bar-Yossef","year":"2008","unstructured":"Bar-Yossef, Z., Friedman, R., Kliot, G.: Rawms - random walk based lightweight membership service for wireless ad hoc networks. ACM Trans. Comput. Syst.\u00a026(2), 1\u201366 (2008)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"5","key":"23_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1002\/jgt.3190140505","volume":"14","author":"G. Brightwell","year":"1990","unstructured":"Brightwell, G., Winkler, P.: Extremal cover times for random walks on trees. Journal of Graph Theory\u00a014(5), 547\u2013554 (1990)","journal-title":"Journal of Graph Theory"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01048273","volume":"2","author":"A.Z. Broder","year":"1988","unstructured":"Broder, A.Z., Karlin, A.R.: Bounds on the cover time. J. Theoretical Probab.\u00a02, 101\u2013120 (1988)","journal-title":"J. Theoretical Probab."},{"issue":"5","key":"23_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A. Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems\u00a027(5), 387\u2013408 (2012)","journal-title":"International Journal of Parallel, Emergent and Distributed Systems"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1281100.1281131","volume-title":"Proceedings of the Twenty-sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007","author":"A.E.F. Clementi","year":"2007","unstructured":"Clementi, A.E.F., Pasquale, F., Monti, A., Silvestri, R.: Communication in dynamic radio networks. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, pp. 205\u2013214. ACM, New York (2007)"},{"key":"23_CR9","first-page":"213","volume-title":"PODC 2008","author":"A.E.F. Clementi","year":"2008","unstructured":"Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: PODC 2008, pp. 213\u2013222. ACM, New York (2008)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1080\/15427951.2004.10129078","volume":"1","author":"C. Cooper","year":"2003","unstructured":"Cooper, C., Frieze, A.: Crawling on simple models of web graphs. Internet Mathematics\u00a01, 57\u201390 (2003)","journal-title":"Internet Mathematics"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-33651-5_10","volume-title":"Distributed Computing","author":"A. Das Sarma","year":"2012","unstructured":"Das Sarma, A., Molla, A.R., Pandurangan, G.: Fast distributed computation in dynamic networks via random walks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 136\u2013150. Springer, Heidelberg (2012)"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"433","DOI":"10.4007\/annals.2004.160.433","volume":"160","author":"A. Dembo","year":"2004","unstructured":"Dembo, A., Peres, Y., Rosen, J., Zeitouni, O.: Cover times for brownian motion and random walks in two dimensions. Annals of Mathematics\u00a0160(2), 433\u2013464 (2004)","journal-title":"Annals of Mathematics"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TMC.2006.104","volume":"5","author":"S. Dolev","year":"2006","unstructured":"Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Transactions on Mobile Computing\u00a05, 893\u2013905 (2006)","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/rsa.3240060406","volume":"6","author":"U. Feige","year":"1995","unstructured":"Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Struct. Algorithms\u00a06, 433\u2013438 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.peva.2005.01.002","volume":"63","author":"C. Gkantsidis","year":"2006","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks: algorithms and evaluation. Perform. Eval.\u00a063, 241\u2013263 (2006)","journal-title":"Perform. Eval."},{"key":"23_CR16","first-page":"293","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011","author":"B. Haeupler","year":"2011","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 293\u2013302. ACM, New York (2011)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1993806.1993885","volume-title":"Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011","author":"B. Haeupler","year":"2011","unstructured":"Haeupler, B., Karger, D.: Faster information dissemination in dynamic networks via network coding. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 381\u2013390. ACM, New York (2011)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-33651-5_12","volume-title":"Distributed Computing","author":"B. Haeupler","year":"2012","unstructured":"Haeupler, B., Kuhn, F.: Lower bounds on information dissemination in dynamic networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 166\u2013180. Springer, Heidelberg (2012)"},{"key":"23_CR19","volume-title":"Matrix analysis","author":"R.A. Horn","year":"1986","unstructured":"Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge University Press, New York (1986)"},{"issue":"4","key":"23_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/71.995817","volume":"13","author":"S. Ikeda","year":"2002","unstructured":"Ikeda, S., Kubo, I., Okumoto, N., Yamashita, M.: Fair circulation of a token. IEEE Transactions on Parallel and Distributed Systems\u00a013(4), 367\u2013372 (2002)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"23_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0963548398003538","volume":"7","author":"J. Jonasson","year":"1998","unstructured":"Jonasson, J.: On the cover time for random walks on random graphs. Comb. Probab. Comput.\u00a07(3), 265\u2013279 (1998)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01048274","volume":"2","author":"J.D. Kahn","year":"1989","unstructured":"Kahn, J.D., Linial, N., Nisan, N., Saks, M.E.: On the cover time of random walks on graphs. Journal of Theoretical Probability\u00a02(1), 121\u2013128 (1989)","journal-title":"Journal of Theoretical Probability"},{"key":"23_CR23","volume-title":"Nonhomogeneous matrix products","author":"S. Kirkland","year":"2002","unstructured":"Kirkland, S.: Nonhomogeneous matrix products. World Scientific, River Edge (2002)"},{"key":"23_CR24","first-page":"513","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010","author":"F. Kuhn","year":"2010","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 513\u2013522. ACM, New York (2010)"},{"issue":"1","key":"23_CR25","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F. Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: Models and algorithms. SIGACT News\u00a042(1), 82\u201396 (2011)","journal-title":"SIGACT News"},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1993806.1993808","volume-title":"Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011","author":"F. Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 1\u201310. ACM, New York (2011)"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Law, C., Siu, K.-Y.: Distributed construction of random expander networks. In: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, INFOCOM 2003, vol.\u00a03, pp. 2133\u20132143. IEEE Societies (2003)","DOI":"10.1109\/INFCOM.2003.1209234"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Leitao, J., Pereira, J., Rodrigues, L.: Hyparview: A membership protocol for reliable gossip-based broadcast. In: In IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2007, pp. 419\u2013428. IEEE Computer Society (2007)","DOI":"10.1109\/DSN.2007.56"},{"key":"23_CR29","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey (1993)"},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/1146381.1146402","volume-title":"Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006","author":"L. Massouli\u00e9","year":"2006","unstructured":"Massouli\u00e9, L., Le Merrer, E., Kermarrec, A.-M., Ganesh, A.: Peer counting and sampling in overlay networks: random walk methods. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, pp. 123\u2013132. ACM, New York (2006)"},{"key":"23_CR31","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/MCSA.1999.749281","volume-title":"Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, WMCSA 1999","author":"C.E. Perkins","year":"1999","unstructured":"Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, WMCSA 1999, pp. 90\u2013100. IEEE Computer Society, Washington, DC (1999)"},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/383059.383071","volume-title":"Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2001","author":"I. Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Frans Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2001, pp. 149\u2013160. ACM, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45174-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T14:59:15Z","timestamp":1565881155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45174-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662451731","9783662451748"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45174-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}