ESTIMATING AND ENHANCING THE FEEDBACKABILITY OF COMPLEX NETWORKS

Abstract

In this paper, we explore the relationship between Minimum Feedbackability Set (MFS) and Feedbackability Set (FS) of complex networks and use simulated annealing algorithm to obtain a relatively fast and reliable estimation of the MFS. Then, we implement this method to estimate the MFS of some real-world networks and explore whether the topological features influence the size of MFS. Additionally, we propose an optimal perturbation strategy to enhance the feedbackability of complex networks. Finally, we also research the intricate relationship between the structural properties and the feedbackability of various networks perturbed by optimal and random perturbation strategies.