arXiv · 1301.1503
Application of semidefinite programming to maximize the spectral gap produced by node removal
Abstract
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.
Explore related subjects
Keep this discovery
Naoki Masuda, Tetsuya Fujie, Kazuo Murota. 2013-01-08. Application of semidefinite programming to maximize the spectral gap produced by node removal. https://arxiv.org/abs/1301.1503
Cite the original work for its findings. Save a collection to share your selection of sources.