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_6zbMATH Open1342.05165OpenAlexW105634271MaRDI QIDQ2938014FDOQ2938014

Authors: 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

Recommendations

• Sublinear column-wise actions of the matrix exponential on social networks
• A numerical study of large sparse matrix exponentials arising in Markov chains.
• Multiscale matrix sampling and sublinear-time PageRank computation
• Fast matrix computations for pairwise and columnwise commute times and Katz scores
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication

zbMATH Keywords

matrix exponentiallocal algorithmsGauss-Southwell method

Mathematics Subject Classification ID

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

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938014)