A Matrix Iteration for Dynamic Network Summaries

DOI10.1137/110855715zbMath1262.91121OpenAlexW2088783191MaRDI QIDQ4912759

Peter Grindrod, Desmond J. Higham

Publication date: 5 April 2013

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

Full work available at URL: http://centaur.reading.ac.uk/28768/1/dynsumresub.pdf

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (15)

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ PageRank centrality for temporal networks ⋮ New block quadrature rules for the approximation of matrix functions ⋮ Block Matrix Formulations for Evolving Networks ⋮ Random walks and diffusion on networks ⋮ Matrix functions in network analysis ⋮ Mining community-level influence in microblogging network: a case study on Sina Weibo ⋮ The Estrada index of evolving graphs ⋮ Magnitude and Topological Entropy of Digraphs ⋮ Random walk centrality for temporal networks ⋮ On the radius of centrality in evolving communication networks ⋮ Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks ⋮ Block matrix models for dynamic networks ⋮ Eigenvector-Based Centrality Measures for Temporal Networks ⋮ Betweenness in time dependent networks

Uses Software

• GenLouvain

This page was built for publication: A Matrix Iteration for Dynamic Network Summaries