Average Consensus in the Presence of Delays in Directed Graph Topologies
By Christoforos N. Hadjicostis, Themistoklis Charalambous. 2014
171 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
Citations in the corpus
- A survey of distributed optimization (2019, methodology): “…that this algorithm can be extended to directed random graphs by using the push-sum method ( Bénézit et al., 2010; Charalambous et al., 2015; Hadjicostis & Charalambous, 2014; Kempe et al., 2003; Nedi ´c & Olshevsky, 2015 ) and the push– pull method ( Du, Yao et al., 2018; Pu et al., 2018;…”
- Asynchronous Gradient Push (2018, unknown): “Further work has provided convergence guarantees in the face of the other practical issues, such as communication delays and dropped messages [18], [19].”
- Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays (2015, background): “…weight balanced and doubly stochastic update matrices can be easily obtained, but this is significantly more challenging in directed interconnection topologies, which arise frequently in reality due to the heterogeneity of communication systems and the nonuniformity of their communication ranges.”