Eigenvector centrality fails to converge on disconnected graphs
The goal is to obtain stable eigenvector centrality values that can be used for ranking nodes in downstream network analysis tasks. However, when the supplied graph is not connected or lacks a dominant eigenvalue, the power‑iteration implementation in NetworkX may fail to converge within the default iteration limit, producing either non‑terminating loops or