A matrix iteration for dynamic network summaries
From MaRDI portal
Publication:4912759
DOI10.1137/110855715zbMATH Open1262.91121OpenAlexW2088783191MaRDI QIDQ4912759FDOQ4912759
Authors: 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
Recommendations
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cited In (18)
- PageRank centrality for temporal networks
- Matrix functions in network analysis
- Efficiently summarizing attributed diffusion networks
- Tunable Eigenvector-Based Centralities for Multiplex and Temporal Networks
- Random walks and diffusion on networks
- New block quadrature rules for the approximation of matrix functions
- Betweenness in time dependent networks
- Random walk centrality for temporal networks
- Time and sequence in networks of social interactions
- Eigenvector-Based Centrality Measures for Temporal Networks
- Magnitude and Topological Entropy of Digraphs
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- The Estrada index of evolving graphs
- Block matrix models for dynamic networks
- On the radius of centrality in evolving communication networks
- Mining community-level influence in microblogging network: a case study on Sina Weibo
- Supracentrality analysis of temporal networks with directed interlayer coupling
- Block Matrix Formulations for Evolving Networks
Uses Software
This page was built for publication: A matrix iteration for dynamic network summaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912759)
