Optimizing algebraic connectivity by edge rewiring

Applied Mathematics and Computation(2013)

引用 59|浏览0
暂无评分
摘要
Robustness in complex networks is an ongoing research effort that seeks to improve the connectivity of networks against attacks and failures. Among other measures, algebraic connectivity has been used to characterize processes such as damped oscillation of liquids in connected pipes. Similar characterizations include the number of edges necessary to disconnect a network: the larger the algebraic connectivity, the larger the number of edges required to disconnect a network and hence, the more robust a network. In this paper, we answer the question, ''Which edge can we rewire to have the largest increase in algebraic connectivity?''. Furthermore, we extend the rewiring of a single edge to rewiring multiple edges to realize the maximal increase in algebraic connectivity. The answer to this question above can provide insights to decision makers within various domains such as communication and transportation networks, who seek an efficient solution to optimize the connectivity and thus increase the robustness of their networks. Most importantly, our analytical and numerical results not only provide insights to the number of edges to rewire, but also the location in the network where these edges would effectuate the maximal increase in algebraic connectivity and therefore, enable a maximal increase in robustness.
更多
查看译文
关键词
transportation network,maximal increase,efficient solution,edge rewiring,connected pipe,single edge,largest increase,algebraic connectivity,decision maker,multiple edge,complex network,robustness,optimization,complex networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要