Spectral Characteristics of Network Redundancy

DOI10.1103/PHYSREVE.80.026117arXiv0904.3192WikidataQ84599403 ScholiaQ84599403MaRDI QIDQ6213618FDOQ6213618

Authors: Ben D. MacArthur, Rubén J. Sánchez-García 

Publication date: 21 April 2009

Abstract: Many real-world complex networks contain a significant amount of structural redundancy, in which multiple vertices play identical topological roles. Such redundancy arises naturally from the simple growth processes which form and shape many real-world systems. Since structurally redundant elements may be permuted without altering network structure, redundancy may be formally investigated by examining network automorphism (symmetry) groups. Here, we use a group-theoretic approach to give a complete description of spectral signatures of redundancy in undirected networks. In particular, we describe how a network's automorphism group may be used to directly associate specific eigenvalues and eigenvectors with specific network motifs.

This page was built for publication: Spectral Characteristics of Network Redundancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6213618)