Analysis of directed networks via partial singular value decomposition and Gauss quadrature
From MaRDI portal
Publication:2249727
Recommendations
- Network analysis via partial spectral factorization and Gauss quadrature
- Ranking hubs and authorities using matrix functions
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Block Gauss and anti-Gauss quadrature with application to networks
- Analysis of directed networks via the matrix exponential
Cites work
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Authoritative sources in a hyperlinked environment
- Block Gauss and anti-Gauss quadrature with application to networks
- Bounds for matrix moments
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Evaluating scientific products by means of citation-based models: a first analysis and validation
- Fast matrix computations for pairwise and columnwise commute times and Katz scores
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- scientific article; zbMATH DE number 5977361 (Why is no real title available?)
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- Locally supported eigenvectors of matrices associated with connected and unweighted power-law graphs
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Mapping directed networks
- Matrices, moments and quadrature with applications
- Matrices, moments, and rational quadrature
- Network analysis via partial spectral factorization and Gauss quadrature
- Network properties revealed through matrix functions
- Networks. An introduction.
- Quadrature rule-based bounds for functions of adjacency matrices
- Ranking hubs and authorities using matrix functions
- Restarted block Lanczos bidiagonalization methods
Cited in
(15)- GCV for Tikhonov regularization by partial SVD
- Ranking hubs and authorities using matrix functions
- The e-MoM approach for approximating matrix functionals
- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Generalized block anti-Gauss quadrature rules
- Bounding matrix functionals via partial global block Lanczos decomposition
- Analysis of directed networks via the matrix exponential
- New block quadrature rules for the approximation of matrix functions
- Network analysis via partial spectral factorization and Gauss quadrature
- hubauth
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- Matrix functions in network analysis
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- Simplified anti-Gauss quadrature rules with applications in linear algebra
This page was built for publication: Analysis of directed networks via partial singular value decomposition and Gauss quadrature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249727)
