Distributed inference networks with costly wires

Proceedings of the 2010 American Control Conference, ACC 2010

Volumn , Issue , 2010, Pages 1053-1058

  Varshney, Lav R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

COMMUNICATION INFRASTRUCTURE; DESIGN PROBLEMS; DISTRIBUTED INFERENCE; MAINTENANCE COST; NATURAL RELAXATION; OPTIMAL NETWORK DESIGN; SMALL NETWORKS; TOPOLOGY DESIGN;

DISTRIBUTED PARAMETER CONTROL SYSTEMS;

EID: 77957819646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2010.5530757     Document Type: Conference Paper

References (48)

1. M. T. Gastner and M. E. J. Newman, "The spatial structure of networks," Eur. Phys. J. B, vol. 49, no. 2, pp. 247-252, Jan. 2006.
2. -, "Shape and efficiency in spatial distribution networks," J. Stat. Mech., vol. 2006, no. 1, pp. 247-252, Jan. 2006.
3. R. Olfati-Saber, J. A. Fax, and R. M. Murray, "Consensus and cooperation in networked multi-agent systems," Proc. IEEE, vol. 95, no. 1, pp. 215-233, Jan. 2007.
4. S. Kar, S. Aldosari, and J. M. F. Moura, "Topology for distributed inference on graphs," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2609-2613, June 2008.
5. J. Diaz, J. Petit, and M. Serna, "A survey of graph layout problems," ACM Comput. Surv., vol. 34, no. 3, pp. 313-356, Sept. 2002.
6. K. M. Hall, "An r-dimensional quadratic placement algorithm," Manage. Sci., vol. 17, no. 3, pp. 219-229, Nov. 1970.
7. D. B. Chklovskii, "Exact solution for the optimal neuronal layout problem," Neural Comput., vol. 16, no. 10, pp. 2067-2078, Oct. 2004.
8. Y. Koren, "Drawing graphs by eigenvectors: Theory and practice," Comput. Math. Appl., vol. 49, no. 11-12, pp. 1867-1888, June 2005.
9. A. J. Seary and W. D. Richards, "Spectral methods for analyzing and visualizing networks: An introduction," in Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, R. Breiger, K. Carley, and P. Pattison, Eds. Washington, DC: The National Academies Press, 2003, pp. 209-228.
10. A. A. Rad, M. Jalili, and M. Hasler, "Efficient rewirings for enhancing synchronizability of dynamical networks," Chaos, vol. 18, no. 3, p. 037104, Sept. 2008.
11. M. Barahona and L. M. Pecora, "Synchronization in small-world systems," Phys. Rev. Lett., vol. 89, no. 5, p. 054101, July 2002.
12. L. Donetti, P. I. Hurtado, and M. A. Muñoz, "Entangled networks, synchronization, and optimal network topology," Phys. Rev. Lett., vol. 95, no. 18, p. 188701, Oct. 2005.
13. B. L. Chen, D. H. Hall, and D. B. Chklovskii, "Wiring optimization can relate neuronal structure and function," Proc. Natl. Acad. Sci. U.S.A., vol. 103, no. 12, pp. 4723-4728, Mar. 2006.
14. V. A. Klyachko and C. F. Stevens, "Connectivity optimization and the positioning of cortical areas," Proc. Natl. Acad. Sci. U.S.A., vol. 100, no. 13, pp. 7937-7941, June 2003.
15. M. Kaiser and C. C. Hilgetag, "Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems," PLoS Comput. Biol., vol. 2, no. 7, p. e95, July 2006.
16. E. R. van Dam and W. H. Haemers, "Which graphs are determined by their spectrum?" Linear Algebra Appl., vol. 373, pp. 241-272, Nov. 2003.
17. W. H. Haemers and E. Spence, "Enumeration of cospectral graphs," Eur. J. Comb., vol. 25, no. 2, pp. 199-211, Feb. 2004.
18. F. M. Atay and T. Biyikoglu, "Graph operations and synchronization of complex networks," Phys. Rev. E, vol. 72, no. 1, p. 016217, July 2005.
19. N. M. M. de Abreu, "Old and new results on algebraic connectivity of graphs," Linear Algebra Appl., vol. 423, no. 1, pp. 53-73, May 2007.
20. C. Maas, "Transportation in graphs and the admittance spectrum," Discrete Appl. Math., vol. 16, no. 1, pp. 31-49, Jan. 1987.
21. F. Goldberg, "Bounding the gap between extremal Laplacian eigenvalues of graphs," Linear Algebra Appl., vol. 416, no. 1, pp. 68-74, July 2006.
22. V. Borkar and P. P. Varaiya, "Asymptotic agreement in distributed estimation," IEEE Trans. Autom. Control, vol. AC-27, no. 3, pp. 650-655, June 1982.
23. J. N. Tsitsiklis and M. Athans, "Convergence and asymptotic agreement in distributed decision problems," IEEE Trans. Autom. Control, vol. AC-29, no. 1, pp. 42-50, Jan. 1984.
24. P. F. Swaszek and P. Willett, "Parley as an approach to distributed detection," IEEE Trans. Aerosp. Electron. Syst., vol. 31, no. 1, pp. 447-457, Jan. 1995.
25. P. K. Varshney, Distributed Detection and Data Fusion. New York: Springer-Verlag, 1997.
26. T. Berger, Z. Zhang, and H. Viswanathan, "The CEO problem," IEEE Trans. Inf. Theory, vol. 42, no. 3, pp. 887-902, May 1996.
27. T. S. Han and S.-I. Amari, "Statistical inference under multiterminal data compression," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2300-2324, Oct. 1998.
28. V. Misra, V. K. Goyal, and L. R. Varshney, "High-resolution functional quantization," in Proc. Data Compression Conf. (DCC 2008), Mar. 2008, pp. 113-122.
29. A. Olshevsky and J. N. Tsitsiklis, "Convergence rates in distributed consensus and averaging," in Proc. 45th IEEE Conf. Decision Control, Dec. 2006, pp. 3387-3392.
30. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Syst. Control Lett., vol. 53, no. 1, pp. 65-78, Sept. 2004.
31. A. Ghosh and S. Boyd, "Growing well-connected graphs," in Proc. 45th IEEE Conf. Decision Control, Dec. 2006, pp. 6605-6611.
32. A. Hagberg and D. A. Schult, "Rewiring networks for synchronization," Chaos, vol. 18, no. 3, p. 037105, Sept. 2008.
33. M. Jalili and A. A. Rad, "Comment on "rewiring networks for synchronization"," Chaos, vol. 19, no. 2, p. 028101, May 2009.
34. S. Belhaiza, N. M. M. de-Abreu, P. Hansen, and C. S. Oliveira, "Variable neighborhood search for extremal graphs. XI. bounds on algebraic connectivity," in Graph Theory and Combinatorial Optimization, D. Avis, A. Hertz, and O. Marcotte, Eds. New York: Springer, 2005, pp. 1-16.
35. H. J. Landau, "Sampling, data transmission, and the Nyquist rate," Proc. IEEE, vol. 55, no. 10, pp. 1701-1706, Oct. 1967.
36. L. R. Varshney, "Optimal information storage: Nonsequential sources and neural channels," S.M. thesis, Massachusetts Institute of Technology, Cambridge, MA, June 2006.
37. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1520-1533, Sept. 2004.
38. A. Ghosh and S. Boyd, "Upper bounds on algebraic connectivity via convex optimization," Linear Algebra Appl., vol. 418, no. 2-3, pp. 693-707, Oct. 2006.
39. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman and Company, 1979.
40. D. Mosk-Aoyama, "Maximum algebraic connectivity augmentation is NP-hard," Oper. Res. Lett., vol. 36, no. 6, pp. 677-679, Nov. 2008.
41. N. J. A. Sloane, "The on-line encyclopedia of integer sequences." [Online]. Available: http://www.research.att.com/njas/ sequences.
42. L. A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures. Cambridge: Cambridge University Press, 1993.
43. L. R. Varshney, "Unreliable and resource-constrained decoding," Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, June 2010.
44. L. R. Varshney, B. L. Chen, E. Paniagua, D. H. Hall, and D. B. Chklovskii, "Structural properties of the Caenorhabditis elegans neuronal network," arXiv:0907.2373 [q-bio]., July 2009.
45. R. Marculescu and P. Bogdan, "The chip is the network: Toward a science of network-on-chip design," Found. Trends Electron. Design Autom., vol. 2, no. 4, pp. 371-461, 2009.
46. H. Konno, P. T. Thach, and H. Tuy, Optimization on Low Rank Nonconvex Structures. Dordrecht: Kluwer Academic Publishers, 1996.
47. H. Tuy, Convex Analysis and Global Optimization. Dordrecht: Kluwer Academic Publishers, 1998.
48. J.-B. Hiriart-Urruty, "Conditions for global optimality 2," J. Global Optim., vol. 13, no. 4, pp. 349-367, Dec. 1998.