This paper examines the problem of assessing the influence of social network users and their groups in disseminating information among audiences. Forming a network of user subsets to initiate informational influence is a computationally complex problem with a stochastically uncertain outcome. Existing centrality metrics typically involve searching for all shortest paths in a graph or solving large-scale systemic sources. This paper provides approximate estimates of the influence of individual network participants and their subsets, based on modifications of the Flageolet-Martin algorithm. A greedy algorithm based on electronic metrics is also proposed, enabling coalition formation by iteratively supplementing it with quasi-optimal elements. The obtained results can be applied to problems of information analysis, forecasting, and planning in social networks.

Keywords: Social network, informational influence, coalition, influence, connection graph, centrality metric, closeness centrality, shortest path, route, approximate estimate, greedy algorithm

The article discusses the development of the 'Service-02' chatbot, designed to receive and register reports of crimes, administrative offenses, and incidents at the police station. The algorithm of the chatbot's operation, its architecture, and main functional capabilities are described. Particular attention is paid to the advantages of using the chatbot to improve the efficiency and quality of interaction between citizens and law enforcement agencies. The stages of development and prospects for further system development are analyzed. The article highlights the significance of digitalization in police work and its impact on improving public safety.

Keywords: chatbot, duty unit, Ministry of the Interior of Russia, police, digitalization, Service-02, internal affairs agencies, Telegram