Iterative approximate Byzantine consensus in arbitrary directed graphs
From MaRDI portal
Abstract: In this paper, we explore the problem of iterative approximate Byzantine consensus in arbitrary directed graphs. In particular, we prove a necessary and sufficient condition for the existence of iterative byzantine consensus algorithms. Additionally, we use our sufficient condition to examine whether such algorithms exist for some specific graphs.
Recommendations
- Reaching approximate Byzantine consensus with multi-hop communication
- Iterative approximate Byzantine consensus under a generalized fault model
- Reaching approximate Byzantine consensus with multi-hop communication
- Fault-tolerant consensus in directed graphs
- An improved approximate consensus algorithm in the presence of mobile faults
Cited in
(35)- Spectral and structural properties of random interdependent networks
- Resilience against misbehaving nodes in asynchronous networks
- Approximate agreement under mobile Byzantine faults
- Reaching approximate Byzantine consensus with multi-hop communication
- Resilient self/event-triggered consensus based on ternary control
- Resilient output regulation in heterogeneous networked systems under Byzantine agents
- Resilient multi-dimensional consensus in adversarial environment
- Multi-armed bandit based distributed resilient consensus and its applications in social networks
- Resilient consensus for multi-agent systems subject to differential privacy requirements
- Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
- Defending non-Bayesian learning against adversarial attacks
- Resilient consensus of second-order agent networks: asynchronous update rules with delays
- Broadcast using certified propagation algorithm in presence of Byzantine faults
- Secure consensus with distributed detection via two-hop communication
- Resilient coordinated movement of connected autonomous vehicles
- Fault-tolerant consensus in directed graphs
- Recent results on fault-tolerant consensus in message-passing networks
- Consensus algorithm with censored data for distributed detection with corrupted measurements: a game-theoretic approach
- Constant-Space Localized Byzantine Consensus
- Consensus of second-order multi-agent systems in the presence of locally bounded faults
- Network topology and fault-tolerant consensus
- Resilient group consensus in the presence of Byzantine agents
- An improved approximate consensus algorithm in the presence of mobile faults
- Effects of topology knowledge and relay depth on asynchronous appoximate consensus
- Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
- Reaching approximate Byzantine consensus with multi-hop communication
- Iterative approximate Byzantine consensus under a generalized fault model
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- Bipartite Byzantine‐resilient event‐triggered consensus control of heterogeneous multi‐agent systems
- Byzantine-resilient distributed observers for LTI systems
- Finite-time error bounds for distributed linear stochastic approximation
- Resilient distributed averaging: adversary detection and topological insights
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions
- Resilient and privacy-preserving consensus for multi-agent systems
This page was built for publication: Iterative approximate Byzantine consensus in arbitrary directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933813)
