On a cover time problem on a dynamic graph with steps at random times

We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Number of nodes covered at a certain time and number of returns to original states are analyzed in the resulting model.