{'fraction_non_alphanumeric': 0.016243654822335026, 'fraction_numerical': 0.003045685279187817, 'mean_word_length': 5.08641975308642, '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}}
Partial pinning control of complex networks

In large directed complex networks, it may result unfeasible to successfully pinning control the whole network. Indeed, when the number of pinned nodes has to be lower than the number of strictly connected components in the graph, it is impossible to guarantee pinning controllability of all the nodes in the network. In this paper, we introduce the partial pinning control problem, which consists in determining the optimal selection of the pinned nodes so as to maximize the fraction of nodes that can be asymptotically controlled to the pinner's trajectory. A suboptimal solution to this problem is provided for a class of nonlinear nodes' dynamics, together with the bounds on the minimum coupling and control gains required to actually control the network. The theoretical analysis is translated into an integer linear programming (ILP) problem, which is solved on a testbed network of 688 nodes building an ad hoc algorithm in Matlab.