.png){kind=icon}
返回
The Node Vector Distance Problem in Complex Networks
.png){kind=icon}
OA
AI
DOI：10.1145/3416509.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We describe a problem in complex networks we call the Node Vector Distance (NVD) problem, and we survey algorithms currently able to address it. Complex networks are a useful tool to map a non-trivial set of relationships among connected entities, or nodes. An agent-e.g., a disease-can occupy multiple nodes at the same time and can spread through the edges. The node vector distance problem is to estimate the distance traveled by the agent between two moments in time. This is closely related to the Optimal Transportation Problem (OTP), which has received attention in fields such as computer vision. OTP solutions can be used to solve the node vector distance problem, but they are not the only valid approaches. Here, we examine four classes of solutions, showing their differences and similarities both on synthetic networks and real world network data. The NVD problem has a much wider applicability than computer vision, being related to problems in economics, epidemiology, viral marketing, and sociology, to cite a few. We show how solutions to the NVD problem have a wide range of applications, and we provide a roadmap to general and computationally tractable solutions. We have implemented all methods presented in this article in a publicly available open source library, which can be used for result replication.
Keyword:
Spreading events
social networks
network epidemics
structural change
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
28
论文数:
2.4K
被引数:
3.5W
机构
引用论文
.png){kind=icon}
分享收藏Comparing Conformational Ensembles Using the Kullback-Leibler Divergence Expansion使用Kullback-Leibler散度扩展比较构象集合OAAI
OAAI分享收藏
分享收藏
查看更多内容