Article
Version 1
Preserved in Portico This version is not peer-reviewed
Complex Network Formation as Antagonistic Game: Numerical Modeling
Version 1
: Received: 11 July 2022 / Approved: 21 July 2022 / Online: 21 July 2022 (10:51:03 CEST)
How to cite: Bocharov, P.; Goryashko, A. Complex Network Formation as Antagonistic Game: Numerical Modeling. Preprints 2022, 2022070324. https://doi.org/10.20944/preprints202207.0324.v1 Bocharov, P.; Goryashko, A. Complex Network Formation as Antagonistic Game: Numerical Modeling. Preprints 2022, 2022070324. https://doi.org/10.20944/preprints202207.0324.v1
Abstract
The basic challenges of this work are twofold: demonstrating the dependence between the functional and topological qualities of partition networks and finding the simplest—with respect to algorithmic complexity—network elements. The study of these problems is based on finding the solution to an appropriate antagonistic vertex game. The results of the numerical simulations of antagonistic partition games demonstrate that the winner’s graphs are “almost always” dense and hyperenergetic compared to the loser’s graphs. These observations reveal that successful evolutionary mechanisms can be realized, in principle, by the simplest objects (such as viruses).
Keywords
Graph complexity; antagonistic game theory; partition networks; neural networks; numeric modellng; Nash equilibrium; Neumann equilibrium
Subject
Computer Science and Mathematics, Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment