Analysis of directed networks via partial singular value decomposition and Gauss quadrature

DOI10.1016/j.laa.2014.05.018zbMath1295.05216OpenAlexW2141841756MaRDI QIDQ2249727

Caterina Fenu, Giuseppe Rodriguez, James Baglama, Lothar Reichel

Publication date: 3 July 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.05.018

zbMATH Keywords

Gauss quadraturelow-rank approximationcomplex networkspartial SVDhubs and authorities

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (11)

New block quadrature rules for the approximation of matrix functions ⋮ Matrix functions in network analysis ⋮ GCV for Tikhonov regularization by partial SVD ⋮ Analysis of directed networks via the matrix exponential ⋮ Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods ⋮ Performance and stability of direct methods for computing generalized inverses of the graph Laplacian ⋮ The e-MoM approach for approximating matrix functionals ⋮ Simplified anti-Gauss quadrature rules with applications in linear algebra ⋮ hubauth ⋮ Generalized block anti-Gauss quadrature rules ⋮ Bounding matrix functionals via partial global block Lanczos decomposition

Uses Software

• na26
• OPQ
• sgcen
• blgaussexp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mapping directed networks
• Evaluating scientific products by means of citation-based models: a first analysis and validation
• Restarted block Lanczos bidiagonalization methods
• Matrices, moments, and rational quadrature
• Quadrature rule-based bounds for functions of adjacency matrices
• Bounds for matrix moments
• Ranking hubs and authorities using matrix functions
• Estimation of the \(L\)-curve via Lanczos bidiagonalization
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• Locally supported eigenvectors of matrices associated with connected and unweighted power-law graphs
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• Network Analysis via Partial Spectral Factorization and Gauss Quadrature
• Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores
• Network Properties Revealed through Matrix Functions
• Authoritative sources in a hyperlinked environment
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• Block Gauss and Anti-Gauss Quadrature with Application to Networks
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• Networks

This page was built for publication: Analysis of directed networks via partial singular value decomposition and Gauss quadrature