9 research outputs found
Application of semidefinite programming to maximize the spectral gap produced by node removal
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.Comment: 1 figure. Short paper presented in CompleNet, Berlin, March 13-15
(2013
Venice chart international consensus document on ventricular tachycardia/ventricular fibrillation ablation
Speed of complex network synchronization
Synchrony is one of the most common dynamical states emerging on networks. The speed of convergence towards synchrony provides a fundamental collective time scale for synchronizing systems. Here we study the asymptotic synchronization times for directed networks with topologies ranging from completely ordered, grid-like, to completely disordered, random, including intermediate, partially disordered topologies. We extend the approach of master stability functions to quantify synchronization times. We find that the synchronization times strongly and systematically depend on the network topology. In particular, at fixed in-degree, stronger topological randomness induces faster synchronization, whereas at fixed path length, synchronization is slowest for intermediate randomness in the small-world regime. Randomly rewiring real-world neural, social and transport networks confirms this picture