
Graphostructural modeling of discrete-argument systems
Author(s) -
Semen Blyumin,
Natalya Zhbanova,
Anton Sysoev
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1479/1/012053
Subject(s) - argument (complex analysis) , simple (philosophy) , computer science , key (lock) , theoretical computer science , complex system , matrix (chemical analysis) , discrete system , mathematics , algorithm , artificial intelligence , epistemology , philosophy , biochemistry , chemistry , materials science , computer security , composite material
Graphostructural modeling is an effective tool for the analysis and control of social and economics systems. Graphs, hypergraphs and metagraphs are used to simulate complex hierarchical structures. In this paper we consider metagraphs and their matrices associated with 2D and 3D systems and cellular automatons; and their relationship with the transition from basic to associated models of cellular automatons. The transition to an associated model is a key step in developing the theory of discrete argument systems. In this paper with the simple examples of discrete-argument systems we demonstrate that matrix characteristics of the models, associated with such systems, are closely related to the matrix characteristics of associated metagraphs.