Simple Games on Complex Networks

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Benatti, Alexandre, Costa, Luciano da F.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913401567969280
author Benatti, Alexandre
Costa, Luciano da F.
author_facet Benatti, Alexandre
Costa, Luciano da F.
contents The relationship between topology and dynamics of complex systems has motivated continuing interest from the scientific community. In the present work, we address this interesting topic from the perspective of simple games, involving two teams playing according to a small set of simple rules, taking place on four types of complex networks. Starting from a minimalist game, characterized by full symmetry always leading to ties, four other games are described in progressive order of complexity, taking into account the presence of neighbors as well as strategies. Each of these five games, as well as their specific changes when implemented in four types of networks, are studied in terms of statistics of the total duration of the game as well as the number of victories and ties, with several interesting results that substantiate, in some cases, the importance of the network topology on the respective dynamics. As a subsidiary result, the visualization of relationships between the data elements in terms of coincidence similarity networks allowed a more complete and direct interpretation of the obtained results.
format Preprint
id arxiv_https___arxiv_org_abs_2406_15636
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Simple Games on Complex Networks
Benatti, Alexandre
Costa, Luciano da F.
Social and Information Networks
Physics and Society
The relationship between topology and dynamics of complex systems has motivated continuing interest from the scientific community. In the present work, we address this interesting topic from the perspective of simple games, involving two teams playing according to a small set of simple rules, taking place on four types of complex networks. Starting from a minimalist game, characterized by full symmetry always leading to ties, four other games are described in progressive order of complexity, taking into account the presence of neighbors as well as strategies. Each of these five games, as well as their specific changes when implemented in four types of networks, are studied in terms of statistics of the total duration of the game as well as the number of victories and ties, with several interesting results that substantiate, in some cases, the importance of the network topology on the respective dynamics. As a subsidiary result, the visualization of relationships between the data elements in terms of coincidence similarity networks allowed a more complete and direct interpretation of the obtained results.
title Simple Games on Complex Networks
topic Social and Information Networks
Physics and Society
url https://arxiv.org/abs/2406.15636