Block matrix models for dynamic networks

Networks in which connections change over time arise in many applications, e.g., when modeling phone calls and flights between airports. This paper discusses new ways to define adjacency matrices associated with this kind of networks. We propose that dynamic networks be modeled with the aid of block upper triangular adjacency matrices. Both modeling and computational aspects are discussed. Several applications to real dynamic networks are presented and illustrate the advantages of the proposed method when compared with an available approach.