Approximating the largest eigenvalue of network adjacency matrices - Condensed Matter > Disordered Systems and Neural NetworksReportar como inadecuado




Approximating the largest eigenvalue of network adjacency matrices - Condensed Matter > Disordered Systems and Neural Networks - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The largest eigenvalue of the adjacency matrix of a network plays animportant role in several network processes (e.g., synchronization ofoscillators, percolation on directed networks, linear stability of equilibriaof network coupled systems, etc.). In this paper we develop approximations tothe largest eigenvalue of adjacency matrices and discuss the relationshipsbetween these approximations. Numerical experiments on simulated networks areused to test our results.



Autor: Juan G. Restrepo, Edward Ott, Brian R. Hunt

Fuente: https://arxiv.org/







Documentos relacionados