SOCIAL NETWORK COMMUNITIES’ SEARCH MODEL ABSTRACT

Authors

DOI:

https://doi.org/10.18372/2225-5036.28.16866

Keywords:

network, security, graph, structure, communities, modeling, algorithm, vertices

Abstract

. In order to ensure the smooth functioning of a social network with a large number of subscribers, it is advisable to divide it into subnets. Division into subnets will provide high-quality control of traffic and other parameters, including security parameters. The first reason for dividing the network into subnets is not to get a huge broadcast domain. The second important reason for dividing the network into subnets is to provide a certain level of security. The third reason is identifying online communities. The necessity of creating a model is determined. In this model graph is randomly generated with specified parameters for internal and external relationships between vertices, and communities are considered extraordinary. A method for isolating the structure of communities based on the maximum likelihood method is proposed, and a numerical random search algorithm is described on its basis. Graphs which representing real social and communication networks are changed rapidly. Moreover, random graphs are an effective tool for studying these networks. An important task is to identify the structure of communities in networks. In conditions of large dimensionality of networks, approximate methods are especially relevant. That allow finding a solution close to the optimal for a limited time. To solve this problem, it is proposed to create a model for distinguishing the structure of communities based on the maximum likelihood method. And a description of a numerical random search algorithm based on created model. This paper describes a mathematical model in which a graph is randomly generated with specified parameters for internal and external relationships between vertices, and communities are considered extraordinary. A method for isolating the structure of communities based on the maximum likelihood method is proposed, and a numerical random search algorithm using the Boltzmann-Gibbs distribution is described on its basis. The behavior of the objective function is investigated.

Downloads

Published

2022-11-04

How to Cite

Akhramovych, V., Lazarenko, S., Martyniuk, H., & Balanyuk, Y. (2022). SOCIAL NETWORK COMMUNITIES’ SEARCH MODEL ABSTRACT. Ukrainian Scientific Journal of Information Security, 28(1), 14–20. https://doi.org/10.18372/2225-5036.28.16866

Issue

Vol. 28 No. 1 (2022): Information security

Section

Network & Internet Security

License

The scientific journal "Ukrainian Scientific Journal of Information Security" adheres to the principles of open science and provides free, free and permanent access to all published materials. The goal of the policy is to increase the visibility, citation and impact of the results of scientific research in the field of information security. The journal works according to the principles of Open Access and does not charge a fee for access to published articles.

All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.

Copyright

Authors who publish their works in the journal “Ukrainian Scientific Journal of Information Security”:

  • retain the copyright to their publications;

  • grant the journal the right of first publication of the article;

  • agree to the distribution of their materials under the CC BY 4.0 license;

  • have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.