{'fraction_non_alphanumeric': 0.013489208633093525, 'fraction_numerical': 0.0, 'mean_word_length': 5.323863636363637, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Managing dynamic graphs of mobile computer networks with random disturbances

We consider mobile computer networks whose stationary movements are forced to change at some points in time by external control actions or random disturbances. External influence can be aimed at the transition of the network to another stationary movement, but during the transition period there is a danger of decreasing the reliability of the network, the quality of its functioning, and even the threat of operability. One of the reasons for this is the rapid change in the topological (graph) characteristics of the network — the loss of connectivity of the dynamic graph of the network, the change in the set of available data transmission routes between nodes. The paper describes the results of statistical modeling of the characteristics of dynamic graphs for perturbed motion, and also presents algorithms for managing dynamic graphs during the transition process, which reduce the negative effects on the network from external influences. Using methods of predictive modeling, the quality of control algorithms is evaluated.