A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks

Abstract

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… (More)
DOI: 10.1007/978-3-319-03536-9_6

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Kloster2013ANM, title={A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks}, author={Kyle Kloster and David F. Gleich}, booktitle={WAW}, year={2013} }