Reconstructing simplicial complexes from evolutionary games
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915206431506432 |
|---|---|
| author | Ma, Yin-Jie Jiang, Zhi-Qiang Fang, Fanshu del Genio, Charo I. Boccaletti, Stefano |
| author_facet | Ma, Yin-Jie Jiang, Zhi-Qiang Fang, Fanshu del Genio, Charo I. Boccaletti, Stefano |
| contents | In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one has, at best, access to partial connectivity data, and therefore the entire graph structure needs to be reconstructed from a limited number of observations of the dynamical processes that take place on it. While existing studies predominantly focused on reconstructing traditional pairwise networks, higher-order interactions remain largely unexplored. Here, we introduce three methods to reconstruct a simplicial complex structure of connection from observations of evolutionary games that take place on it, and demonstrate their high accuracy and excellent overall performance in synthetic and empirical complexes. The methods have different requirements and different complexity, thereby constituting a series of approaches from which one can pick the most appropriate one given the specific circumstances of the application under study. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_15923 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reconstructing simplicial complexes from evolutionary games Ma, Yin-Jie Jiang, Zhi-Qiang Fang, Fanshu del Genio, Charo I. Boccaletti, Stefano Physics and Society In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one has, at best, access to partial connectivity data, and therefore the entire graph structure needs to be reconstructed from a limited number of observations of the dynamical processes that take place on it. While existing studies predominantly focused on reconstructing traditional pairwise networks, higher-order interactions remain largely unexplored. Here, we introduce three methods to reconstruct a simplicial complex structure of connection from observations of evolutionary games that take place on it, and demonstrate their high accuracy and excellent overall performance in synthetic and empirical complexes. The methods have different requirements and different complexity, thereby constituting a series of approaches from which one can pick the most appropriate one given the specific circumstances of the application under study. |
| title | Reconstructing simplicial complexes from evolutionary games |
| topic | Physics and Society |
| url | https://arxiv.org/abs/2503.15923 |