Informatics and Applications
2018, Volume 12, Issue 2, pp 90-97
THE INFLUENCE OF THE CONNECTIONS' DENSITY ON CLUSTERIZATION AND PERCOLATION THRESHOLD DURING INFORMATION DISTRIBUTION IN SOCIAL NETWORKS
- D. O. Zhukov
- T. Yu. Khvatova
- S. A. Lesko
- A. D. Zaltsman
Abstract
The paper is focused on applying new theoretical approaches to describing the processes of information transmission and transformation in sociotechnical systems and in social networks based on the percolation theory. Percolation threshold of a random network depends on its density. In networks with random structure, in both the task of bonds and the task of nodes, percolation thresholds reach saturation when the network's density is high. The
saturation value of a percolation threshold is higher in the task of bonds. From the point of information influence of
a random network, increasing the average connection's density within the network turns out to be more preferable
than fostering a small number of separate 'central nodes' with numerous connections. The results obtained in
this study can be applied in interdisciplinary research in such areas as informatics, mathematic modeling, and
economics involving certain sociological survey data for forecasting behavior and managing groups of individuals in
network communities. This research enhances and enlarges the scope of methods and approaches applied in classic
informatics for describing social and sociotechnical systems, which can be useful for a wide range of researchers
engaged into studying social network structures.
[+] References (15)
- Wiener, N. 1961. Cybernetics: Or control and communication in the animal and the machine. 2nd ed. MIT Press. 212 p.
- Bakanova, S. A., and G. Yu. Silkina. 2015. Knowledge
dissemination process in parametrized networks of enterprises. St. Petersburg State Polytechnical University J.
Economics 2(216):133-146.
- Sulimov, P. A. 2016. Metody mashinnogo obucheniya dlya
predskazaniya rasprostraneniya infektsii v seti [Methods
of machine learning for forecasting an infection distri-
bution within a network]. Vestnik NGUEU [NGUEU J.]
1:285-306.
- Toropov, B. A. 2016. Model' nezavisimykh kaskadov rasprostraneniya reposta v onlaynovoy sotsial'noy seti [The
model of independent cascades of a repost distribution in
an online social network]. Kibernetika iprogrammirovanie
[Cybernetics and Programming] 5:61-67.
- Tarasevich, Yu. 2002. Perkolyatsii: teoriya,prilozheniya, algoritmy [Percolations: Theory, applications, algorithms].
Moscow: Editorial URSS. 112 p.
- Les'ko, S., D. Zhukov, and I. Samoylo. 2013. Matematicheskoe modelirovanie perkolyatsionnykh protsessov
peredachi dannykh i poteri rabotosposobnosti v informatsionno-vychislitel'nykh setyakh s 2D i 3D regulyarnoy
i sluchaynoy strukturoy [Mathematic modeling of percolation processes of data transmission and operability
loss in informational-computational networks with 2D
and 3D regular and random structure]. Kachestvo. Innovatsii. Obrazovanie [Quality. Innovations. Education]
11(97):42-50.
- Les'ko, S., D. Zhukov, I. Samoylo, and D. Bruks. 2013b.
Algoritmy postroeniya setey i modelirovaniyapoteri ikh rabotosposobnosti v rezul'tate klasterizatsii blokirovannykh
uzlov [Algorithms of network construction and modeling of their operability loss as a result of blocked nodes clusterization]. Kachestvo. Innovatsii. Obrazovanie [Quality Innovations. Education] 12(103):25-33.
- Pavlekovskaya, I. V. 2007. The use of social network analysis in modeling the organizational processes of informa-tion and knowledge circulation. Automatic Documentation Math. Linguistics 41(2):65-72.
- Chen, Y., G. Paul, R. Cohen, S. Yavlin, S. P. Borgatti, F Liljeros, and H. E. Stanley. 2006. Percolation theory and fragmentation measures in social networks. Physica A 378(1):11-19.
- Kawamoto, H., H. Takayasu, H.J. Jensen, and M. Takayasu. 2015. Precise calculation of a bond percolation transition and survival rates of nodes in a complex network. PLoS One. Available at: http://journals. plos.org/plosone/article?id=10.1371 /journal.pone. 0119979 (accessed December 16, 2017).
- Barabasi, A. L., and R. Albert. 1999. Emergence of scaling in random networks. Science 286:509-512.
- Albert, R., H. Jeong, and A. L. Barabasi. 2000. Error and attack tolerance of complex networks. Nature 406:378- 382.
- Zhukov, D., and S. Lesko. 2015. Percolation models of information dissemination in social networks. IEEEConference (International) on Smart City/SocialCom/SustainCom together with DataCom Proceedings. IEEE. 213-216.
- Block, M., T Khvatova, D. Zhukov, and S. Lesko. 2015. Studying the structural topology of the knowledge sharing network. 11th European Conference on Management, Leadership and Governance Proceedings. Lisbon, Portugal: Academic Conferences and Publishing International Ltd. 20-27.
- Khvatova, T, M. Block, D. Zhukov, and S. Lesko. 2016. How to measure trust: The percolation model applied to intra-organisational knowledge sharing networks. J. Knowl. Manag. 20(5):918-935.
[+] About this article
Title
THE INFLUENCE OF THE CONNECTIONS' DENSITY ON CLUSTERIZATION AND PERCOLATION THRESHOLD DURING INFORMATION DISTRIBUTION IN SOCIAL NETWORKS
Journal
Informatics and Applications
2018, Volume 12, Issue 2, pp 90-97
Cover Date
2018-05-30
DOI
10.14357/19922264180213
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
percolation theory; social network structure; connections' density; network clusterisation; percolation threshold
Authors
D. O. Zhukov , T. Yu. Khvatova , S. A. Lesko , and A. D. Zaltsman
Author Affiliations
Moscow Technological University (MIREA), 78 Vernadskogo Ave., Moscow 119454, Russian Federation
Peter the Great St. Petersburg Polytechnic University, 29 Polytechnicheskaya Str., St. Petersburg 195251, Russian Federation
|