Browsing by Subject "Digraphs"

Now showing items 1-4 of 4

    • Article  

      Average consensus in the presence of delays in directed graph topologies 

      Hadjicostis, Christoforos N.; Charalambous, T. (2014)
      Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not ...
    • Article  

      Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays 

      Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (2015)
      Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...
    • Conference Object  

      Integer weight balancing in directed graphs in the presence of communication delays 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2015)
      A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important ...
    • Article  

      Robust Distributed Average Consensus via Exchange of Running Sums 

      Hadjicostis, Christoforos N.; Vaidya, N. H.; Domínguez-Garcia, A. D. (2016)
      We consider a multi-component system in which each component (node) can send/receive information to/from sets of neighboring nodes via communication links (edges) that form a fixed strongly connected, possibly directed, ...