We study the problem of inferring network topology from information cascades, in which the amount of time taken for information to diffuse across an edge in the network follows an unknown distribution. Unlike previous studies, which assume knowledge of these distributions, we only require that diffusion along different edges in the network be independent together with limited moment information (e.g., the means). We introduce the concept of a separating vertex set for a graph, which is a set of vertices in which for any two given distinct vertices of the graph, there exists a vertex whose distance to them are different. We show that a necessary condition for reconstructing a tree perfectly using distance information between pairs of vertices is given by the size of an observed separating vertex set. We then propose an algorithm to recover the tree structure using infection times, whose differences have means corresponding to the distance between two vertices. To improve the accuracy of our algorithm, we propose the concept of redundant vertices, which allows us to perform averaging to better estimate the distance between two vertices. Though the theory is developed mainly for tree networks, we demonstrate how the algorithm can be extended heuristically to general graphs. Simulations using synthetic and real networks, and experiments using real-world data suggest that our proposed algorithm performs better than some current state-of-the-art network reconstruction methods.
Improving Information Cascade Modeling by Social Topology and Dual Role User Dependency
Fudan University(复旦大学)
社交网络上的信息扩散(也称为信息级联)由于其在许多领域的应用价值,在过去的十年中得到了大量的研究。近年来,包括递归神经网络模型在内的序列模型被广泛应用于信息级联的预测。然而,顺序模型捕获的级联序列中的用户依赖性通常是单向的,并且与扩散树不一致。例如,后继者的真实触发可以是非直接前导者而不是序列中的直接前导者。为了更充分地捕捉用户依赖关系,实现精确的级联建模,提出了一种非顺序信息级联模型TAN-DRUD(Topology-aware Attention Networks with Dual Role User Dependency)。受经典通信理论的启发,TAN-DRUD通过捕捉信息发送者和接收者的双重角色用户依赖关系,在信息级联建模方面取得了令人满意的性能。此外,TANDRUD将社交拓扑纳入两级注意力网络中,以增强信息扩散预测。我们在三个级联数据集上的大量实验表明,我们的模型不仅优于最先进的级联模型,而且能够利用拓扑信息和推断扩散树。
Network-based statistical comparison of citation topology of bibliographic databases
现代书目数据库为科学研究及其评价提供了基础。虽然它们的内容和结构大不相同,但对其可靠性只有非正式的概念。在这里,我们比较了引文网络的拓扑结构的一致性提取的六个流行的书目数据库,包括Web of Science,CiteSeer和arXiv. org的网络进行评估,通过丰富的本地和全球的图形统计。我们首先揭示了一些数据库之间的统计上显着的不一致,就个人统计。例如,DBLP计算机科学参考书目的引入字段蝴蝶结分解由于数据库的覆盖范围而与其他文献有很大不同,而arXiv.org中的引用信息是最详尽的。最后,我们使用临界差异图在多个图统计上比较数据库。DBLP计算机科学书目的引用拓扑与其他文献最不一致,而毫不奇怪,从一致性的角度来看,Web of Science的引用拓扑明显更可靠。本研究可作为文献计量学和科学计量学研究者的参考,也可作为政府和科研机构的科学评价指南。