Network Tracing Capacity as an Informational Event Horizon: A Delay-Based Causal Bound for Networked Control

In the paper's words

Distributed control systems—power-electronics clusters, vehicle platoons, coordinated robot fleets—stabilize unstable plants through communication networks, and the latency of that communication, not the control law, frequently decides whether stabilization succeeds. Existing design practice treats this as a per-application tuning problem; no topology-level invariant is known that states, in one number, which instability rates a given communication topology can and cannot propagate. We propose such an invariant, the Network Tracing Capacity (NTC), defined for a benchmark class of scalar unstable modes under delayed feedback as Θ = 1/(hτ), where h is the controller-to-sensor hop count and τ the per-hop delay, and we conjecture that modes with growth rate λ > Θ are practically unobservable through the topology, a boundary we interpret as an informational analog of a relativistic event horizon.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. This paper proposed the Network Tracing Capacity $\Theta = 1/(h\tau)$ as a topology-level bound on the instability rates a communication network can propagate for a scalar unstable mode under delayed feedback, derived the bound and its consequences with explicit arithmetic — a five-hop, 10 ms-per-hop topology yields $\Theta = 20\,\mathrm{s^{-1}}$, placing a $35\,\mathrm{s^{-1}}$ mode beyond the horizon at hop 3 of 5 with a per-delay growth factor of $e^{1.75} \approx 5.75$, while reducing the per-hop delay to 2 ms restores $\Theta = 100\,\mathrm{s^{-1}}$ — and constructed the structural mapping from (instability rate, delay, hop count) onto (expansion rate, signal speed, metric scale).

   from 8. Conclusion

2. We build the correspondence mapping (instability rate, delay, hop count) onto (expansion rate, signal speed, metric scale), anchor its operational criteria in how the Event Horizon Telescope actually detects and is limited by horizons, and derive a worked example: a five-hop network with $\tau = 10\,\mathrm{ms}$ yields $\Theta = 20\,\mathrm{s^{-1}}$, so a plant with $\lambda = 35\,\mathrm{s^{-1}}$ lies beyond the horizon at hop $3$ of $5$, with state growth factor $e^{1.75} \approx 5.75$ per delay interval.

   from Abstract

3. The Sgr A campaign itself illustrates the cost of fighting variability across a delay-limited aperture: Sgr A is highly variable, with flickering and flares on short timescales, and among known black holes it has the largest predicted angular size, approximately $50\,\mu\mathrm{as}$ [6]; the 2017 imaging relied on the best-coverage day, April 7, because April 11 showed the highest light-curve variability, rendering static imaging for that day particularly challenging [3].

   from 2. Background and Related Work

4. The two conventions differ in what plays the role of the horizon: hop-delay budget (Section 3.3) versus walk-count capacity across a cut.

   from 3.6 A complementary topology-attribute convention

5. Section 4 derives the walk-count values, and the choice of the delay-budget convention for the main text is documented on its merits in Sections 3.6 and 6.

   from 3.6 A complementary topology-attribute convention

6. The growth factor per delay drops from $e^{1.75} \approx 5.75$ to $$ e^{0.35} \approx 1.419068 \approx 1.42 . $$ Step 7: Scaling law.

   from 4. Analysis

How it is done

1. Beyond a critical product of instability rate, hop count, and per-hop delay, the loop diverges regardless of the algorithm at either end.

   from 1. Introduction

2. We adopt the same discipline: derive the bound exactly in a narrow benchmark class, state the class boundary, and treat generalization as an open question rather than an assertion.

   from 2. Background and Related Work

3. We consider the minimal object to which the conjecture can be applied without ambiguity: a scalar unstable plant mode $$ \dot{x}(t) = \lambda x(t) + u(t), \qquad \lambda \gt 0, $$ whose state $x(t)$ is measured at a sensor node and must reach a controller node across a communication topology $G$ along a path of $h$ hops, each hop imposing a deterministic transport delay $\tau$.

   from 3.1 Benchmark plant and communication model

4. The derivation requires a criterion that separates "stabilizable over the network" from "not stabilizable over the network." We adopt the following as the defining criterion of the benchmark class, stated openly as a modeling assumption rather than as established literature: Assumption A1 (delay-budget criterion).

   from 3.2 The benchmark stabilization criterion

What would falsify it

1. We do not prove a general theorem for all networked control systems; we construct the benchmark class in which the claim is derivable, derive the threshold with explicit arithmetic, and state precisely what would falsify the analogy.

   from 1. Introduction

2. We assess the analogy against the operational practice of horizon science—how the Event Horizon Telescope detects horizon-scale structure and where its inference demonstrably degrades—and state the falsification condition for the control-side claim (Sections 2, 6, and 7).

   from 1. Introduction

3. Second, the horizon-scale structure is measured to be stable across years: reanalyses of M87 across the 2017, 2018, and 2021 epochs find ring diameters of $[42.0, 46.4]\,\mu\mathrm{as}$ in 2017, $[40.7, 44.4]\,\mu\mathrm{as}$ in 2018, and $[43.1, 44.4]\,\mu\mathrm{as}$ in 2021, consistent across methods and epochs, exactly as accretion theory predicts for a geometry-set scale [5].

   from 2. Background and Related Work

Where the claim stops

1. The central claim of this paper is deliberately narrow: within a benchmark class (a scalar unstable mode, deterministic per-hop delays, no packet loss, and the delay-budget criterion of Assumption A1), a communication topology admits a single topology-level number $\Theta = 1/(h\tau)$ that separates propagatable from non-propagatable instability rates, and this threshold exhibits the operational signature of a horizon analog.

   from 6. Discussion

2. This section states what would falsify the claim, where the analogy is weakest, and which assumptions carry the result.

   from 6. Discussion

3. The main result would be falsified by a demonstration, experimental or analytical, that a scalar unstable mode with $\lambda \ge \Theta = 1/(h\tau)$ is stabilized over an $h$-hop, $\tau$-delay network by a controller that uses only the delayed measurements, under the benchmark assumptions (deterministic delays, no loss, bounded control effort).

   from 6. Discussion

Where to read

1. Abstract244 words · 1 min
2. 1. Introduction564 words · 2 min
3. 2. Background and Related Work1,070 words · 5 min
4. 3. Methods749 words · 3 min
5. 4. Analysis957 words · 4 min
6. 5. Results180 words · 1 min
7. 6. Discussion949 words · 4 min
8. 7. Practical Implications and Engineering Pathways712 words · 3 min
9. 8. Conclusion289 words · 1 min
10. Provenance and AI Involvement225 words · 1 min