In this paper, we order events in time by using evidence present in their partial orders. We propose an algorithm named TimeRank, a variant of PageRank, for this task. PageRank operates on the hyperlink graph and orders the web pages according to their importance. We identify limitations of PageRank in the context of temporally ordering the nodes. We draw an analogy between the notion of importance in PageRank to the notion of recency in TimeRank. We evaluate TimeRank using the Citation Graph of scientific publications of physics and propose a baseline method to compare TimeRank and PageRank. The baseline method ranks the nodes according to their number of immediate predecessors without considering the higher order transitive relations among the events. Evaluation results suggest that TimeRank outperforms both the baseline method and PageRank in this task. © Springer International Publishing Switzerland 2015.