Rewire-Robustness in Networks and Protocols

• Rewire-robustness is a family of concepts examining how controlled wiring modifications preserve, alter, or enhance key system properties such as connectivity and consensus.
• It employs diverse strategies—like degree-preserving swaps, bypass rewiring, and adaptive network modifications—that impact robustness measures and structural invariants.
• These methodologies extend to improving network resilience, graph machine learning fidelity, reactive reinforcement learning stability, and protocol correctness under topology changes.

Rewire-robustness denotes a family of technical notions concerned with how controlled changes in wiring alter, preserve, or improve a system’s salient properties. In the literature surveyed here, the phrase covers graph-theoretic robustness under degree-preserving edge swaps and bypass rewiring, resilience guarantees for consensus on parameterized digraphs, the vulnerability or invariance of network measures under strategic local rewiring, structural fidelity in graph rewiring for GNNs, a structural assumption for reactive reinforcement learning under hard state aggregation, and the persistence or collapse of functional markers under architectural lesions in synthetic agents (Usevitch et al., 2017, Waniek et al., 2023, Benoit et al., 23 Oct 2025, Eberhard et al., 27 May 2026, Phua, 22 Dec 2025). A plausible common denominator is robustness with respect to topology modification, whether the protected object is connectivity, consensus, centrality, policy optimality, or a theory-motivated functional signature.

1. Scope and recurring formal pattern

Across these works, “rewiring” is not a single operation. It can mean degree-preserving edge swaps that keep node degrees fixed while changing connectivity patterns, as in “Smart Rewiring for Network Robustness” (Louzada et al., 2013); pairing the incident links of a removed node, as in bypass rewiring (Park et al., 2016, Park et al., 2017); deleting only edges incident to a designated group in order to hide from group centrality measures (Waniek et al., 2023); increasing or decreasing the connection parameter $k$ in a $k$-circulant digraph (Usevitch et al., 2017); altering edge sets to mitigate over-squashing in GNNs while tracking structural invariants (Benoit et al., 23 Oct 2025); or changing only the “entrance wiring” into feature aggregates in a partially observable RL environment (Eberhard et al., 27 May 2026).

The protected object likewise varies. In attack-resilience studies it is usually the size of the largest connected component or the percolation threshold (Louzada et al., 2013, Park et al., 2016). In resilient consensus it is $r$-robustness or $(r,s)$-robustness, which serve as sufficient conditions for W‑MSR under malicious or Byzantine behavior (Usevitch et al., 2017). In adversarial network analytics it is the stability of centrality scores under local edge deletions (Waniek et al., 2023). In graph ML it is “structural fidelity,” operationalized through invariance of graph metrics under rewiring (Benoit et al., 23 Oct 2025). In RL it is invariance of the optimal reactive policy under a class of environment rewiring operations (Eberhard et al., 27 May 2026). In synthetic neuro-phenomenology it is the survival of access, metacognitive, or perturbational markers under lesions or latent perturbations (Phua, 22 Dec 2025).

A recurring distinction is between robustness to rewiring and robustness by rewiring. Some papers study how rewiring makes a system more robust to failures or attacks (Louzada et al., 2013, Park et al., 2016). Others ask whether a metric or policy remains valid when the underlying wiring changes (Waniek et al., 2023, Eberhard et al., 27 May 2026). Still others ask which structural properties should remain approximately invariant when rewiring is used as an optimization tool (Benoit et al., 23 Oct 2025).

2. Connectivity robustness by rewiring

In network-science work on attack tolerance, rewiring is often a design intervention applied to an already given topology. “Smart Rewiring for Network Robustness” defines robustness by the normalized area under the largest-connected-component curve under sequential degree-targeted attack,

$$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$

and proposes a degree-preserving local swap built around a node $i$, its lowest-degree neighbor $j$, its highest-degree neighbor $k$, and neighbors $m$ of $j$ and $k$0 of $k$1 (Louzada et al., 2013). The swap removes $k$2 and $k$3, adds $k$4 and $k$5, and is accepted only if $k$6 increases. On the World Air-transportation network, an improvement of $k$7 in overall robustness is achieved through smart swaps of around $k$8 of its links, and the resulting topology is described as a “modular onion structure” with higher assortativity and onionlikeness (Louzada et al., 2013).

“A loop enhancement strategy for network robustness” shifts the design target from degree-degree correlations to loops, using a BP-based approximation of the Feedback Vertex Set and defining robustness under high-degree adaptive attack through

$k$9

Its central empirical claim is that robustness is strongly related to loops more than degree-degree correlations, and that reducing the gap between the maximum and minimum degrees significantly improves robustness (Chujyo et al., 2020). In the preserving regime, the BP Preserving method slightly exceeds the WuHolme assortative baseline on OpenFlights; in the non-preserving regime, $r$0 reaches about $r$1–$r$2, with $r$3 exceeding $r$4 nodes on a $r$5-node airline network (Chujyo et al., 2020).

A complementary line studies how rewiring toward modular structure changes the failure mode itself. “Modularity affects the robustness of scale-free model and real-world social networks under betweenness and degree-based node attack” rewires inter-module edges into intra-module edges with probability $r$6, preserving the BA degree distribution in expectation while increasing the intra/inter ratio

$r$7

It finds that higher level of modularity decreases model network robustness under both attack strategies, that degree-based attack is more effective in low-modularity BA networks, and that betweenness-based attack becomes clearly the most effective when modularity is high (Nguyen et al., 2020). In the model, the transition from smooth to abrupt fragmentation appears around $r$8, corresponding to $r$9 for $(r,s)$0 modules (Nguyen et al., 2020).

The restoration literature treats rewiring as a repair mechanism after fragmentation rather than a pre-attack design tool. “Novel Rewiring Mechanism for Restoration of the Fragmented Social Networks after Attacks” evaluates both the normalized LCC size

$(r,s)$1

and the Laplacian Energy

$(r,s)$2

to capture not only connectedness but also how sparse the restored graph remains (Kumar et al., 22 May 2025). Its strategic rewiring and budget-constrained optimal rewiring reconnect attacked Erdős–Rényi, power-law, and email networks, with full restoration often using roughly $(r,s)$3–$(r,s)$4 of the original edges; for the Email-univ network, restoration uses $(r,s)$5 edges, or about $(r,s)$6 of the original $(r,s)$7 (Kumar et al., 22 May 2025).

Bypass rewiring studies examine a different local intervention: directly connect each pair of links of the removed node. “Bypass rewiring and robustness of complex networks” proves that random bypass rewiring always improves or preserves giant-component size relative to no bypass, and that on an even degree infinite network it makes the percolation threshold $(r,s)$8 for arbitrary occupation probabilities (Park et al., 2016). “Bypass rewiring and extreme robustness of Eulerian networks” generalizes this to directed networks and shows that random bypass rewiring makes infinite directed random networks extremely robust for arbitrary occupation probabilities if and only if in-degree of every node except a fixed number of nodes is equal to the out-degree; equivalently, finite networks are extremely robust for every combination of removed nodes exactly when they contain a strongly connected spanning subnetwork with an Eulerian path or cycle (Park et al., 2017). This yields a sharp structural criterion for extreme rewire-enabled robustness.

3. Rewiring-driven phase behavior in adaptive network models

In adaptive-network dynamics, rewiring is itself part of the stochastic process. “Evolving Voter Model on Dense Random Graphs” studies a two-opinion evolving voter model in which a disagreeing edge is rewired with probability $(r,s)$9 and used for a voter step with probability $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$0 (Basu et al., 2015). It proves a phase transition in $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$1: for $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$2 sufficiently small, with high probability the network rapidly splits into two disconnected communities with opposing opinions, whereas for $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$3 large enough the dynamics runs for longer and the density of opinion changes significantly before the process stops; in the rewire-to-random model, a positive fraction of both opinions survive with high probability (Basu et al., 2015). In this setting, rewiring robustly preserves coexistence in one regime and rapidly produces segregation in another.

“Local Symmetry and Global Structure in Adaptive Voter Models” adds mutation, making the process ergodic, and derives a second-order moment-closure approximation for binary-state rewire-to-random and rewire-to-same variants (Chodrow et al., 2018). The model exhibits a phase transition from a fully-fragmented regime of “echo-chambers” to a regime of persistent disagreement governed by low-dimensional quasistable manifolds. The resulting scheme predicts the location of the phase transition and the active edge density in the regime of persistent disagreement across the entire space of parameters and opinion densities; numerically, the results are nearly exact for the rewire-to-random model, and competitive for the rewire-to-same model (Chodrow et al., 2018). A notable structural difference is that $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$4 depends on opinion density in rewire-to-random but is independent of opinion density in rewire-to-same, reflecting how homophilic rewiring alters robustness of the global phase portrait (Chodrow et al., 2018).

“Robust criticality of Ising model on rewired directed networks” studies an Ising ferromagnet on a directed network where each site has constant out-degree $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$5, and rewiring selects new neighbors with probability proportional to their current in-degree (Lipowski et al., 2015). Without rewiring, the model is described by a simple mean-field-like equation with a single critical point at $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$6. With rewiring, the mean-field equation is obeyed only at low temperatures; at higher temperatures, rewiring leads to strong heterogeneities, apparently invalidates mean-field arguments, and induces large fluctuations and divergent susceptibility (Lipowski et al., 2015). The mechanism is the formation of a relatively small core of agents which influence the entire system; numerically, the core size scales approximately as $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$7, and the susceptibility scales as $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$8 for $$R = \frac{1}{N}\sum_{p=1}^{N} S\!\left(\frac{p}{N}\right),$$9, with reported exponents between about $i$0 and $i$1 (Lipowski et al., 2015). Here rewiring generates a critical-like phase rather than merely moving a critical point.

4. Robustness, manipulability, and structural fidelity of graph measures

A different use of rewire-robustness concerns whether network measures can withstand strategic topology changes by the measured nodes themselves. “Network Members Can Hide from Group Centrality Measures” studies degree, closeness, betweenness, and GED-walk group centrality under a model where a group $i$2 may remove only edges incident to $i$3, subject to a budget $i$4 (Waniek et al., 2023). The paper proves informally that adding edges incident to $i$5 can only increase all four considered centralities, so hiding is modeled solely via deletions. The decision problem Group Hiding is polynomial-time for degree group centrality via Algorithm 1, NP-complete for closeness, NP-complete for betweenness, and Minimum Group Hiding is APX-hard for betweenness (Waniek et al., 2023). Yet the empirical result is that an optimal way to hide from degree group centrality is also effective in practice against the other measures, often achieving between $i$6 and $i$7 of the optimal decrease in centrality on small graphs (Waniek et al., 2023). The broader conclusion is that current group centrality measures are not rewire-robust in realistic adversarial scenarios.

In graph machine learning, the problem is inverted: rewiring is used deliberately to improve information flow, and the question becomes which graph properties should remain invariant. “Structural Invariance Matters: Rethinking Graph Rewiring through Graph Metrics” frames this through structural invariance and structural fidelity, operationalized in the GRASP framework by measuring structural metrics on original and rewired graphs, quantifying metric changes, and correlating them with GCN accuracy (Benoit et al., 23 Oct 2025). The paper studies seven rewiring strategies—DiffWire, SDRF, GTR, BORF, FOSR, LASER, and PPR/DIGL-type methods—and evaluates diameter, effective graph resistance, spectral gap $i$8, Forman curvature, average betweenness centrality, modularity, degree assortativity, clustering coefficient, Jaccard edge similarity, Laplacian spectrum distance, adjacency spectral norm difference, degree-distribution $i$9, and shortest-path $j$0 (Benoit et al., 23 Oct 2025). The central empirical pattern is that successful rewiring methods tend to preserve local structure while allowing significant changes in global connectivity metrics (Benoit et al., 23 Oct 2025). SDRF typically keeps degree distribution and assortativity close to original values, whereas LASER can create almost fully connected graphs on small datasets, driving clustering coefficient to about $j$1 and modularity to about $j$2 while still achieving high accuracy (Benoit et al., 23 Oct 2025). This yields an explicitly metric-based notion of rewire-robustness: preserve local structural context, improve bottleneck-related global metrics.

5. Formal invariance notions in consensus, reinforcement learning, and protocol analysis

In resilient consensus, rewiring robustness appears as a graph-theoretic design problem. “$j$3-Robustness and $j$4-Robustness of Circulant Graphs” defines $j$5-reachability, $j$6-robustness, and $j$7-robustness for directed graphs, and studies the family $j$8 (Usevitch et al., 2017). The main theorem states that the circulant digraph $j$9 is $k$0-robust for $k$1, and the graph is complete for $k$2, with robustness $k$3 (Usevitch et al., 2017). The same paper links these thresholds to W‑MSR under malicious and Byzantine adversaries: $k$4-robustness is sufficient for $k$5-local malicious or Byzantine adversaries, and $k$6-robustness is necessary and sufficient for $k$7 total malicious adversaries (Usevitch et al., 2017). Because the topology is determined by the single parameter $k$8, changing $k$9 functions as a global rewiring rule with analytically transparent robustness consequences.

In reactive RL, the term is formalized as an invariance assumption on aggregated environments. “Commit to the Bit: Reactive Reinforcement Learning Done Right” defines a rewiring of an environment $m$0 as a modified environment $m$1 that preserves feature-level initial distribution, feature-level transitions, and intra-feature dynamics, while requiring each new entrance space $m$2 to satisfy $m$3 (Eberhard et al., 27 May 2026). An environment is rewire-robust if any optimal reactive policy of any rewiring of $m$4 is also optimal in $m$5; generalized rewire-robustness drops the entrance-space restriction and is stronger (Eberhard et al., 27 May 2026). The paper proves that $m$6-realizable implies generalized rewire-robust, generalized rewire-robust implies rewire-robust, quasi-Markov implies rewire-robust, and rewire-robust implies $m$7-rewire-robust (Eberhard et al., 27 May 2026). This assumption is strictly weaker than $m$8-realizability and is sufficient, through the $m$9-rewiring construction and quasi-Markov environments, to prove almost-sure convergence of Committed Q-learning to the optimal reactive policy (Eberhard et al., 27 May 2026). The corridor and T-maze examples show that whether rewire-robustness holds depends as much on the feature map $j$0 as on the underlying MDP (Eberhard et al., 27 May 2026).

A protocol-theoretic use appears in “Formal Analysis of V2X Revocation Protocols,” which studies the REWIRE family of revocation schemes for pseudonymous vehicular networks (Whitefield et al., 2017). Formal analysis in TAMARIN shows that REWIRE BASIC fails functional correctness under pseudonym change, while REWIRE RTOKEN fixes that functional issue but allows spoofed revocation confirmations because the Revocation Authority cannot verify the authenticity of sr-conf without resolving long-term identity (Whitefield et al., 2017). OTOKEN repairs this by introducing an additional key-pair per pseudonym, allowing the RA to verify confirmation without resolving the long-term identity; in the paper’s summary table, OTOKEN satisfies the listed executability, agreement, synchronisation, and revoke-after-change properties (Whitefield et al., 2017). In this domain, rewire-robustness is not graph-theoretic but protocol-correctness under identity rewiring induced by pseudonym changes.

6. Functional robustness under lesions and perturbations

A recent usage concerns whether theory-motivated functional markers survive architectural rewiring in synthetic agents. “Can We Test Consciousness Theories on AI? Ablations, Markers, and Robustness” performs three manipulations: a no-rewire Self-Model lesion, workspace capacity ablations, and latent perturbations (Phua, 22 Dec 2025). In Experiment 1, the Self-Model latent $j$1 is zeroed post-training while the policy continues to read from the workspace. The result is a synthetic blindsight analogue: metacognitive calibration collapses, with Type-2 AUROC dropping from about $j$2 to $j$3, while first-order accuracy remains essentially unchanged at about $j$4 versus $j$5 (Phua, 22 Dec 2025). This isolates a HOT-style marker that is not robust to removing the higher-order pathway.

Experiment 2 ablates global workspace capacity by varying the number of slots $j$6. A complete workspace lesion $j$7 produces qualitative collapse in access-related markers, while partial reductions show graded degradation (Phua, 22 Dec 2025). In the dual-task setup, conjunction accuracy is about $j$8 at full capacity $j$9, about $k$00 at reduced capacity $k$01, and $k$02 with bus-off $k$03 (Phua, 22 Dec 2025). Global Broadcast Index and ignition sharpness likewise collapse at $k$04. This yields a lesion-based notion of rewire-robustness: moderate capacity reduction is tolerated, full removal is not.

Experiment 3 studies latent perturbations and identifies a broadcast-amplification effect: GWT-style broadcasting amplifies internal noise, creating extreme fragility (Phua, 22 Dec 2025). The B1 family is fragile, with $k$05 around $k$06, whereas the B2 family remains robust to the same latent perturbation with $k$07; this robustness persists in a Self-Model-off / workspace-read control (Phua, 22 Dec 2025). The paper also reports an explicit negative result: raw PCI-A decreases under the workspace bottleneck, cautioning against naive transfer of IIT-adjacent proxies to engineered agents (Phua, 22 Dec 2025). A plausible implication is that robust architectural design in this setting is layered rather than monolithic: GWT provides broadcast capacity, while HOT provides quality control.

Taken together, these literatures show that rewire-robustness is best understood as a family resemblance rather than a single invariant definition. In some settings it means that carefully chosen rewiring makes connectivity or consensus more resilient; in others it means that a metric, policy, or marker remains stable under topology modification; in still others it means that rewiring should improve a target property while preserving structural context. The common technical question is always the same: which properties survive, improve, or fail when the wiring is changed?