Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
From MaRDI portal
Publication:5874469
DOI10.4230/LIPICS.ESA.2020.6OpenAlexW3082100445MaRDI QIDQ5874469FDOQ5874469
Authors: Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.13679
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
effective resistanceuniform spanning treeparallel samplingelectrical centrality measuresLaplacian pseudoinverse
Cites Work
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- Title not available (Why is that?)
- An introduction to support vector machines and other kernel-based learning methods.
- Extensions of Lipschitz mappings into a Hilbert space
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability on trees and networks
- Solving SDD linear systems in nearly m log 1/2 n time
- Approaching Optimality for Solving SDD Linear Systems
- A Nearly-m log n Time Solver for SDD Linear Systems
- Graph Sparsification by Effective Resistances
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- Incremental Computation of Pseudo-Inverse of Laplacian
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- STACS 2005
- An estimator for the diagonal of a matrix
- Fast computation of empirically tight bounds for the diameter of massive graphs
- The electrical resistance of a graph captures its commute and cover times
- Effective resistance on graphs and the epidemic quasimetric
- Minimizing Effective Resistance of a Graph
- Effective graph resistance
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- Axioms for Centrality
- Rational approximation to the Fermi-Dirac function with applications in density functional theory
- Sparsified Cholesky and multigrid solvers for connection laplacians
- An almost-linear time algorithm for uniform random spanning tree generation
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- Ranking of Closeness Centrality for Large-Scale Social Networks
- An efficient parallel solver for SDD linear systems
- Parallel Computation of Entries of ${A}^{-1}$
- Graph Clustering using Effective Resistance
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- Title not available (Why is that?)
- Computing Top-k Closeness Centrality Faster in Unweighted Graphs
Cited In (3)
Uses Software
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)
