.png){kind=icon}
返回
Block matrix models for dynamic networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2021.126121.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2021 Elsevier Inc. All rights reserved.
Keyword:
Time-dependent centrality
Complex network
Evolving network
Graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容