具有合作与对抗性相互作用的超图高阶拉普拉斯动力学
Higher-order Laplacian dynamics on hypergraphs with cooperative and antagonistic interactions
AI总结:
针对传统图仅能建模成对相互作用的局限,本文在超图上引入高阶拉普拉斯动力学,分析齐次/非齐次多项式系统的集体行为,扩展至符号超图并探索非多项式函数,为复杂群组相互作用下的集体行为分析提供新方法。
摘要:
无符号图上的拉普拉斯动力学描述了一类线性相互作用,所有智能体间的成对合作相互作用使系统收敛到共同状态。在结构平衡的符号图中,智能体收敛到大小相同但符号相反的值(二分一致性),如著名的Altafini模型所示。这些相互作用已用传统图建模,其中智能体间关系始终是成对的。相比之下,高阶网络(如超图)可捕捉智能体间更复杂的群组相互作用。这引出一个自然问题:能否用超图分析集体行为?答案是肯定的。本文首先在无符号超图上引入高阶拉普拉斯动力学,在齐次和非齐次多项式系统框架下研究了多种集体收敛行为。此外,通过采用规范变换并利用张量相似性,我们将这些动力学扩展到符号超图,与Altafini模型相类比。我们还在该框架下探索了非多项式相互作用函数。理论结果通过若干数值例子得到验证。
英文摘要:
Laplacian dynamics on a signless graph characterize a class of linear interactions, where pairwise cooperative interactions between all agents lead to the convergence to a common state. On a structurally balanced signed graph, the agents converge to values of the same magnitude but opposite signs (bipartite consensus), as illustrated by the well-known Altafini model. These interactions have been modeled using traditional graphs, where the relationships between agents are always pairwise. In comparison, higher-order networks (such as hypergraphs), offer the possibility to capture more complex, group-wise interactions among agents. This raises a natural question: can collective behavior be analyzed by using hypergraphs? The answer is affirmative. In this paper, higher-order Laplacian dynamics on signless hypergraphs are first introduced and various collective convergence behaviors are investigated, in the framework of homogeneous and non-homogeneous polynomial systems. Furthermore, by employing gauge transformations and leveraging tensor similarities, we extend these dynamics to signed hypergraphs, drawing parallels to the Altafini model. Moreover, we explore non-polynomial interaction functions within this framework. The theoretical results are demonstrated through several numerical examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。