Matrix-graphic simulation of social network: ergodic properties
DOI:
https://doi.org/10.20535/SRIT.2308-8893.2025.4.03Keywords:
social system, simulation, ergodicity, eigenvalue, Jordan normal formAbstract
We propose mathematical tools for social network simulation to obtain sufficient conditions for network ergodicity, defined as the existence of a steady state as time approaches infinity. The proposed model is linear; the network elements form a two-dimensional array (matrix), where each entry represents the state of an element at a specific time.
An impact operator, structured as a four-dimensional array, defines the interactions between elements. This operator is also presented as a directed graph where vertices correspond to network elements, and arcs represent the impact of one element on another. The model incorporates boundary elements that influence the internal states of the network.
Sufficient conditions for network ergodicity are derived from the connectivity properties of the impact graph, which must contain paths between all pairs of vertices and loops for all vertices. These conditions ensure that the operator's spectrum (with the possible exception of the value 1) is located inside the open unit disk. We prove that 1 is an eigenvalue if and only if the boundary is isolated. These spectral properties guarantee that a steady state exists and can be found using an iterative procedure with linear (geometric) convergence.
References
Alan R. Wagner, “Creating and Using Matrix Representations of Social Interaction,” HRI09: International Conference on Human Robot Interaction, 09 March 2009, La Jol-la California USA, pp. 125–132.
T.H. Yemelyanenko, A.O. Domashych, “Research of models of social networks,” (in Ukrainian), Actual problems of automation and information technology, vol. 21, pp. 74–86, 2017.
V.V. Breer, D.A. Novikov, A.D. Rogatkin, Mob Control: Models of Threshold Collec-tive Behavior. Heidelberg: Springer, 2017, 134 p. doi: https://doi.org/10.1007/978-3-319-51865-7
V.N. Burkov, M. Goubko, N. Korgin, D. Novikov, Introduction to Theory of Control in Organizations. Boca Raton: CRC Press, 2015, 346 p. doi: https://doi.org/10.1201/b18152
A.V. Proskurnikov, R. Tempo, “A tutorial on modeling and analysis of dynamic social networks. Part I,” Annual Reviews in Control, vol. 43, pp. 65–79, 2017. doi: https://doi.org/10.1016/j.arcontrol.2017.03.002
A.V. Proskurnikov, R. Tempo, “A tutorial on modeling and analysis of dynamic social networks. Part II,” Annual Reviews in Control, vol. 45, pp. 166–190, 2018. doi: https://doi.org/10.1016/j.arcontrol.2018.03.005
P.S. Senyo, Probability theory and mathematical statistic. Kyiv: Center of educational literature, 2004, 448 p.
Richard Bellman, Introduction to Matrix Analysis; Second Edition. Philadelphia: Socie-ty for Industrial and Applied Mathematics, 1997, 431 p.
A. Hallak, G. Dalal, “On the Products of Stochastic and Diagonal Matrices,” NVIDIA Research, 2023, 6 p. doi: 10.48550/arXiv.2304.11634
F.R. Gantmacher, Theory of matrices; Vol. 1. New York: Chelsea Publishing Company, 1959, 374 p.
V.A. Ilyin, E.G. Poznyak, Linear Algebra. 1987, 288 p.
Thomas L. Saaty, The Analytic Hierarchy Process: Planning, Priority Setting, Resource Allocation. New York: McGraw-Hill, 1980, 287 p.
M. Bousquet-Mélou, M. Petkovšek, “Linear recurrences with constant coefficients: the multivariate case,” Discrete Mathematics, vol. 225, pp. 51–75, 2000. doi: https://doi.org/10.1016/S0012-365X(00)00147-3
