2015/11/23 by Caterina Fenu, Desmond J. Higham, Fenu, Caterina +1 · 1 citation
Biochemistry, Genetics and Molecular Biology · Physics and Astronomy · #05C50 #15A69 #Complex Network Analysis Techniques #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Gene Regulatory Network Analysis #Numerical Analysis (math.NA) #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI)
paper · doi:10.48550/arxiv.1511.07305
openalex publication_date 2015/11/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Many types of pairwise interaction take the form of a fixed set of nodes with edges that appear and disappear over time. In the case of discrete-time evolution, the resulting evolving network may be represented by a time-ordered sequence of adjacency matrices. We consider here the issue of representing the system as a single, higher dimensional block matrix, built from the individual time-slices. We focus on the task of computing network centrality measures. From a modeling perspective, we show that there is a suitable block formulation that allows us to recover dynamic centrality measures respecting time's arrow. From a computational perspective, we show that the new block formulation leads to the design of more effective numerical algorithms.