| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Sao Paulo, ICMC Sao Carlos, BR-13566 Sao Paulo - Brazil
[2] Humboldt Univ, Dept Math, D-10099 Berlin - Germany
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | SIAM JOURNAL ON APPLIED MATHEMATICS; v. 78, n. 1, p. 372-394, 2018. |
| Web of Science Citations: | 5 |
| Abstract | |
This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called the algebraic connectivity) and its associated eigenvector (the so-called Fiedler vector). Here we prove that, given a Laplacian matrix, it is possible to perturb the weights of the existing edges in the underlying graph in order to obtain simple eigenvalues and a Fiedler vector composed of only nonzero entries. These structural genericity properties with the constraint of not adding edges in the underlying graph are stronger than the classical ones, for which arbitrary structural perturbations are allowed. These results open the opportunity to understand the impact of structural changes on the dynamics of complex systems. (AU) | |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |