通过网络哈希进行时序网络压缩
Temporal network compression via network hashing
AI总结:
本文提出高效的矩阵算法和哈希框架来压缩时序网络,以更低的成本估计出分量,并优于现有方法,同时支持隐私保护表示。
摘要:
实体之间的成对时序交互可以表示为时序网络,这些网络编码了在其上演化的流行病传播或信息级联等过程的传播。这些过程的最大结果与底层网络的结构直接相关。实际上,网络中给定时刻的一个节点在未来能够影响的节点数量,不会超过它通过时间尊重路径所能到达的节点数量。从源节点可达的这组节点定义了一个出分量,其识别成本高昂。在本文中,我们提出了一种高效的矩阵算法来解决这一问题,并表明它优于其他最先进的方法。其次,我们提出了一种哈希框架,将大型时序网络粗化为更小的代理网络,在这些代理网络上更容易估计出分量,然后重新组合以获得初始分量。我们的图哈希解决方案在时序网络的隐私尊重表示中具有重要意义。
英文摘要:
Pairwise temporal interactions between entities can be represented as temporal networks, which code the propagation of processes such as epidemic spreading or information cascades, evolving on top of them. The largest outcome of these processes is directly linked to the structure of the underlying network. Indeed, a node of a network at given time cannot affect more nodes in the future than it can reach via time-respecting paths. This set of nodes reachable from a source defines an out-component, which identification is costly. In this paper, we propose an efficient matrix algorithm to tackle this issue and show that it outperforms other state-of-the-art methods. Secondly, we propose a hashing framework to coarsen large temporal networks into smaller proxies on which out-components are easier to estimate, and then recombined to obtain the initial components. Our graph hashing solution has implications in privacy respecting representation of temporal networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。