Matrix functions in network analysis
From MaRDI portal
Recommendations
- Network properties revealed through matrix functions
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Gaussianization of the spectra of graphs and networks. Theory and applications
- Network analysis with the aid of the path length matrix
- Analysis of directed networks via the matrix exponential
Cites work
- A formula for the Fréchet derivative of a generalized matrix function
- A matrix iteration for dynamic network summaries
- A nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks
- A new status index derived from sociometric analysis
- A note on walk entropies in graphs
- A spectral method to detect community structure based on the communicability modularity
- Aitken's method for estimating bilinear forms arising in applications
- Algebraic characterization of strongly connected graphs
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Approximation theory and approximation practice
- Authoritative sources in a hyperlinked environment
- Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
- Beyond graph energy: norms of graphs and matrices
- Block Gauss and anti-Gauss quadrature with application to networks
- Communicability angle and the spatial efficiency of networks
- Communicability graph and community structures in complex networks
- Community detection based on network communicability
- Community structure in social and biological networks
- Complex networks: structure and dynamics
- Computation of functions of Hamiltonian and skew-symmetric matrices
- Computation of generalized matrix functions
- Computation of the Exponential of Large Sparse Skew-Symmetric Matrices
- Consensus and Cooperation in Networked Multi-Agent Systems
- Decay properties of spectral projectors with applications to electronic structure
- Edge modification criteria for enhancing the communicability of digraphs
- Eigenspaces of graphs
- Energy of a vertex
- Error bounds for the Krylov subspace methods for computations of matrix exponentials
- Estimation of the bilinear form y^ f(A)x for Hermitian matrices
- Expander graphs and their applications
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- Functions of Matrices
- Gaussianization of the spectra of graphs and networks. Theory and applications
- Generalized anti-Gauss quadrature rules
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- Generalized block anti-Gauss quadrature rules
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- Google's PageRank and beyond. The science of search engine rankings
- Graph characteristics from the Schrödinger operator
- Graph energy
- scientific article; zbMATH DE number 5977361 (Why is no real title available?)
- scientific article; zbMATH DE number 4050200 (Why is no real title available?)
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Introduction to quantum graphs
- Krylov subspace methods. Principles and analysis.
- Low-rank updates of matrix functions
- Mapping directed networks
- Matrices, moments and quadrature with applications
- Monitoring vulnerability and impact diffusion in financial networks
- Network analysis via partial spectral factorization and Gauss quadrature
- Network analysis. Methodological foundations.
- Network bipartivity and the transportation efficiency of European passenger airlines
- Network properties revealed through matrix functions
- Networks
- New block quadrature rules for the approximation of matrix functions
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Non-backtracking walk centrality for directed networks
- Non-local network dynamics via fractional graph Laplacians
- Numerical methods for large eigenvalue problems
- On generalized matrix functions
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On the exponential generating function for non-backtracking walks
- On the limiting behavior of parameter-dependent network centrality measures
- On the stability of network indices defined by means of matrix functions
- Operator-Lipschitz estimates for the singular value functional calculus
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
- Path Laplacian operators and superdiffusive processes on graphs. II. two-dimensional lattice
- Predicting triadic closure in networks using communicability distance functions
- Quadrature rule-based bounds for functions of adjacency matrices
- Ranking hubs and authorities using matrix functions
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Risk-dependent centrality in economic and financial networks
- Semigroup methods for evolution equations on networks
- Shareholding Networks and Centrality: An Application to the Italian Financial Market
- Some matrix properties preserved by generalized matrix functions
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
- Subgraph centrality and walk-regularity
- The communicability distance in graphs
- The Lanczos algorithm and complex Gauss quadrature
- The Structure and Function of Complex Networks
- The walk distances in graphs
- Topological evolution in dense granular materials: a complex networks perspective
- Tunable eigenvector-based centralities for multiplex and temporal networks
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- Updating and downdating techniques for optimizing network communicability
- Vector estimates for \(f(A)\mathbf b\) via extrapolation
- Walk entropy and walk-regularity
- What is the meaning of the graph energy after all?
Cited in
(18)- Netted matrices
- Estimating the trace of matrix functions with application to complex networks
- Network analysis with the aid of the path length matrix
- Lower and upper bounds on graph communicabilities
- Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices
- A message-passing approach to obtain the trace of matrix functions with applications to network analysis
- Forman-Ricci communicability curvature of graphs and networks
- Updating Katz centrality by counting walks
- Geometries of mixed graphs in complex vector spaces. Hierarchies and clusters in complex networks
- Near instance optimality of the Lanczos method for Stieltjes and related matrix functions
- Balance with memory in signed networks via Mittag-Leffler matrix functions
- Monotonicity, bounds and acceleration of block Gauss and Gauss-Radau quadrature for computing B^T (A)B
- A note on the calculation of vertex energy of graphs based on Estrada-Benzi approach
- A novel Krylov subspace method for approximating Fréchet derivatives of large-scale matrix functions
- Efficient computation of f-centralities and nonbacktracking centrality for temporal networks
- Error formulas for block rational Krylov approximations of matrix functions
- Edge-based Katz centralities for spatio-temporal multiplex networks
- Source-to-sink communicability: a new centrality measure for directed acyclic networks
This page was built for publication: Matrix functions in network analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068264)
