A Notion of Robustness in Complex Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We consider a graph-theoretic property known as r-robustness which plays a key role in a class of consensus (or opinion) dynamics where each node ignores its most extreme neighbors when updating its state. Previous work has shown that if the graph is r-robust for sufficiently large r, then such dynamics will lead to consensus even when some nodes behave in an adversarial manner. The property of r-robustness also guarantees that the network will remain connected even if a certain number of nodes are removed from the neighborhood of every node in the network and thus it is a stronger indicator of structural robustness than the traditional metric of graph connectivity. In this paper, we study this notion of robustness in common random graph models for complex networks; we show that the properties of robustness and connectivity share the same threshold function in Erdös-Rényi graphs, and have the same values in 1-D geometric graphs and certain preferential attachment networks. This provides new insights into the structure of such networks, and shows that they will be conducive to the types of dynamics described before. Although the aforementioned random graphs are inherently robust, we also show that it is coNP-complete to determine whether any given graph is robust to a specified extent.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it