Estimating and increasing the structural robustness of a network

02/27/2021
by   Silvia Noschese, et al.
0

The capability of a network to cope with threats and survive attacks is referred to as its robustness. This paper discusses one kind of robustness, commonly denoted structural robustness, which increases when the spectral radius of the adjacency matrix associated with the network decreases. We discuss computational techniques for identifying edges, whose removal may significantly reduce the spectral radius. Nonsymmetric adjacency matrices are studied with the aid of their pseudospectra. In particular, we consider nonsymmetric adjacency matrices that arise when people seek to avoid being infected by Covid-19 by wearing facial masks of different qualities.

READ FULL TEXT
research
03/16/2021

On the joint spectral radius

We prove explicit polynomial bounds for Bochi's inequalities regarding t...
research
03/29/2023

On the α-spectral radius of hypergraphs

For real α∈ [0,1) and a hypergraph G, the α-spectral radius of G is the ...
research
03/16/2020

When Can Matrix Query Languages Discern Matrices?

We investigate when two graphs, represented by their adjacency matrices,...
research
10/20/2019

Spectral Analysis of the Adjacency Matrix of Random Geometric Graphs

In this article, we analyze the limiting eigenvalue distribution (LED) o...
research
12/17/2019

Generalized Perron Roots and Solvability of the Absolute Value Equation

Let A be a real (n× n)-matrix. The piecewise linear equation system z-A|...
research
08/26/2019

Predicting Network Controllability Robustness: A Convolutional Neural Network Approach

Network controllability measures how well a networked system can be cont...

Please sign up or login with your details

Forgot password? Click here to reset