arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.13174physics.soc-phcs.SI
收藏

时间网络中的隐藏

Hiding in Temporal Networks

Marcin Waniek, Petter Holme, Talal Rahwan

摘要:

社交网络分析工具可以通过仔细检查一个人的联系来推断各种属性。一些研究人员已经研究了逃避者所面临的问题,他们的目标是战略性地重新连接他们的社会关系,以误导这些工具,从而隐藏他们的私人属性。然而,到目前为止,这些文献只考虑了静态网络,而忽略了更一般的情况下,时间网络,其中的结构随着时间的推移而演变。在这种观察的驱动下,我们研究了逃避者如何从一个拥有时间中心性措施的对手那里隐藏自己的重要性。我们考虑这个问题的计算和结构方面:它是计算上可行的计算最佳的隐藏方式?如果是的话,什么样的网络特征有利于隐藏?这个主题已经在静态网络中进行了研究,但在这项工作中,我们通过考虑边随时间变化的时间网络来增加问题的现实性。我们发现,它通常是计算上不可行的,以找到最佳的隐藏方式。另一方面,通过操纵一个人的联系人,一个人可以增加一个惊人的隐私量。与静态网络相比,时间网络为这种类型的操作提供了更多的策略,因此在某种程度上更容易隐藏。

英文摘要:

Social network analysis tools can infer various attributes just by scrutinizing one's connections. Several researchers have studied the problem faced by an evader whose goal is to strategically rewire their social connections in order to mislead such tools, thereby concealing their private attributes. However, to date, this literature has only considered static networks, while neglecting the more general case of temporal networks, where the structure evolves over time. Driven by this observation, we study how the evader can conceal their importance from an adversary armed with temporal centrality measures. We consider computational and structural aspects of this problem: Is it computationally feasible to calculate optimal ways of hiding? If it is, what network characteristics facilitate hiding? This topic has been studied in static networks, but in this work, we add realism to the problem by considering temporal networks of edges changing in time. We find that it is usually computationally infeasible to find the optimal way of hiding. On the other hand, by manipulating one's contacts, one could add a surprising amount of privacy. Compared to static networks, temporal networks offer more strategies for this type of manipulation and are thus, to some extent, easier to hide in.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑