本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2025-05-16
摘要
社會 dynamics are often driven by both pairwise (i.e., dyadic) relationships and higher-order (i.e., polyadic) group relationships, which one can describe using hypergraphs. To gain insight into the impact of polyadic relationships on dynamical processes on 網絡s, we formulate and study a polyadic voter process, which we call the group-driven voter model (GVM), that incorporates the effects of group dynamics through 非線性 interactions that are subject to a group (i.e., hyperedge) constraint. By examining the competition between 非線性ity and group sizes, we show that the GVM achieves consensus faster than standard voter-model dynamics, with an optimal minimizing exit time. We substantiate this finding by using mean-field theory on annealed uniform hypergraphs with N nodes, for which the exit time s
※ 此為已發表論文，全文需透過期刊付費取得