Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
From MaRDI portal
(Redirected from Publication:5874469)
Recommendations
- Approximations of the generalized inverse of the graph Laplacian matrix
- Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Network analysis via partial spectral factorization and Gauss quadrature
- On the approximation of Laplacian eigenvalues in graph disaggregation
- The Laplacian spectra of graphs and complex networks
- Estimating the trace of matrix functions with application to complex networks
- The spectrum of the graph Laplacian as a tool for analyzing structure and evolution of networks
- Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
- Comparison principles for the p-Laplacian on nonlinear networks
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Nearly-m log n Time Solver for SDD Linear Systems
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- An almost-linear time algorithm for uniform random spanning tree generation
- An efficient parallel solver for SDD linear systems
- An estimator for the diagonal of a matrix
- An introduction to support vector machines and other kernel-based learning methods.
- Approaching optimality for solving SDD linear systems
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- Axioms for Centrality
- Computing top-k closeness centrality faster in unweighted graphs
- Effective graph resistance
- Effective resistance on graphs and the epidemic quasimetric
- Extensions of Lipschitz mappings into a Hilbert space
- Fast computation of empirically tight bounds for the diameter of massive graphs
- Graph Clustering using Effective Resistance
- Graph sparsification by effective resistances
- Incremental computation of pseudo-inverse of Laplacian
- Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Minimizing Effective Resistance of a Graph
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- Parallel computation of entries of \({A}^{-1}\)
- Probability on trees and networks
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Ranking of Closeness Centrality for Large-Scale Social Networks
- Rational approximation to the Fermi-Dirac function with applications in density functional theory
- STACS 2005
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Sparsified Cholesky and multigrid solvers for connection Laplacians
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- The electrical resistance of a graph captures its commute and cover times
Cited in
(3)
This page was built for publication: Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874469)
