On the Time Complexity of Information Dissemination via Linear Iterative Strategies

Thumbnail Image
Penn collection
Lab Papers (GRASP)
Degree type
Grant number
Copyright date
Related resources
Sundaram, Shreyas
Hadjicostis, Christoforos N

Given an arbitrary network of interconnected nodes, each with an initial value, we study the number of timesteps required for some (or all) of the nodes to gather all of the initial values via a linear iterative strategy. At each time-step in this strategy, each node in the network transmits a weighted linear combination of its previous transmission and the most recent transmissions of its neighbors. We show that for almost any choice of real-valued weights in the linear iteration (i.e., for all but a set of measure zero), the number of time-steps required for any node to accumulate all of the initial values is upper-bounded by the size of the largest tree in a certain subgraph of the network; we use this fact to show that the linear iterative strategy is time-optimal for information dissemination in certain networks. In the process of deriving our results, we also obtain a characterization of the observability index for a class of linear structured systems.

Date of presentation
Conference name
Lab Papers (GRASP)
Conference dates
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher DOI
Journal Issue
Suggested Citation: <br> Sundaram, S. and C.N. Hadjicostis. (2010). "On the Time Complexity of Information Dissemination via Linear Iterative Strategies." <em>2010 American Control Conference.</em> Baltimore, MD. June 30-July 2, 2010. <br><br> ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Recommended citation