по
Cybernetics and programming
12+
Journal Menu
> Issues > Rubrics > About journal > Authors > About the Journal > Requirements for publication > Council of Editors > Peer-review process > Policy of publication. Aims & Scope. > Article retraction > Ethics > Online First Pre-Publication > Copyright & Licensing Policy > Digital archiving policy > Open Access Policy > Article Processing Charge > Article Identification Policy > Plagiarism check policy
Journals in science databases
About the Journal

MAIN PAGE > Back to contents
Publications of Toropov Boris Andreevich
Security Issues, 2019-5
Ovchinskii A.S., Shmonin A.V., Toropov B.A., Vasil'ev F.P. - Criminal environment of digital world as a threat to cybersecurity pp. 9-15

DOI:
10.25136/2409-7543.2019.5.27115

Abstract: This article attempts to broaden the modern representations on criminal environment existing in the conditions of globalization and digitalization of virtually all spheres of human and social life. Special attention is paid to the reference frame of current criminal activities. The authors examine the conditions and factors associated with extensive development and proliferation of information technologies and accompanying the emergence, advancement and self-organization of criminality. Positive foreign experience in the area of counteracting cyber threats and criminalization of cyberspace is reviewed. The authors lean on the achievements of Soviet criminology and scientific representations of the criminal environment. Systematization and generalization of the traditional criminological perceptions on criminal activities in light of the current trends in the area of total informatization of the society allow describing and getting deeper understanding of the essence and structure of modern criminality on the new methodological level. This in turn, creates theoretical and methodological platform for the development of measures on counteracting criminal cyber threats.   
Cybernetics and programming, 2017-2
Toropov B.A. - Flajolet-Martin algorithm as an effective social network analysis tool. pp. 8-16

DOI:
10.7256/2306-4196.2017.2.22308

Abstract: The study is devoted to the influence (centrality) model of a social network participant.  The object of studies involves calculations for the centrality metrics, which are based upon the shortest path lengths between the graph vertices for the social graph based upon the iterative performance of the Flajolet-Martin algorithm. The author evaluates the possibility of approximateе evaluation of closeness-centrality based on a simple example. Then, having the calculation results, teh author compares the computed values with the real closeness values, as computed by breadth-first search algorithm (BFS-Algorithm). The methodology of the study involves graph theory elements, as well as the social network analysis apparatus, which allows to compute different centrality metrics of a graph vertex. The key conclusion provides that the Flajolet-Martin algorithm is an easily adaptable tool for the approximate social graph vertex centrality evaluation related with the shortest paths, such as closeness or centrality of the disintegration, as provided for in the work so M. Jackson. In turn, it provides for the new possibilities for the process modeling for the spread of information in the social networks.
Software systems and computational methods, 2017-2
Toropov B.A. - Game-theoretic centrality in the graph nodes based upon the Shapley vector. pp. 45-54

DOI:
10.7256/2454-0714.2017.2.22647

Abstract: The object of studies concerns the methods for evaluation of the graph nodes. The author pays attention to the fact that the existing centrality metrics, such as level centrality, closeness centrality, interval centrality, own vector, etc., are sometimes not suitable for modeling the situations, when graph nodes are social object models, and therefore, they are capable of cooperation in order to achieve social goals.  In this case game-theoretic centrality models (such as coalition games models) are better suited to reflect the modeling object.  The methodology of the study involves the elements of graph theory, probability theory, as well as the apparatus for the analysis of social networks as a new independent scientific sphere. The key result of the stuy is that game-theoretic centrality based upon the Shapley vector is a flexible and mostly universal instrument for the social graph analysis.  It allows to consider an unlimited set of quality characteristics of the graph nodes, as well as their topological qualities in any combination in order to evaluate the nodes.
Security Issues, 2016-6
Toropov B.A., Tagirov Z.I. - Terrorist networks models and the game-theoretic approach to the assessment of the centrality of their members pp. 77-89

DOI:
10.7256/2409-7543.2016.6.21436

Abstract: The paper reveals the prerequisites to the network modeling of terrorist structures, connected with the modern political, organizational and legal conditions of the struggle against terrorism. The authors consider the potential directions of terrorist networks modeling and formulate the approach to their modeling, that is at the interface of two scientific approaches: game theory and social network analysis. Using the example of the terrorist group, that had organized the unprecedented terrorist act in the USA on September 11, 2001, the authors demonstrate the results of the calculation of the terrorist network model, which help assess the role of each of its members in the context of different primary data about the prepared terrorist act. The research methodology is based on the elements of social network analysis, graph theory and game theory. In particular, the authors consider the algorithm of calculation of the network members’ centrality using the Shapley value. The calculation results take into account the ability of the network’s members to cooperate in order to achieve the desired goals. Besides, the algorithm is quite flexible and allows assessing the role of each of the members on the base of the combination of its qualitative and quantitative characteristics. It forms the key difference of the game-theory centrality metrics from the “classical” degree, closeness and betweenness, thus determining the novelty of the obtained results. 
Cybernetics and programming, 2016-5
Toropov B.A. - Independent cascade model of reposts spreading in online social network pp. 199-205

DOI:
10.7256/2306-4196.2016.5.20624

Abstract: The article focuses on the modeling of information dissemination in online social networks through reposts. The author considers the threshold model and an independent cascade model of information spreading in network. In the context of the independent cascade model author suggests a method of estimating the probability of spreading of information for each pair of connected users. The article reviews visible activity of online social network users that affect the likelihood for a particular user to read the information message, published by one of his friends, and then make a repost. The methodology of the study is related to the mathematical modeling of social processes. To build the model the author uses elements of set theory, graph theory. The main conclusion is that of the models considered (the threshold model and the independent cascade model), which both are special cases of same generalized model, it is the independent cascade model that most accurately reflects the logic of the process of information spreading in the online social network via reposts. The scientific novelty of the work lies in the fact that using the results for independent cascade model the author provides a method for the evaluation of information transmission probabilities for each pair of connected users.
Other our sites:
Official Website of NOTA BENE / Aurora Group s.r.o.