arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.01268math.PRcs.SImath.CO
收藏

谣言传播依赖于社会网络模型中的潜在几何结构与度分布

Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models

Marc Kaufmann, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi, Ulysse Schaller, Konstantin Sturm

AI总结:

本文在几何非均匀随机图模型中系统研究推拉式谣言传播,完整刻画了欧氏几何下由幂律指数和几何强度决定的缓慢、快速与超快速传播的相变边界,并证明非度量几何中谣言传播始终至少是快速的。

摘要:

我们研究超小世界社会网络模型中的推拉式谣言传播,其中节点的度服从幂律分布。在非几何设定下,Fountoulakis、Panagiotou 和 Sauerwald 已证明谣言总是以超快速度传播(SODA 2012),即在双重对数时间内完成。另一方面,Janssen 和 Mehrabian 发现,在空间优先连接模型中谣言传播缓慢(多项式时间)(SIDMA 2017)。我们针对几何非均匀随机图(GIRGs)模型系统地研究这一问题。我们的结果有两方面:第一,在欧氏几何下,根据幂律指数和网络中几何强度的不同,可能出现缓慢、快速(多重对数)和超快速三种谣言传播情形,我们完整刻画了它们之间的相变边界。这些传播情形与图距离情形并不一致,也就是说,即使图距离是双重对数的,谣言传播仍可能是多重对数甚至多项式的。我们预期这些结果只需少量工作即可推广到相关模型,例如无标度渗流模型。第二,我们证明在非度量几何中,谣言传播始终(至少)是快速的。所考虑的非度量几何能够刻画这样一类社会连接:顶点在单一属性上的相似性(例如家族亲缘关系)已经强烈暗示边的存在。欧氏几何无法捕捉这类联系。在欧氏设定的某些情形中,传播谣言的高效路径与先前识别的路径不同。例如,一个度为 d 的顶点可以通过长度为 3 的链将谣言传递给一个度更大的顶点,其中两个中间节点之一具有常数度,另一个的度为 d^c,其中 c<1 为某个常数。类似的但更长的、所有节点均具有非常数度的顶点链也被证明是有用的。

英文摘要:

We study push-pull rumour spreading in ultra-small-world models for social networks where the degrees follow a power-law distribution. In a non-geometric setting, Fountoulakis, Panagiotou and Sauerwald have shown that rumours always spread ultra-fast (SODA 2012), i.e. in doubly logarithmic time. On the other hand, Janssen and Mehrabian have found that rumours spread slowly (polynomial time) in a spatial preferential attachment model (SIDMA 2017). We study the question systematically for the model of Geometric Inhomogeneous Random Graphs (GIRGs). Our results are two-fold: first, with Euclidean geometry slow, fast (polylogarithmic) and ultra-fast rumour spreading may occur, depending on the exponent of the power law and the strength of the geometry in the networks, and we fully characterise the phase boundaries in between. The regimes do not coincide with the graph distance regimes, i.e., polylogarithmic or even polynomial rumour spreading may occur even if graph distances are doubly logarithmic. We expect these results to hold with little effort for related models, e.g. Scale-Free Percolation. Second, we show that rumour spreading is always (at least) fast in a non-metric geometry. The considered non-metric geometry allows to model social connections where resemblance of vertices in a single attribute, such as familial kinship, already strongly indicates the presence of an edge. Euclidean geometry fails to capture such ties. For some regimes in the Euclidean setting, the efficient pathways for spreading rumours differ from previously identified paths. For example, a vertex of degree $d$ can transmit the rumour to a vertex of larger degree by a chain of length $3$, where one of the two intermediaries has constant degree, and the other has degree $d^{c}$ for some constant $c<1$. Similar but longer chains of vertices, all having non-constant degree, turn out to be useful as well.

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

↑