## Abstract

The dynamics of contact processes on networks is often determined by the spectral radius of the networks adjacency matrices. A decrease of the spectral radius can prevent the outbreak of an epidemic, or impact the synchronization among systems of coupled oscillators. The spectral radius is thus tightly linked to network dynamics and function. As such, finding the minimal change in network structure necessary to reach the intended spectral radius is important theoretically and practically. Given contemporary big data resources such as large scale communication or social networks, this problem should be solved with a low runtime complexity. We introduce a novel method for the minimal decrease in weights of edges required to reach a given spectral radius. The problem is formulated as a convex optimization problem, where a global optimum is guaranteed. The method can be easily adjusted to an efficient discrete removal of edges. We introduce a variant of the method which finds optimal decrease with a focus on weights of vertices. The proposed algorithm is exceptionally scalable, solving the problem for real networks of tens of millions of edges in a short time.

Original language | English |
---|---|

Article number | 093039 |

Journal | New Journal of Physics |

Volume | 18 |

Issue number | 9 |

DOIs | |

State | Published - Sep 2016 |

### Bibliographical note

Publisher Copyright:© 2016 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.

## Keywords

- contact process
- epidemics
- networks
- percolation
- spectral radius
- synchronization