Detecting highly cyclic structure with complex eigenpairs
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Social networks; opinion dynamics (91D30) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)
Abstract: Many large, real-world complex networks have rich community structure that a network scientist seeks to understand. These communities may overlap or have intricate internal structure. Extracting communities with particular topological structure, even when they overlap with other communities, is a powerful capability that would provide novel avenues of focusing in on structure of interest. In this work we consider extracting highly-cyclic regions of directed graphs (digraphs). We demonstrate that embeddings derived from complex-valued eigenvectors associated with stochastic propagator eigenvalues near roots of unity are well-suited for this purpose. We prove several fundamental theoretic results demonstrating the connection between these eigenpairs and the presence of highly-cyclic structure and we demonstrate the use of these vectors on a few real-world examples.
This page was built for publication: Detecting highly cyclic structure with complex eigenpairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6277673)
