Development of a method for calculation of information protection from the clustering coefficient and information flow in social networks

Authors

DOI:

https://doi.org/10.15587/2706-5448.2022.255962

Keywords:

dynamic models, information protection system, exception method, homogeneous characteristic equation, system stability

Abstract

The object of research is the system of information protection of the social network. The article investigates the dynamic models of the information protection system in social networks taking into account the clustering coefficient, and also analyzes the stability of the protection system. In graph theory, the clustering factor is a measure of the degree to which nodes in a graph tend to group together. The available data suggest that in most real networks, and in particular in social networks, nodes tend to form closely related groups with a relatively high density of connections. It is probability is greater than the average probability of a random connection between two nodes. There are two variants of this term: global and local. The global version was created for a general idea of network clustering, while the local one describes the nesting of individual nodes. There is a practical interest in studying the behavior of the system of protection of social networks from the value of the clustering factor.

Dynamic systems of information protection in social networks in the mathematical sense of this term are considered. A dynamic system is understood as any object or process for which the concept of state as a set of some quantities at a given moment of time is unambiguously defined and a given law is described that describes the change (evolution) of the initial state over time. This law allows the initial state to predict the future state of a dynamic system. It is called the law of evolution.

The study is based on the nonlinearity of the social network protection system. To solve the system of nonlinear equations used: the method of exceptions, the joint solution of the corresponding homogeneous characteristic equation. Since the differential of the protection function has a positive value in some data domains (the requirement of Lyapunov's theorem for this domain is not fulfilled), an additional study of the stability of the protection system within the operating parameters is required. Phase portraits of the data protection system in MatLab/Multisim are determined, which indicate the stability of the protection system in the operating range of parameters even at the maximum value of influences.

Author Biography

Volodymyr Akhramovych, State University of Telecommunications

Doctor of Technical Sciences, Professor

Department of Information and Cyber Defense Systems

References

  1. Laptiev, O., Savchenko, V., Kotenko, A., Akhramovych, V., Samosyuk, V., Shuklin, G., Biehun, A. (2021). Method of Determining Trust and Protection of Personal Data in Social Networks. International Journal of Communication Networks and Information Security, 1, 15–21. doi: http://doi.org/10.1109/atit54053.2021.9678599
  2. Fagiolo, G. (2007). Clustering in complex directed networks. Physical Review E, 76 (2). doi: http://doi.org/10.1103/physreve.76.026107
  3. Kaiser, M. (2008). Mean clustering coefficients: the role of isolated nodes and leafs on clustering measures for small-world networks. New Journal of Physics, 10 (8), 083042. doi: http://doi.org/10.1088/1367-2630/10/8/083042
  4. Akhramovych, V., Shuklin, G., Pepa, Y., Muzhanova, T., Zozulia, S. (2022). Devising a procedure to determine the level of informational space security in social networks considering interrelations among users. Eastern-European Journal of Enterprise Technologies, 1 (9 (115)), 63–74. doi: http://doi.org/10.15587/1729-4061.2022.252135
  5. Savchenko, V., Akhramovych, V., Tushych, A., Sribna, I., Vlasov, I. (2020). Analysis of Social Network Parameters and the Likelihood of its Construction. International Journal of Emerging Trends in Engineering Research, 8 (2), 271–276. doi: http://doi.org/10.30534/ijeter/2020/05822020
  6. Wang, Y., Ghumare, E., Vandenberghe, R., Dupont, P. (2017). Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs. Neural Computation, 29 (2), 313–331. doi: http://doi.org/10.1162/neco_a_00914
  7. Gracheva, М., Iakobi, Y., Stepanenko, V., Luneva, Y. (1950). Communication Patterns in Task‐Oriented Groups. The Journal of the Acoustical Society of America, 22 (6), 725–730. doi: http://doi.org/10.1121/1.1906679
  8. Yevin, I. A. (2010). Introduction to the theory of complex networks. Computer Research and Modeling, 2 (2), 121–141. doi: http://doi.org/10.20537/2076-7633-2010-2-2-121-141
  9. Zharinov, I., Krylov, V. (2008). Constructing graphs with minimum average path length. Bulletin of Izhevsk State Technical University, 4, 164–169.
  10. Pavlov, Y. L., Cheplyukova, I. A. (2019). On the asymptotics of degree structure of configuration graphs with bounded number of edges. Discrete Mathematics and Applications, 29 (4), 219–232. doi: http://doi.org/10.1515/dma-2019-0020
  11. Mamedova, H., Agaev, F., Zeinalova, L. (2019). Using social media to personalize e- learning. İnformasiya texnologiyaları problemləri, 1, 27–34.
  12. Starodubtsev, V. (2015). Personalization of the virtual educational environment. Pedagogical Education in Russia, 7, 24–29.
  13. Pavlov, J. (2019). On the asymptotics of the cluster coefficient of a configuration graph with an unknown distribution of vertex degrees. Information and its application, 13 (3), 9–13. doi: http://doi.org/10.14357/19922264190302
  14. Firsov, М. (2017). Benchmarking graph clustering algorithms for decision-making problems. Basic research, 12 (1), 138–142.
  15. Mahmoudi, A., Yaakub, M. R., Bakar, A. A. (2019). The Relationship between Online Social Network Ties and User Attributes. ACM Transactions on Knowledge Discovery from Data, 13 (3), 1–15. doi: http://doi.org/10.1145/3314204
  16. Mahmoudi, A., Yaakub, M. R., Abu Bakar, A. (2018). New time-based model to identify the influential users in online social networks. Data Technologies and Applications, 52 (2), 278–290. doi: http://doi.org/10.1108/dta-08-2017-0056

Downloads

Published

2022-04-30

How to Cite

Akhramovych, V. (2022). Development of a method for calculation of information protection from the clustering coefficient and information flow in social networks. Technology Audit and Production Reserves, 2(2(64), 31–37. https://doi.org/10.15587/2706-5448.2022.255962

Issue

Vol. 2 No. 2(64) (2022): Information and control systems

Section

Systems and Control Processes: Reports on Research Projects

License

Copyright (c) 2022 Volodymyr Akhramovych

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.