English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The analysis of the dynamics on complex networks is closely connected tostructural features of the networks. Features like, for instance, graph-coresand node degrees have been studied ubiquitously. Here we introduce theD-spectrum of a network, a novel new framework that is based on a collection ofnested chains of subgraphs within the network. Graph-cores and node degrees aremerely from two particular such chains of the D-spectrum. Each chain gives riseto a ranking of nodes and, for a fixed node, the collection of these ranksprovides us with the D-spectrum of the node. Besides a node deletion algorithm,we discover a connection between the D-spectrum of a network and some fixedpoints of certain graph dynamical systems (MC systems) on the network. Usingthe D-spectrum we identify nodes of similar spreading power in thesusceptible-infectious-recovered (SIR) model on a collection of real worldnetworks as a quick application. We then discuss our results and conclude thatD-spectra represent a meaningful augmentation of graph-cores and node degrees.

D-chain tomography of networks: a new structure spectrum and an application to the SIR process