Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.09503 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908825557139456 |
|---|---|
| author | Lin, Bingxin Zhou, Lei Fang, Hao |
| author_facet | Lin, Bingxin Zhou, Lei Fang, Hao |
| contents | Imitation is a basic updating mechanism for strategy evolution in structured populations, determining how individuals sample social information and translate it into behavioral changes. Higher-order networks, such as hypergraphs, generalize pairwise links to hyperedges and provide a natural representation of group interactions. Yet existing studies on higher-order networks largely emphasize structural effects, while the impact of imitation-based update rules and how they interact with group structures remains poorly understood. Here, we introduce a class of structure-aware imitation rules on hypergraphs that explicitly parameterize how many groups are sampled and how many peers are consulted within each sampled group. Under weak selection, we derive an analytical condition for the success of cooperation for any multiplayer social dilemmas on homogeneous hypergraphs. This analysis yields an interpretable metric, information diversity, which quantifies how an update rule diversifies the sources of social information across groups. Analytical predictions and numerical simulations show that cooperation is more effectively promoted by update rules that induce higher information diversity for three representative dilemmas. Further simulations demonstrate that this principle extends to non-homogeneous hypergraphs and a broad class of multiplayer social dilemmas. Our work thus provides a unifying metric that links microscopic updating to evolutionary outcomes in higher-order networked systems and establishes a general design principle for promoting cooperation beyond pairwise interactions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_09503 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Structure-aware imitation dynamics on higher-order networks Lin, Bingxin Zhou, Lei Fang, Hao Physics and Society Imitation is a basic updating mechanism for strategy evolution in structured populations, determining how individuals sample social information and translate it into behavioral changes. Higher-order networks, such as hypergraphs, generalize pairwise links to hyperedges and provide a natural representation of group interactions. Yet existing studies on higher-order networks largely emphasize structural effects, while the impact of imitation-based update rules and how they interact with group structures remains poorly understood. Here, we introduce a class of structure-aware imitation rules on hypergraphs that explicitly parameterize how many groups are sampled and how many peers are consulted within each sampled group. Under weak selection, we derive an analytical condition for the success of cooperation for any multiplayer social dilemmas on homogeneous hypergraphs. This analysis yields an interpretable metric, information diversity, which quantifies how an update rule diversifies the sources of social information across groups. Analytical predictions and numerical simulations show that cooperation is more effectively promoted by update rules that induce higher information diversity for three representative dilemmas. Further simulations demonstrate that this principle extends to non-homogeneous hypergraphs and a broad class of multiplayer social dilemmas. Our work thus provides a unifying metric that links microscopic updating to evolutionary outcomes in higher-order networked systems and establishes a general design principle for promoting cooperation beyond pairwise interactions. |
| title | Structure-aware imitation dynamics on higher-order networks |
| topic | Physics and Society |
| url | https://arxiv.org/abs/2602.09503 |