1301.1503 (Naoki Masuda et al.)

Application of semidefinite programming to maximize the spectral gap
produced by node removal    [PDF]

Naoki Masuda, Tetsuya Fujie, Kazuo Murota

The smallest positive eigenvalue of the Laplacian of a network is called the spectral gap and characterizes various dynamics on networks. We propose mathematical programming methods to maximize the spectral gap of a given network by removing a fixed number of nodes. We formulate relaxed versions of the original problem using semidefinite programming and apply them to example networks.

View original: http://arxiv.org/abs/1301.1503