The University of Southampton
University of Southampton Institutional Repository

Spectral characteristics of network redundancy

Spectral characteristics of network redundancy
Spectral characteristics of network redundancy
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
1539-3755
026117-[10pp]
MacArthur, Ben D.
2c0476e7-5d3e-4064-81bb-104e8e88bb6b
Sanchez-Garcia, Ruben
8246cea2-ae1c-44f2-94e9-bacc9371c3ed
MacArthur, Ben D.
2c0476e7-5d3e-4064-81bb-104e8e88bb6b
Sanchez-Garcia, Ruben
8246cea2-ae1c-44f2-94e9-bacc9371c3ed

MacArthur, Ben D. and Sanchez-Garcia, Ruben (2009) Spectral characteristics of network redundancy. Physical Review E, 80 (2), 026117-[10pp]. (doi:10.1103/PhysRevE.80.026117).

Record type: Article

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 record has no associated files available for download.

More information

Published date: August 2009

Identifiers

Local EPrints ID: 175705
URI: http://eprints.soton.ac.uk/id/eprint/175705
ISSN: 1539-3755
PURE UUID: d1881200-8f5c-4384-8499-0c3ea4e543f4
ORCID for Ben D. MacArthur: ORCID iD orcid.org/0000-0002-5396-9750
ORCID for Ruben Sanchez-Garcia: ORCID iD orcid.org/0000-0001-6479-3028

Catalogue record

Date deposited: 25 Feb 2011 14:36
Last modified: 14 Mar 2024 02:56

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×