I want to analyze the expected running time of my algorithm for a dynamic graph problem, does it make sense if I treated the update sequence as a random sequence? In usual,