Network Properties Revealed through Matrix Functions

DOI10.1137/090761070zbMath1214.05077MaRDI 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

91D30: Social networks; opinion dynamics

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

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, 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, 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, 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, New block quadrature rules for the approximation of matrix functions, Generalized averaged Gauss quadrature rules for the approximation of matrix functionals, Some extremal properties of the resolvent energy, Estrada and resolvent Estrada indices of graphs, Hyperspherical embedding of graphs and networks in communicability spaces, The walk distances in graphs, On the radius of centrality in evolving communication networks, Convergence rates for inverse-free rational approximation of matrix functions, Accounting for the role of long walks on networks via a new matrix function, \texttt{PQser:} a Matlab package for spectral seriation, The ABC matrix, Simplified anti-Gauss quadrature rules with applications in linear algebra, Betweenness in time dependent networks, Centrality measures for node-weighted networks via line graphs and the matrix exponential, Double Gaussianization of graph spectra, A note on the graph's resolvent and the multifilar structure, Returnability in complex directed networks (digraphs), 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, 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, Perron communicability and sensitivity of multilayer networks, PageRank Beyond the Web, 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, Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions, Eigenvector-Based Centrality Measures for Temporal Networks, Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Matrix Structures and Matrix Functions, Matrix functions in network analysis, A literature survey of matrix methods for data science, Sublinear Algorithms for Local Graph-Centrality Estimation, Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds, Adaptive Rational Krylov Methods for Exponential Runge–Kutta Integrators, Calculating elements of matrix functions using divided differences, Randomized Low-Rank Approximation of Monotone Matrix Functions, The Fréchet derivative of the tensor t-function, Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization

Uses Software