On the Existence of Highly Organized Communities in Networks of Locally Interacting Agents

Liagkou, Vasiliki, Nastou, Panagiotis E, Spirakis, Paul ORCID: 0000-0001-5396-3749 and Stamatiou, Yannis C (2023) On the Existence of Highly Organized Communities in Networks of Locally Interacting Agents. In: 7th International Symposium on Cyber Security , Cryptology and Machine Learning (CSCML 2023), 2023-6-29 - 2023-6-30, Ben-Gurion (Israel) and virtual.

Text
CSCML_2023_paper_801 (2).pdf - Author Accepted Manuscript
Download (933kB) | Preview

Official URL: http://dx.doi.org/10.1007/978-3-031-34671-2_35

Abstract

In this paper we investigate phenomena of emergence of highly organized structures in networks. Our approach is based on Kolmogorov complexity of networks viewed as finite size strings. We apply this approach to study the emergence of simple organized, hierarchical, structures based on Sierpinski Graphs and we prove a Ramsey type theorem that bounds the number of vertices in Kolmogorov random graphs that contain Sierpinski Graphs as subgraphs. Moreover, we show that Sierpinski Graphs encompass close-knit relationships among their vertices that facilitate fast spread and learning of information. In the context of our work we can investigate questions related to the emergence or formation of suitably large groups of malicious individuals in a networks of interacting agents, which are able to take control of the networks.

Item Type:	Conference or Workshop Item (Unspecified)
Divisions:	Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User:	Symplectic Admin
Date Deposited:	14 Mar 2023 11:18
Last Modified:	18 Mar 2024 01:35
DOI:	10.1007/978-3-031-34671-2_35
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3169042