Sergey S. Kulikov,Vladimir N. Derevianko,Dmitrii O. Karpeev,Mikhail I. Bocharov,Ekaterina A. Moskaleva,Nikolai M. Radko,



Suspended graph,vertex,traffic,algorithm,


This paper proposes a method of transformation of network models, taking into account their topological properties and weight characteristics. The method is intended for the networks with a large number of vertices. Social information networks, mustering millions of users, should be considered as the most illustrative example of such. Simulation of similar networks structures takes tremendous calculation expenditures and, therefore, the authors set themselves a task to transform the initial network by means of size reduction, yet retaining its properties. Since modern corporate and global networks are suspended (all vertices and arcs have different weights – specific traffic) and heterogeneous (the number of vertices bonds varies significantly), therefore, the authors aim to (when transforming the graph) preserve all above-mentioned topological properties and weight characteristics of the analysed network. Some equivalent transformations are formalized in the form of algorithm of the researcher’s actions. Software based on this algorithm confirmed efficiency of the proposed approach. Adduced examples illustrate the peculiarities of the proposed algorithm of transformation of networks models. Emphasized results of the research are the following: for the first time an algorithm of similarity transformation offers an opportunity to reduce an initially large network into a considerably smaller network that is convenient to use in the analysis of social networks and epidemic processes of content distribution; resulting assessments of metrics and characteristics of suspended networks, in contrast to analogues, give an opportunity to consider weight properties of the network and present an apparatus for studying properties of harmful content distribution in suspended heterogeneous social networks; in this case, discrete macro-models of the epidemic process differ from the analogues, they specifically simulate a suspended heterogeneous social network, including filler of the vertices (agents quality) and network bandwidth (the traffic that passes along the communication lines of the network).


I. Bailey, P., Craswell, N., & Hawking D. (2003). Engineering a multi-purpose test collection for Web retrieval experiments. Information processing and management, 39, 853-871.
II. Bourqui, R., Gilbert, F., Simonetto, P., Zaidi, F., Sharan, U., & Jourdan, F. (2009). Detecting structural changes and command hierarchies in dynamic social networks. Advances in Social Network Analysis and Mining, 1, 83–88.
III. Chebotarev, P., &Shamis, E. (1997). The matrixforest theorem and measuring relations in small social groups. Automation and Remote Control, 58, 1505-1514.
IV. Dekker, A. (2006). Conceptual Distance in Social Network Analysis. Network Analysis Journal, 6, 1-31.
V. Dries, A., Nijssen, S., &Raedt, L.D. (2009). A query language for analyzing networks. CIKM, 3, 485-494.
VI. Ermakov, S.A., Zavorykin, A.S., Kolenbet, N.S., Ostapenko, A.G., & Kalashnikov, A.O (2014). Optimization of expert methods used to analyze information security risk in modern wireless networks. Life Science Journal, 11(10s), 511-514.
VII. Evin, I.A., &Habibullin, T.F. (2012). Social networks. Computer studies and modeling, 4(2), 423–430.
VIII. Islamgulova, V.V., Ostapenko, A.G., Radko, N.M., Babadzhanov, R.K., &Ostapenko, O.A. (2016). Discreet risk-models of the process of the development of virus epidemics in non-uniform networks. Journal of Theoretical and Applied Information Technology, 306-315.
IX. Kuwata, Y. (2009). Decomposition algorithm for global reachability analysis on a time-varying graph as applied to planetary exploration. International Conference on Intelligent Robots and Systems.
X. Monjardet, B., &Raderinirina, V. (2001). The duality between the antiexchange closure operators and the path independent choice operators on a finite set. Mathematical Social Sciences, 41, 131-150.
XI. Newman, M.E.J. (2006). Finding community structure in networks using the eigenvectors of matrices. Physical Review Letters, 74, 1-22.
XII. Ostapenko, A.G., Bursa, M.V., Ostapenko, G.A., &Butrik, D.O. (2014). Flood-attacks within the hypertext information transfer protocol: damage assessment and management. Biosciences Biotechnology Research Asia, 11(Spl.End), 173-176.
XIII. Ostapenko, A.G., Plotnikova, D.A., &Guzev, U.N. (2016). Weighted Network Metrics. Information and Security, 19(2), 258-261.
XIV. Ostapenko, G.A., Parinova, L.V., Belonozhkin, V.I., Bataronov, I.L., & Simonov, K.V. (2013). Analytical models of information-psychological impact of social information networks on users. World Applied Sciences Journal, 25(3), 410-415.
XV. Ostapenko, G.A., Plotnicov, D.G., Makarov, O.Y, Tikhomirov, N.M., &Yurasov, V.G. (2013). Analytical estimation of the component viability of distribution automated information data system. World Applied Sciences Journal, 25(3), 416-420.
XVI. Oystein, O. (1946). Mappings of Closure Relations. Annals of Mathematics, 47, 56-72.
XVII. Park, Y., Moore, C.,& Bader, J. (2010). Dynamic networks from hierarchical Bayesian graph clustering. PLoS One, 5, 8118.
XVIII. Pfaltz, J. (2006). Logical Implication and Causal. Dependency Conceptual Structures: Inspiration and Application, 1, 145-157.
XIX. Pfaltz, J. A. (2013). Mathematical Model of Dynamic Social Networks. Social Network Analysis, 3, 863-872.
XX. Radko, N.M., Ostapenko, A.G., Mashin, S.V., Ostapenko, O.A., &Avdeev, A.S. (2014). Peak risk assessing the process of information epidemics expansion. Biosciences Biotechnology Research Asia, 11(Spl.End), 251-255.
XXI. Radko, N.M., Ostapenko, A.G., Mashin, S.V., Ostapenko, O.A., &Gusev, D.V. (2014). Assessment of the system’s EPI-resistance under conditions of information epidemic expansion. Biosciences Biotechnology Research Asia, 11(3), 1781-1784.
XXII. Richards, W., &Seary, A. (2000). Eigen Analysis of Networks. The Journal of Social Structure, 2, 1-16.
XXIII. Toivonen, R., Kumpula, J.M., Saramäki, J., Onnela, J.P., Kertész, J., &Kaski, K. (2007). The role of edge weights in social networks: modelling structure and dynamics. Noise and Stochastics in Complex Systems and Finance, 6601, 3-5.
XXIV. Wax, M., &Sheinvald, J. (1997). A least-squares approach to joint diagonalization. IEEE Signal Processing Letters, 4, 52-53.
XXV. Zhao, K., Kumar, A., Harrison, T., & Yen, J. (2011). Analyzing the Resilience of Complex Supply Network Topologies against Random and Targeted Disruptions. IEEE Systems Journal, 5(1), 28-39.

View | Download