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

DOI10.1007/978-3-319-03536-9_6zbMath1342.05165OpenAlexW105634271MaRDI QIDQ2938014

Kyle Kloster, David F. Gleich

Publication date: 13 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03536-9_6

zbMATH Keywords

matrix exponentiallocal algorithmsGauss-Southwell method

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Internet topics (68M11)

Related Items (4)

Computing heat kernel PageRank and a local clustering algorithm ⋮ Matrix functions in network analysis ⋮ Sublinear Algorithms for Local Graph-Centrality Estimation ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks

Uses Software

• Expokit

This page was built for publication: A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks