Numerical Optimization Algorithms for Optimizing Node Centrality in Complex Networks

loading.default
thumbnail.default.alt

item.page.date

item.page.authors

item.page.journal-title

item.page.journal-issn

item.page.volume-title

item.page.publisher

Genius Journals

item.page.abstract

Centrality measures play a crucial role in various fields, including social network analysis, transportation network optimization, and information flow analysis. In this paper, we present a new approach to optimize network centrality. We developed an optimization model to increase the centrality of nodes in the network by using numerical optimization procedures. To evaluate the proposed approach two well-known algorithms, SLSQP and COBYLA, implemented in maximizing centrality through extensive tests on a random network. The outcomes show the value of our suggested strategy in enhancing network centrality and suggest the possibility of outperforming more conventional methods. Finally, python language puts the strategy into practice and produces the desired outcomes

item.page.description

item.page.citation

item.page.collections

item.page.endorsement

item.page.review

item.page.supplemented

item.page.referenced