arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2504.03397eess.SYcs.SY
收藏

在 Friedkin-Johnsen 模型的双向影响力竞争中利用网络拓扑

Leveraging Network Topology in a Two-way Competition for Influence in the Friedkin-Johnsen Model

Aashi Shrinate, Twinkle Tripathy

AI总结:

本文研究Friedkin-Johnsen模型中两个固执智能体在强连通网络上的双向影响力竞争,提出仅利用网络拓扑增加首选智能体影响力的充分条件,并证明存在扰动序列可逆转影响力劣势,最后在Sampson's Monastery数据集上验证了结果。

摘要:

在本文中,我们考虑两个固执的智能体,它们在一个强连通的智能体群体中竞争“影响力”。该框架代表了现实世界中的竞争,例如企业竞争、两党选举和体育对抗等。考虑到智能体的固执性是一种不可变的属性,我们仅利用网络拓扑来增加首选固执智能体的影响力。我们通过识别此类网络中每个固执智能体的支持者,在一个特殊类别的强连通网络上对此进行了证明。随后,我们提出了充分的条件,在这些条件下,网络扰动总是能增加首选固执智能体的影响力。所提出的基于拓扑的条件的一个关键优势在于,它们独立于网络中的边权重而成立。最重要的是,我们断言存在一系列扰动,可以使影响力较小的固执智能体变得更具影响力。最后,我们在 Sampson's Monastery 数据集上演示了我们的结果。

英文摘要:

In this paper, we consider two stubborn agents who compete for `influence' over a strongly connected group of agents. This framework represents real-world contests, such as competition among firms, two-party elections, and sports rivalries, among others. Considering stubbornness of agents to be an immutable property, we utilise the network topology alone to increase the influence of a preferred stubborn agent. We demonstrate this on a special class of strongly connected networks by identifying the supporters of each of the stubborn agents in such networks. Thereafter, we present sufficient conditions under which a network perturbation always increases the influence of the preferred stubborn agent. A key advantage of the proposed topology-based conditions is that they hold independent of the edge weights in the network. Most importantly, we assert that there exists a sequence of perturbations that can make the lesser influential stubborn agent more influential. Finally, we demonstrate our results over the Sampson's Monastery dataset.

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

↑