{"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":1773729360076,"version":"3.50.1"},"reference-count":24,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T00:00:00Z","timestamp":1538438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We define a general model of stochastically-evolving graphs, namely the edge-uniform stochastically-evolving graphs. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete time step of evolution following a (Markovian) stochastic rule. The stochastic rule is identical for each possible edge and may depend on the past     k \u2265 0     observations of the edge\u2019s state. We examine two kinds of random walks for a single agent taking place in such a dynamic graph: (i) The Random Walk with a Delay (RWD), where at each step, the agent chooses (uniformly at random) an incident possible edge, i.e., an incident edge in the underlying static graph, and then, it waits till the edge becomes alive to traverse it. (ii) The more natural Random Walk on what is Available (RWA), where the agent only looks at alive incident edges at each time step and traverses one of them uniformly at random. Our study is on bounding the cover time, i.e., the expected time until each node is visited at least once by the agent. For RWD, we provide a first upper bound for the cases     k = 0 , 1     by correlating RWD with a simple random walk on a static graph. Moreover, we present a modified electrical network theory capturing the     k = 0     case. For RWA, we derive some first bounds for the case     k = 0    , by reducing RWA to an RWD-equivalent walk with a modified delay. Further, we also provide a framework that is shown to compute the exact value of the cover time for a general family of stochastically-evolving graphs in exponential time. Finally, we conduct experiments on the cover time of RWA in edge-uniform graphs and compare the experimental findings with our theoretical bounds.<\/jats:p>","DOI":"10.3390\/a11100149","type":"journal-article","created":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T11:30:02Z","timestamp":1538479802000},"page":"149","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Cover Time in Edge-Uniform Stochastically-Evolving Graphs"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5337-7336","authenticated-orcid":false,"given":"Ioannis","family":"Lamprou","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Liverpool, Liverpool L69 3BX, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Liverpool, Liverpool L69 3BX, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Liverpool, Liverpool L69 3BX, UK"},{"name":"Department of Computer Engineering and Informatics, University of Patras, 26504 Patras, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,10,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","article-title":"An Introduction to Temporal Graphs: An Algorithmic Perspective","volume":"12","author":"Michail","year":"2016","journal-title":"Internet Math."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R., Lipton, R., Lovasz, L., and Rackoff, C. (1979, January 29\u201331). Random walks, universal traversal sequences and the complexity of maze problems. Proceedings of the 20th IEEE Annual Symposium on Foundations of Computer Science, Washington, DC, USA.","DOI":"10.1109\/SFCS.1979.34"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., and Zernik, D. (1989, January 26\u201328). Random leaders and random spanning trees. Proceedings of the 3rd International Workshop on Distributed Algorithms, Nice, France.","DOI":"10.1007\/3-540-51687-5_27"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bui, M., Bernard, T., Sohier, D., and Bui, A. (2006). Random Walks in Distributed Computing: A Survey. IICS 2004, Springer. LNCS 3473.","DOI":"10.1007\/11553762_1"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., and Silvestri, R. (2008, January 18\u201321). Flooding time in edge-Markovian dynamic graphs. Proceedings of the PODC\u201908, Toronto, ON, Canada.","DOI":"10.1145\/1400751.1400781"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Baumann, H., Crescenzi, P., and Fraigniaud, P. (2009, January 10\u201312). Parsimonious flooding in dynamic graphs. Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC\u201909), Calgary, AB, Canada.","DOI":"10.1145\/1582716.1582757"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1109\/TPDS.2011.33","article-title":"Information Spreading in Stationary Markovian Evolving Graphs","volume":"22","author":"Clementi","year":"2011","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Avin, C., Kouck\u00fd, M., and Lotker, Z. (2008, January 7\u201311). How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP\u201908), Reykjavik, Iceland.","DOI":"10.1007\/978-3-540-70575-8_11"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Pasquale, F., and Silvestri, R. (2007, January 12\u201315). Communication in dynamic radio networks. Proceedings of the PODC\u201907, Portland, OR, USA.","DOI":"10.1145\/1281100.1281131"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Yamauchi, Y., Izumi, T., and Kamei, S. (2012, January 5\u20137). Mobile Agent Rendezvous on a Probabilistic Edge Evolving Ring. Proceedings of the Third International Conference on Networking and Computing (ICNC\u201912), Okinawa, Japan.","DOI":"10.1109\/ICNC.2012.23"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","article-title":"Temporal Networks","volume":"519","author":"Holme","year":"2012","journal-title":"Phys. Rep."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"056115","DOI":"10.1103\/PhysRevE.85.056115","article-title":"Random walks on temporal networks","volume":"85","author":"Starnini","year":"2012","journal-title":"Phys. Rev. E"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"063023","DOI":"10.1088\/1367-2630\/16\/6\/063023","article-title":"Random walk centrality for temporal networks","volume":"16","author":"Rocha","year":"2014","journal-title":"New J. Phys."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Figueiredo, D., Nain, P., Ribeiro, B., Silva, E.D.E., and Towsley, D. (2012, January 11\u201315). Characterizing Continuous Time Random Walks on Time Varying Graphs. Proceedings of the 12th ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, London, UK.","DOI":"10.1145\/2254756.2254794"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"7366","DOI":"10.1038\/ncomms8366","article-title":"Diffusion on networked systems is a question of time or structure","volume":"6","author":"Delvenne","year":"2015","journal-title":"Nat. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Hoffmann, T., Porter, M.A., and Lambiotte, R. (2013). Random Walks on Stochastic Temporal Networks. Temporal Networks, Springer.","DOI":"10.1007\/978-3-642-36461-7_15"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Raghavan, P., Ruzzo, W.L., and Smolensky, R. (1989, January 14\u201317). The electrical resistance of a graph captures its commute and cover times. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (STOC\u201989), Seattle, WA, USA.","DOI":"10.1145\/73007.73062"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Doyle, P.G., and Snell, J.L. (1984). Random Walks and Electric Networks, Mathematical Assn of Amer.","DOI":"10.5948\/UPO9781614440222"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., and Reed, B. (1998). Probabilistic Methods for Algorithmic Discrete Mathematics, Springer.","DOI":"10.1007\/978-3-662-12788-9"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Norris, J.R. (1997). Markov Chains, Cambridge University Press.","DOI":"10.1017\/CBO9780511810633"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/rsa.3240010303","article-title":"Maximum hitting time fo random walks on graphs","volume":"1","author":"Brightwell","year":"1990","journal-title":"Random Struct. Algorithms"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/rsa.3240060106","article-title":"A tight upper bound on the cover time for random walks on graphs","volume":"6","author":"Feige","year":"1995","journal-title":"Random Struct. Algorithms"},{"key":"ref_23","unstructured":"Wald, A. (1947). Sequential Analysis, John Wiley & Sons."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Bird, J. (2013). Electrical Circuit Theory and Technology, Routledge. [5th ed.].","DOI":"10.4324\/9781315883342"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/10\/149\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:23:44Z","timestamp":1760196224000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/10\/149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,2]]},"references-count":24,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2018,10]]}},"alternative-id":["a11100149"],"URL":"https:\/\/doi.org\/10.3390\/a11100149","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,2]]}}}