We consider random-walk transition matrices from large social and information networks. For these matrices, we describe and evaluate a fast method to estimate one column of the matrix exponential. Our method runs in sublinear time on networks where the maximum degree grows doubly logarithmic with respect to the number of nodes. For collaboration networks with over 5 million edges, we find it runs in less than a second on a standard desktop machine. © 2013 Springer International Publishing.
CITATION STYLE
Kloster, K., & Gleich, D. F. (2013). A nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8305 LNCS, pp. 68–79). https://doi.org/10.1007/978-3-319-03536-9_6
Mendeley helps you to discover research relevant for your work.