Network properties revealed through matrix functions
From MaRDI portal
Recommendations
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Ranking hubs and authorities using matrix functions
- Centrality measures for node-weighted networks via line graphs and the matrix exponential
- Gaussianization of the spectra of graphs and networks. Theory and applications
- Updating and downdating techniques for optimizing network communicability
Cited in
(only showing first 100 items - show all)- Returnability in complex directed networks (digraphs)
- Parameter influence on the zeros of network determinants
- Gaussianization of the spectra of graphs and networks. Theory and applications
- On the exponential generating function for non-backtracking walks
- Maximal Estrada index of unicyclic graphs with perfect matching
- Generalized walks-based centrality measures for complex biological networks
- Markov fundamental tensor and its applications to network analysis
- Ranking hubs and authorities using matrix functions
- The e-MoM approach for approximating matrix functionals
- Synchronizability of two neurons with switching in the coupling
- Orthogonal expansion of network functions
- Shifted extended global Lanczos processes for trace estimation with application to network analysis
- Dynamic Katz and related network measures
- Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number
- The many facets of the Estrada indices of graphs and networks
- Ordering starlike trees by the totality of their spectral moments
- On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices
- A spectral method to detect community structure based on the communicability modularity
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
- Estimating the error in matrix function approximations
- Block matrix models for dynamic networks
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Edge importance in a network via line graphs and the matrix exponential
- Computing performability measures in Markov chains by means of matrix functions
- Computing functions of very large matrices with small TT/QTT ranks by quadrature formulas
- A Fiedler center for graphs generalizing the characteristic set
- Generalized block anti-Gauss quadrature rules
- Bounding matrix functionals via partial global block Lanczos decomposition
- Network bipartivity and the transportation efficiency of European passenger airlines
- On the convergence of the minimally irreducible Markov chain method with applications to PageRank
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Some bounds for total communicability of graphs
- Subgraph centrality and walk-regularity
- Topological melting in networks of granular materials
- The increase in the resolvent energy of a graph due to the addition of a new edge
- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
- Analysis of directed networks via the matrix exponential
- A note on walk entropies in graphs
- New matrix function approximations and quadrature rules based on the Arnoldi process
- Social interactions and the prophylaxis of SI epidemics on networks
- From networked SIS model to the Gompertz function
- Power network uniqueness and synchronization stability from a higher-order structure perspective
- The global Golub-Kahan method and Gauss quadrature for tensor function approximation
- Estimating the trace of matrix functions with application to complex networks
- Perron communicability and sensitivity of multilayer networks
- PageRank beyond the web
- New block quadrature rules for the approximation of matrix functions
- Community detection based on network communicability
- Estimating the largest elements of a matrix
- Communicability angle and the spatial efficiency of networks
- Clustered matrix approximation
- A model to classify users of social networks based on PageRank
- Predicting triadic closure in networks using communicability distance functions
- A rational Arnoldi process with applications.
- Localization in matrix computations: theory and applications
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
- Some extremal properties of the resolvent energy, Estrada and resolvent Estrada indices of graphs
- Updating and downdating techniques for optimizing network communicability
- Hyperspherical embedding of graphs and networks in communicability spaces
- The walk distances in graphs
- The electron density function of the Hückel (tight-binding) model
- Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease
- The deformed graph Laplacian and its applications to network centrality analysis
- Node and Layer Eigenvector Centralities for Multiplex Networks
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- On the stability of network indices defined by means of matrix functions
- On the radius of centrality in evolving communication networks
- Stochastic estimates for the trace of functions of matrices via Hadamard matrices
- Sublinear column-wise actions of the matrix exponential on social networks
- Low-Rank Updates of Matrix Functions II: Rational Krylov Methods
- A Theory for Backtrack-Downweighted Walks
- Convergence rates for inverse-free rational approximation of matrix functions
- Mittag-Leffler functions and their applications in network science
- High-performance computation of the exponential of a large sparse matrix
- Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- Three hypergraph eigenvector centralities
- Divide-and-conquer methods for functions of matrices with banded or hierarchical low-rank structure
- A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph
- Mixed precision recursive block diagonalization for bivariate functions of matrices
- Accounting for the role of long walks on networks via a new matrix function
- Improved Variants of the Hutch++ Algorithm for Trace Estimation
- A Multilevel Approach to Variance Reduction in the Stochastic Estimation of the Trace of a Matrix
- Beyond non-backtracking: non-cycling network centrality measures
- An information-theoretic approach to study spatial dependencies in small datasets
- Matrix Analysis and Omega Calculus
- Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization
- Non-backtracking alternating walks
- On the limiting behavior of parameter-dependent network centrality measures
- Block matrix formulations for evolving networks
- More on the Estrada indices of trees
- The Radau-Lanczos method for matrix functions
- A block Krylov method to compute the action of the Fréchet derivative of a matrix function on a vector with applications to condition number estimation
- Low-rank updates of matrix functions
- From affiliation matrices to adjacency matrices: methods and techniques for the analysis of centrality
- Eigenvector-based centrality measures for temporal networks
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
This page was built for publication: Network properties revealed through matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066235)
