Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Cover Time in Edge-Uniform Stochastically-Evolving Graphs is a scholarly work, published in 2018 in ''Algorithms''. The main subjects of the publication include delay-tolerant networking, random graph, complex network, edge cover, traverse, Enhanced Data Rates for GSM Evolution, graph, upper and lower bounds, Bounding overwatch, fault tolerance, discrete mathematics, cover, random walk, combinatorics, and mathematics. The authors 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.