arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.4936physics.soc-phphysics.data-an
收藏

复杂网络上的竞争动力学

Competitive Dynamics on Complex Networks

Jiuhua Zhao, Qipeng Liu, Xiaofan Wang

摘要:

我们考虑了一个动态网络模型,其中两个竞争对手有固定的和不同的状态,每个正常的代理调整其状态根据一个分布式的共识协议。每个正常主体的状态收敛到一个稳定值,该稳定值是竞争者状态的凸组合,并且与主体的初始状态无关。这意味着竞争的结果完全取决于网络结构和竞争者在网络中的位置。我们计算一个影响矩阵(IM),其中每个元素表征网络中一个代理对另一个代理的影响。我们使用IM来预测每个正常代理的偏差,从而预测哪个竞争对手会赢。此外,我们比较了IM标准与七个节点的中心性措施来预测赢家。我们发现在无向网络中Katz中心度较高或在有向网络中PageRank较高的竞争者更有可能成为赢家。这些研究结果对于理解网络结构在竞争中的作用以及竞争者在多大程度上能够调整网络结构以赢得竞争具有重要意义。

英文摘要:

We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is much more likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition.

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

↑