Lower bounds on the estimation error in problems of distributed computation
Information-theoretic lower bounds on the estimation error are derived for problems of distributed computation. These bounds hold for a network attempting to compute a real-vector-valued function of the global information, when the nodes have access to partial information and can communicate through...
Main Authors: | Como, Giacomo, Dahleh, Munther A. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/58983 https://orcid.org/0000-0002-1470-2148 |
Similar Items
-
On resilience of distributed routing in networks under cascade dynamics
by: Savla, Ketan, et al.
Published: (2015) -
Robust Network Routing under Cascading Failures
by: Savla, Ketan, et al.
Published: (2015) -
Robust Network Routing under Cascading Failures
by: Savla, Ketan, et al.
Published: (2021) -
Robust distributed routing in dynamical flow networks
by: Como, Giacomo, et al.
Published: (2013) -
Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
by: Ayaso, Ola, et al.
Published: (2011)