arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.5915cs.SIcs.DCcs.DSphysics.soc-ph
收藏

有色Tori中的动态垄断

Dynamic Monopolies in Colored Tori

Sara Brunetti, Elena Lodi, Walter Quattrociocchi

摘要:

{ \em信息扩散}已被建模为通过社会影响过程在群体内传播信息,其中扩散由所谓的{ \em有影响力的网络}驱动。这样的过程,已经在{ \em病毒式营销}的名义下被深入研究,其目标是选择一组初始的好的个体,这些个体将通过口碑在整个社交网络内传播“谣言”来推广新的想法(或消息)。几项研究使用{ \em线性阈值模型},其中组由图表示,节点有两种可能的状态(活动,非活动),触发节点采用(激活)新想法的阈值由活动邻居的数量给出。在图中检测能够激活整个网络的最小数量的节点的存在的问题被称为{ \em目标集选择}(TSS)。在本文中,我们通过允许节点具有两种以上的颜色来扩展TSS。TSS的多色版本可以描述如下:令$G$是一个环面,其中每个节点都被分配了一个有限颜色集合中的颜色。在每个本地时间步,每个节点可以根据本地配置重新为自己着色,颜色由其大多数邻居保持。我们研究的颜色的初始分布导致系统的单色配置的颜色$k$,专注于初始$k$着色节点的最小数量。我们通过提供实现单色配置的时间复杂度来结束本文。

英文摘要:

The {\em information diffusion} has been modeled as the spread of an information within a group through a process of social influence, where the diffusion is driven by the so called {\em influential network}. Such a process, which has been intensively studied under the name of {\em viral marketing}, has the goal to select an initial good set of individuals that will promote a new idea (or message) by spreading the "rumor" within the entire social network through the word-of-mouth. Several studies used the {\em linear threshold model} where the group is represented by a graph, nodes have two possible states (active, non-active), and the threshold triggering the adoption (activation) of a new idea to a node is given by the number of the active neighbors. The problem of detecting in a graph the presence of the minimal number of nodes that will be able to activate the entire network is called {\em target set selection} (TSS). In this paper we extend TSS by allowing nodes to have more than two colors. The multicolored version of the TSS can be described as follows: let $G$ be a torus where every node is assigned a color from a finite set of colors. At each local time step, each node can recolor itself, depending on the local configurations, with the color held by the majority of its neighbors. We study the initial distributions of colors leading the system to a monochromatic configuration of color $k$, focusing on the minimum number of initial $k$-colored nodes. We conclude the paper by providing the time complexity to achieve the monochromatic configuration.

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

↑