dc.contributor.author | Sundaram, S. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.creator | Sundaram, S. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.date.accessioned | 2019-04-08T07:48:23Z | |
dc.date.available | 2019-04-08T07:48:23Z | |
dc.date.issued | 2010 | |
dc.identifier.isbn | 978-1-4244-7426-4 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/44909 | |
dc.description.abstract | Given an arbitrary network of interconnected nodes, each with an initial value, we study the number of time-steps 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. © 2010 AACC. | en |
dc.source | Proceedings of the 2010 American Control Conference, ACC 2010 | en |
dc.source | Proceedings of the 2010 American Control Conference, ACC 2010 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-77957790343&partnerID=40&md5=43f26e0c9b1ee7630ddf3385b89e675c | |
dc.subject | Information dissemination | en |
dc.subject | Interconnected nodes | en |
dc.subject | Observability | en |
dc.subject | Linear combinations | en |
dc.subject | Linear iteration | en |
dc.subject | Initial values | en |
dc.subject | Iterative strategy | en |
dc.subject | Time complexity | en |
dc.subject | Structured systems | en |
dc.subject | Arbitrary networks | en |
dc.subject | Subgraphs | en |
dc.subject | Time step | en |
dc.subject | Time-optimal | en |
dc.title | On the time complexity of information dissemination via linear iterative strategies | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.description.startingpage | 6789 | |
dc.description.endingpage | 6794 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Conference Object | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |