Matrix functions in network analysis
From MaRDI portal
Publication:6068264
DOI10.1002/gamm.202000012OpenAlexW3086898416MaRDI QIDQ6068264
Publication date: 15 December 2023
Published in: GAMM-Mitteilungen (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/gamm.202000012
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of the bilinear form \(y^\ast f(A)x\) for Hermitian matrices
- New block quadrature rules for the approximation of matrix functions
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- The communicability distance in graphs
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- The walk distances in graphs
- Mapping directed networks
- Beyond graph energy: norms of graphs and matrices
- Communicability graph and community structures in complex networks
- Topological evolution in dense granular materials: a complex networks perspective
- Quadrature rule-based bounds for functions of adjacency matrices
- Computation of functions of Hamiltonian and skew-symmetric matrices
- Gaussianization of the spectra of graphs and networks. Theory and applications
- Path Laplacian operators and superdiffusive processes on graphs. II. two-dimensional lattice
- Monitoring vulnerability and impact diffusion in financial networks
- On the exponential generating function for non-backtracking walks
- Computing heat kernel PageRank and a local clustering algorithm
- Walk entropy and walk-regularity
- Vector estimates for \(f(A)\mathbf b\) via extrapolation
- Energy of a vertex
- Ranking hubs and authorities using matrix functions
- The Lanczos algorithm and complex Gauss quadrature
- A spectral method to detect community structure based on the communicability modularity
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Some matrix properties preserved by generalized matrix functions
- Generalized block anti-Gauss quadrature rules
- Generalized anti-Gauss quadrature rules
- Network bipartivity and the transportation efficiency of European passenger airlines
- Aitken's method for estimating bilinear forms arising in applications
- Network analysis. Methodological foundations.
- What is the meaning of the graph energy after all?
- Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
- Complex networks: structure and dynamics
- Subgraph centrality and walk-regularity
- Semigroup methods for evolution equations on networks
- A note on walk entropies in graphs
- A new status index derived from sociometric analysis
- Operator-Lipschitz estimates for the singular value functional calculus
- Edge Modification Criteria for Enhancing the Communicability of Digraphs
- Community detection based on network communicability
- Communicability Angle and the Spatial Efficiency of Networks
- Network Analysis via Partial Spectral Factorization and Gauss Quadrature
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Graph Energy
- A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks
- Predicting Triadic Closure in Networks Using Communicability Distance Functions
- Numerical Methods for Large Eigenvalue Problems
- Network Properties Revealed through Matrix Functions
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
- Authoritative sources in a hyperlinked environment
- Computation of Generalized Matrix Functions
- Risk-Dependent Centrality in Economic and Financial Networks
- Non-backtracking walk centrality for directed networks
- Updating and Downdating Techniques for Optimizing Network Communicability
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Expander graphs and their applications
- Shareholding Networks and Centrality: An Application to the Italian Financial Market
- On generalized matrix functions
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Networks
- Consensus and Cooperation in Networked Multi-Agent Systems
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- On the Stability of Network Indices Defined by Means of Matrix Functions
- Decay Properties of Spectral Projectors with Applications to Electronic Structure
- A Matrix Iteration for Dynamic Network Summaries
- Graph Characteristics from the Schrödinger Operator
- Non-local network dynamics via fractional graph Laplacians
- Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks
- On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
- A Formula for the Fréchet Derivative of a Generalized Matrix Function
- Error Bounds for the Krylov Subspace Methods for Computations of Matrix Exponentials
- Low-Rank Updates of Matrix Functions
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- Functions of Matrices
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- Computation of the Exponential of Large Sparse Skew-Symmetric Matrices
This page was built for publication: Matrix functions in network analysis
