title: Reducing the Spectral Radius of a Torus Network by Link Removal.
abstract: The optimal link removal (OLR) problem aims at removing a given number of links of a network so that the spectral radius of the residue network obtained by removing the links from the network attains the minimum. Torus networks are a class of regular networks that have witnessed widespread applications. This paper addresses three subproblems of the OLR problem for torus networks, where two or three or four edges are removed. For either of the three subproblems, a link-removing scheme is described. Exhaustive searches show that, for small-sized tori, each of the proposed schemes produces an optimal solution to the corresponding subproblem. Monte-Carlo simulations demonstrate that, for medium-sized tori, each of the three schemes produces a solution to the corresponding subproblem, which is optimal when compared to a large set of randomly produced link-removing schemes. Consequently, it is speculated that each of the three schemes produces an optimal solution to the corresponding subproblem for all torus networks. The set of links produced by each of our schemes is evenly distributed over a network, which may be a common feature of an optimal solution to the OLR problem for regular networks.
authors.affiliation: School of Software Engineering, Chongqing University, Chongqing, China.
authors.forename: Xiaofan
authors.initials: X
authors.lastname: Yang
authors.affiliation: School of Software Engineering, Chongqing University, Chongqing, China.
authors.forename: Pengdeng
authors.initials: P
authors.lastname: Li
authors.affiliation: School of Software Engineering, Chongqing University, Chongqing, China.
authors.forename: Lu-Xing
authors.initials: LX
authors.lastname: Yang
authors.affiliation: School of Software Engineering, Chongqing University, Chongqing, China.
authors.forename: Yingbo
authors.initials: Y
authors.lastname: Wu
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D009010:Monte Carlo Method