Finding Densest Lasting Subgraphs in Dynamic Graphs: a Stochastic Approach