• 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 ...
    • Conference Object  

      Decentralised minimum-time average consensus in digraphs 

      Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (Institute of Electrical and Electronics Engineers Inc., 2013)
      Distributed algorithms for average consensus in directed graphs are typically asymptotic in the literature. In this work, we propose a protocol to distributively reach average consensus in a finite number of steps on ...
    • Conference Object  

      Distributed balancing of a digraph with integer weights 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2013)
      We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...
    • Article  

      Distributed cycle detection and removal 

      Oliva, G.; Setola, R.; Glielmo, L.; Hadjicostis, Christoforos N. (2018)
      In this paper, we provide distributed algorithms to detect and remove cycles in a directed relational graph by exploiting the underlying undirected communication graph; the relational graph models a relation among the ...
    • 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 ...
    • Article  

      Distributed finite-time calculation of node eccentricities, graph radius and graph diameter 

      Oliva, G.; Setola, R.; Hadjicostis, Christoforos N. (2016)
      The distributed calculation of node eccentricities, graph radius and graph diameter are fundamental steps to tune network protocols (e.g., setting an adequate time-to-live of packets), to select cluster heads, or to execute ...
    • Conference Object  

      Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems 

      Charalambous, T.; Hadjicostis, Christoforos N. (2013)
      We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...
    • Article  

      Distributed matrix scaling and application to average consensus in directed graphs 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2013)
      We propose a class of distributed iterative algorithms that enable the asymptotic scaling of a primitive column stochastic matrix, with a given sparsity structure, to a doubly stochastic form. We also demonstrate the ...
    • Conference Object  

      Distributed minimum-time weight balancing over digraphs 

      Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (IEEE Computer Society, 2014)
      We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...
    • Conference Object  

      Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs 

      Shames, I.; Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (2012)
      Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous distributed algorithms, based on ...
    • Article  

      Distributed resource coordination in networked systems described by digraphs 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2015)
      We consider a multicomponent system in which each component can receive/transmit information from/to components in its immediate neighborhood. Communication links between components are not required to be bidirectional, ...
    • Conference Object  

      Distributed stopping for average consensus in directed graphs via a randomized event-triggered strategy 

      Manitara, N. E.; Hadjicostis, Christoforos N. (IEEE Computer Society, 2014)
      We consider how an iterative strategy for asymptotic average consensus in a directed graph (digraph) can be adapted so that the nodes can determine, in a distributed manner, a stopping criterion that allows them to terminate ...
    • Conference Object  

      Distributed stopping for average consensus using double linear iterative strategies 

      Manitara, N. E.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2014)
      We consider how double linear iterative strategies for asymptotic average consensus can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate (in finite ...
    • Conference Object  

      Distributed strategies for average consensus in directed graphs 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2011)
      We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology ...
    • Conference Object  

      Distributed strategies for balancing a weighted digraph 

      Hadjicostis, Christoforos N.; Rikos, A. (2012)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
    • Article  

      Distributed weight balancing over digraphs 

      Rikos, A. I.; Charalambous, T.; Hadjicostis, Christoforos N. (2014)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
    • 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 ...
    • Conference Object  

      Resilient average consensus in the presence of heterogeneous packet dropping links 

      Hadjicostis, Christoforos N.; Domínguez-Garcia, A. D.; Vaidya, N. H. (2012)
      We address the average-consensus problem for a distributed system whose components (nodes) can exchange information via unreliable interconnections (edges) that form an arbitrary, possibly directed topology (digraph). We ...
    • 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, ...