In the literature, it sometimes indicates that network with high value of largest eigenvalue (either adjacency matrix or its Laplacian counterpart) are more robust. Robustness here is relevant to link/node removals. However, these statements are usually NOT accompanied with references.

I am looking for some explanation on why is this so? Or pointers to some work that investigate/explain this.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.