A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs
2012
2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
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 ratio consensus, that can be used to accurately estimate the number of nodes in a multi-component system whose communication topology is described by a directed graph. In addition, we describe an asynchronous distributed algorithm that allows each node to introduce or
doi:10.1109/allerton.2012.6483452
dblp:conf/allerton/ShamesCHJ12
fatcat:zi2qk3xav5bdvnfzo2ufsdvtoy