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

This paper studies the problem of selecting input nodes (leaders) to makenetworks strong structurally controllable despite misbehaving nodes and edges.We utilize a graph-based characterization of network strong structuralcontrollability (SSC) in terms of zero forcing in graphs, which is a dynamiccoloring of nodes. We consider three types of misbehaving nodes and edges thatdisrupt the zero forcing process in graphs, thus, deteriorating the networkSSC. Then, we examine a leader selection guaranteeing network SSC by ensuringthe accuracy of the zero forcing process, despite $k$ misbehaving nodes/edges.Our main result shows that a network is resilient to $k$ misbehavingnodes/edges under one threat model if and only if it is resilient to the samenumber of failures under the other threat models. Thus, resilience against onethreat model implies resilience against the other models. We then discuss thecomputational aspects of leader selection for resilient SSC and present anumerical evaluation.

Resilient Strong Structural Controllability in Networks using Leaky Forcing in Graphs