Network Properties Revealed through Matrix Functions

DOI10.1137/090761070zbMath1214.05077OpenAlexW2016170913MaRDI QIDQ3066235

Publication date: 10 January 2011

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9542789ce2e710b9b17e5fa3882373ddf027d667

zbMATH Keywords

resolvent power series Fiedler vector Estrada index graph spectrum clustering methods centrality measures graph Laplacian communicability

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (only showing first 100 items - show all)

Network bipartivity and the transportation efficiency of European passenger airlines ⋮ Centrality measures for node-weighted networks via line graphs and the matrix exponential ⋮ A hierarchical walk-based measure of centrality based on reachability between strongly connected components in a digraph ⋮ Double Gaussianization of graph spectra ⋮ On the convergence of the minimally irreducible Markov chain method with applications to PageRank ⋮ New block quadrature rules for the approximation of matrix functions ⋮ The many facets of the Estrada indices of graphs and networks ⋮ A note on the graph's resolvent and the multifilar structure ⋮ Gaussianization of the spectra of graphs and networks. Theory and applications ⋮ Ordering starlike trees by the totality of their spectral moments ⋮ Generalized averaged Gauss quadrature rules for the approximation of matrix functionals ⋮ Mixed Precision Recursive Block Diagonalization for Bivariate Functions of Matrices ⋮ Some extremal properties of the resolvent energy, Estrada and resolvent Estrada indices of graphs ⋮ The electron density function of the Hückel (tight-binding) model ⋮ 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 ⋮ New matrix function approximations and quadrature rules based on the Arnoldi process ⋮ Social interactions and the prophylaxis of SI epidemics on networks ⋮ On the exponential generating function for non-backtracking walks ⋮ A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching ⋮ Maximal Estrada index of unicyclic graphs with perfect matching ⋮ From networked SIS model to the Gompertz function ⋮ Predicting Triadic Closure in Networks Using Communicability Distance Functions ⋮ 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 ⋮ Block Matrix Formulations for Evolving Networks ⋮ More on the Estrada indices of trees ⋮ The Radau--Lanczos Method for Matrix Functions ⋮ Some bounds for total communicability of graphs ⋮ Subgraph centrality and walk-regularity ⋮ Topological melting in networks of granular materials ⋮ 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 ⋮ Power network uniqueness and synchronization stability from a higher-order structure perspective ⋮ Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease ⋮ Hyperspherical embedding of graphs and networks in communicability spaces ⋮ The global Golub-Kahan method and Gauss quadrature for tensor function approximation ⋮ Perron communicability and sensitivity of multilayer networks ⋮ A rational Arnoldi process with applications ⋮ 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 ⋮ Ranking hubs and authorities using matrix functions ⋮ The walk distances in graphs ⋮ Tuned communicability metrics in networks. The case of alternative routes for urban traffic ⋮ The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Node and Layer Eigenvector Centralities for Multiplex Networks ⋮ Low-Rank Updates of Matrix Functions ⋮ A note on walk entropies in graphs ⋮ Generalized walks-based centrality measures for complex biological networks ⋮ 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 ⋮ On the radius of centrality in evolving communication networks ⋮ \texttt{PQser:} a Matlab package for spectral seriation ⋮ Convergence rates for inverse-free rational approximation of matrix functions ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Accounting for the role of long walks on networks via a new matrix function ⋮ Block matrix models for dynamic networks ⋮ The e-MoM approach for approximating matrix functionals ⋮ The ABC matrix ⋮ Beyond non-backtracking: non-cycling network centrality measures ⋮ Simplified anti-Gauss quadrature rules with applications in linear algebra ⋮ An information-theoretic approach to study spatial dependencies in small datasets ⋮ Analysis of directed networks via partial singular value decomposition and Gauss quadrature ⋮ Synchronizability of two neurons with switching in the coupling ⋮ Orthogonal expansion of network functions ⋮ On the Stability of Network Indices Defined by Means of Matrix Functions ⋮ Betweenness in time dependent networks ⋮ Shifted extended global Lanczos processes for trace estimation with application to network analysis ⋮ Edge importance in a network via line graphs and the matrix exponential ⋮ Computing performability measures in Markov chains by means of matrix functions ⋮ PageRank Beyond the Web ⋮ Computing functions of very large matrices with small TT/QTT ranks by quadrature formulas ⋮ Matrix Analysis and Omega Calculus ⋮ Returnability in complex directed networks (digraphs) ⋮ Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions ⋮ Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization ⋮ Community detection based on network communicability ⋮ Stochastic estimates for the trace of functions of matrices via Hadamard matrices ⋮ Non-Backtracking Alternating Walks ⋮ Estimating the Largest Elements of a Matrix ⋮ Communicability Angle and the Spatial Efficiency of Networks ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks ⋮ Clustered Matrix Approximation ⋮ Low-Rank Updates of Matrix Functions II: Rational Krylov Methods ⋮ A MODEL TO CLASSIFY USERS OF SOCIAL NETWORKS BASED ON PAGERANK ⋮ Dynamic Katz and related network measures ⋮ A Fiedler center for graphs generalizing the characteristic set ⋮ Generalized block anti-Gauss quadrature rules ⋮ A Theory for Backtrack-Downweighted Walks ⋮ Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number ⋮ On the Limiting Behavior of Parameter-Dependent Network Centrality Measures ⋮ Mittag--Leffler Functions and their Applications in Network Science ⋮ Bounding matrix functionals via partial global block Lanczos decomposition ⋮ 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

Uses Software

This page was built for publication: Network Properties Revealed through Matrix Functions