Randomization has played a crucial role in the design of efficient algorithms for various problems on dynamic graphs. In this talk we will look at a couple of problems and illustrate underlying techniques.