1. A computer-implemented method, comprising: generating, by a computer, two or more sample graphs by sampling edges of a current snapshot of a dynamic graph, the snapshot of the dynamic graph having a plurality of vertices and a plurality of edges between the vertices, wherein each of the two or more sample graphs includes the same vertices; generating, by the computer, two or more partial results by executing an algorithm on the two or more sample graphs; combining, by the computer, the partial results, from executing the algorithm on the two or more sample graphs, into a final result thereby reducing storage consumption and execution time of the computer during analyzation of a dynamic graph; incrementally maintaining, by the computer, the sample graphs; using, by the computer, a hash function to generate one or more integers corresponding to one or more of the edges in one or more of the sample graphs, wherein the one or more integers corresponds to a life span of the respective one or more of the edges; and converting, by the computer, each of the one or more integers into a pseudorandom sample using a geometric distribution of a life span of the respective one or more of the edges, wherein each of the edges in the current snapshot has a timestamp associated therewith, wherein sampling the edges of the current snapshot of the dynamic graph includes sampling the edges according to a decay function, such that sampling probability is non-increasing over time.