Topology for global average consensus

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2006, Pages 276-280

  Kar, Soummya ^a   Moura, José M F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CONTROL THEORY; DETECTORS; ELECTRIC NETWORK TOPOLOGY; ITERATIVE METHODS; MILITARY DATA PROCESSING; NUMERICAL ANALYSIS; OPTIMIZATION; SENSOR NETWORKS; SENSORS; STRUCTURAL OPTIMIZATION; TOPOLOGY; TREES (MATHEMATICS);

AVERAGE CONSENSUS; COMBINATORIAL OPTIMIZATION PROBLEMS; CONVERGENCE SPEEDS; EIGENVALUES (OF GRAPHS); EXPANDER GRAPHS; GRAPH DESIGN; LAPLACIAN MATRICES; LOWER BOUNDS; NETWORK TOPOLOGIES; NUMERICAL STUDIES; OF SENSORS; OPTIMALITY; RAMANUJAN GRAPHS; RANDOM GRAPHS; SMALL WORLDS; STRUCTURED GRAPHS; TOPOLOGY OPTIMIZATION (TO);

GRAPH THEORY;

EID: 47049118895     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2006.356631     Document Type: Conference Paper

References (17)

1. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Automat. Contr., vol. 49, pp. 1520-1533, 2004.
2. S. A. Aldosari and J. M. F. Moura, "Distributed detection in sensor networks: connectivity graph and smallworld networks," Asilomar Conference on Signals, Systems, and Computers, 2005.
3. Miroslav Fiedler, "Algebraic connectivity of graphs," Czechoslovak. Mathematical Journal, vol. 23, no. 98, pp. 298-305, 1973.
4. Fan R. K. Chung, Spectral Graph Theory, American Mathematical Society, 1997.
5. M. Ram Murty, "Ramanujan graphs," J. Ramanujan Math. Soc, vol. 18, no. 1, pp. 1-20, 2003.
6. D. J. Watts and S. H. Strogatz, "Collective dynamics of small-world networks," Nature, vol. 393, pp. 440-442, 1998.
7. Jon M. Kleinberg, "Navigation in a small world," Nature, vol. 406, pp. 845, Aug. 2000.
8. Jon M. Kleinberg, "The small-world phenomenon: An algorithmic perspective," in Proc. of the thirty-second annual ACM symposium on Theory of computing, Portland, Oregon, 2000, vol. 2, pp. 63-170.
9. A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs," Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
10. Soummya Kar, S. A. Aldosari, and J. M. F. Moura, "Topology for distributed inference on graphs," Submitted, June 2006.
11. L. Xiao and S. Boyd, "Fast linear iteration for distributed averaging," Syst. Contr. Lett., vol. 53, pp. 65-78, Sept. 2004.
12. Norman Biggs, Cambridge University Press, 1993.
13. N. Alon, "Eigenvalues and expanders," Combinatorica, vol. 6, pp. 83-96, 1986.
14. G.A. Margulis, "Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators," J. Probl. Inf. Transm., vol. 24, no. 1, pp. 39-46, 1988.
15. M. Morgenstern, "Existence and explicit construction of q + 1 regular Ramanujan graphs for every prime power q," J. Comb. Theory, ser. B, vol. 62, pp. 44-62, 1994.
16. George Andrews, Shalsoh B. Ekhad, and Doron Zeilberger, "A short proof of Jacobi's formula for the number of representations of an integer as a sum of four squares," Amer. Math. Monthly, vol. 100, pp. 273-276, 1993.
17. A. Berger and J. Lafferty, "Probabilistic decoding of low-density Cayley codes," Proceedings of the Canadian Workshop on Information Theory, Toronto, Canada, 1997.