Optimality in group-driven social dynamics on hypergraphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918455097163776 |
|---|---|
| author | Kim, Jihye Lee, Deok-Sun Goh, K. -I. |
| author_facet | Kim, Jihye Lee, Deok-Sun Goh, K. -I. |
| contents | We explore the role of intrinsic structural properties of hypergraphs in governing group-driven social dynamics with social reinforcement. First, we analyze simplicial contagion dynamics on random hypergraphs in which the level of hyperedge nestedness is systematically controlled. By developing the facet-based approximate master equation (FAME) method, we demonstrate that hyperedge nestedness induces a non-monotonic change in the outbreak threshold for simplicial contagion, displaying the lowest threshold at an intermediate level of hyperedge nestedness due to competition between simple and higher-order contagion processes. Next, we formulate the group-driven voter model (GVM) and investigate the consensus time for the GVM on hypergraphs with N nodes. Focusing on a representative case of the GVM, we show that the consensus time scales logarithmically with the system size as A ln N, where the prefactor A displays the fastest consensus formation at an intermediate level of social reinforcement due to competition between group-constraint and nonlinearity factors. Taken together, our results highlight the importance of competing effects arising from higher-order interactions in shaping optimality in group-driven social dynamical processes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_17689 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Optimality in group-driven social dynamics on hypergraphs Kim, Jihye Lee, Deok-Sun Goh, K. -I. Physics and Society We explore the role of intrinsic structural properties of hypergraphs in governing group-driven social dynamics with social reinforcement. First, we analyze simplicial contagion dynamics on random hypergraphs in which the level of hyperedge nestedness is systematically controlled. By developing the facet-based approximate master equation (FAME) method, we demonstrate that hyperedge nestedness induces a non-monotonic change in the outbreak threshold for simplicial contagion, displaying the lowest threshold at an intermediate level of hyperedge nestedness due to competition between simple and higher-order contagion processes. Next, we formulate the group-driven voter model (GVM) and investigate the consensus time for the GVM on hypergraphs with N nodes. Focusing on a representative case of the GVM, we show that the consensus time scales logarithmically with the system size as A ln N, where the prefactor A displays the fastest consensus formation at an intermediate level of social reinforcement due to competition between group-constraint and nonlinearity factors. Taken together, our results highlight the importance of competing effects arising from higher-order interactions in shaping optimality in group-driven social dynamical processes. |
| title | Optimality in group-driven social dynamics on hypergraphs |
| topic | Physics and Society |
| url | https://arxiv.org/abs/2604.17689 |