arXiv (All)
open access
Minimal Construction of Graphs with Maximum Robustness
The notions of $r$-robustness and $(r,s)$-robustness of a network have been earlier introduced in the literature to achieve resilient consensus in the presence of misbehaving agents. However, while higher robustness levels enable networks to tolerate a higher number of misbehaving agents, they also
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Robustness across the Structure of Sub-Networks: The Contrast between Infection and Information Dynamics#737850
- Investigating the analytical robustness of the social and behavioural sciences#675915
- A Multiverse of Good and Bad Controls: Candidate Causal Graphs for Interpreting Model Robustness Analysis#1122636
- The resilience of logistics network against node failures#257556
- On Assessing ML Model Robustness: A Methodological Framework (Academic Track)#6579
Record · ID 971697
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive