Synchronization in complex networks of nonlinear dynamical systems

Synchronization in Complex Networks of Nonlinear Dynamical Systems

Volumn , Issue , 2007, Pages 1-155

  Wu, Chai Wah ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967425418     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/6570     Document Type: Book

References (150)

1. Agaev, R. and Chebotarev, P. (2005). On the spectra of nonsymmetric Laplacian matrices, Linear Algebra and Its Applications, 399, pp. 157-168.
2. Aiello, W., Chung, F. and Lu, L. (2001). A random graph model for power law graphs, Experimental Mathematics, 10, 1, pp. 53-66.
3. 1, isoperimetric inequalities for graphs, and superconcentrators, Journal of Combinatorial Theory, Series B, 38, pp. 73-88.
4. Alon, N. and Spencer, J. (2000). The Probabilistic Method, 2nd ed. (Wiley).
5. Alsedà, L., Llibre, J., Misiurewicz, M. and Tresser, C. (1989). Periods and entropy for Lorenz-like maps, Ann. Inst. Fourier (Grenoble), 39, 4, pp. 929-952.
6. Amano, M., Luo, Z.-W. and Hosoe, S. (2003). Graph dependant sufficient conditions for synchronization of dynamic network system with time-delay, in Proceedings of 4th IFAC Workshop on Time Delay Systems (TDS '03).
7. Anthonisse, J. M. and Tijms, H. (1977). Exponential convergence of products of stochastic matrices, Journal of Mathematical Analysis and Applications, 59, pp. 360-364.
8. Artés, J. C., Grünbaum, B. and Llibre, J. (1997). On the invariant straight lines of polynomial differential systems, Differential Equations Dynam. Systems 5, 3-4, pp. 317-327.
9. Atay, F. M., Biyikoğlu, T. and Jost, J. (2006). Synchronization of networks with prescribed degree distributions, IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, 53, 1, pp. 92-98.
10. Balmforth, N., Tresser, C., Worfolk, P. and Wu, C. W. (1997). Master-slave synchronization and the Lorenz equations, Chaos, 7, 3, pp. 392-394.
11. Banavar, J., Maritan, A. and Rinaldo, A. (1999). Size and form in efficient transportation networks, Nature, 399, pp. 130-132.
12. Bapat, R. B., Grossman, J. W. and Kulkarni, D. M. (1999). Generalized matrix tree theorem for mixed graphs, Linear and Multilinear Algebra, 46, pp. 299-312.
13. Barabási, A.-L. and Albert, R. (1999). Emergence of scaling in random networks, Science, 286, 5439, pp. 509-512.
14. Barabási, A.-L., Albert, R. and Jeong, H. (2000). Scale-free characteristics of random networks: the topology of the world wide web, Physica A, 281, pp. 69-77.
15. Barahona, M. and Pecora, L. M. (2002). Synchronization in small-world systems, Physical Review Letters 89, 5, p. 054101.
16. Belykh, I. V., Belykh, V. N. and Hasler, M. (2004a). Blinking model and synchronization in small-world networks with a time-varying coupling, Physica D 195, pp. 188-206.
17. Belykh, V. N., Belykh, I. V. and Hasler, M. (2004b). Connection graph stability method for synchronized coupled chaotic systems, Physica D 195, pp. 159-187.
18. Bennett, M., Schatz, M. F., Rockwood, H. and Wiesenfeld, K. (2002). Huygens’s clocks, Proceedings of the Royal Society A, 458, 2019, pp. 563-579.
19. Bolla, M. (1993). Spectra, euclidean representations and clusterings of hypergraphs, Discrete Mathematics, 117, pp. 19-39.
20. Bollobás, B. (1988). The isoperimetric number of random regular graphs, European Journal of Combinatorics, 9, pp. 241-244.
21. Bollobás, B. (2001). Random Graphs, 2nd ed. (Cambridge University Press).
22. Bollobás, B. and Riordan, O. M. (2004). Mathematical results on scale-free random graphs, in S. Bornholdt and H. G. Schuster (eds.), Handbook of Graphs and Networks, chap. 1 (Wiley-VCH), pp. 1-34.
23. Boppana, R. B. (1987). Eigenvalues and graph bisection: an average case analysis, in 28th IEEE Annual Symposium on the Foundations of Computer Science, pp. 280-285.
24. Borchers, B. (1999). CSDP: a C library for semidefinite programming, Optimization methods and Software 11(1), pp. 613-623, http://www.nmt.edu/~borchers/csdp.html.
25. Braess, D. (1968). Über ein paradoxon aus der verkehrsplanung, Unternehmensforschung 12, pp. 258-268, English translation in Transportation Science, vol. 39, pages 446-450, 2005.
26. Bru, R., Elsner, L. and Neumann, M. (1994). Convergence of infinite products of matrices and inner-outer iteration schemes, Electronic Transactions on Numerical Analysis, 2, pp. 183-193.
27. Brualdi, R. A. and Ryser, H. J. (1991). Combinatorial Matrix Theory (Cambridge University Press).
28. Cao, M., Morse, A. S. and Anderson, B. D. O. (2005). Coordination of an asynchronous multi-agent system via averaging, in Proceedings of 2005 IFAC conference.
29. Cao, M. and Wu, C. W. (2007). Topology design for fast convergence of network consensus algorithms, in Proceedings of IEEE International Symposium on Circuits and Systems.
30. Casselman, B. (2004). Networks, Notices of the American Mathematical Society, 51, 4, pp. 392-393.
31. Chaté, H. and Manneville, P. (1992). Collective behaviors in coupled map lattices with local and nonlocal connections, Chaos, 2, 3, pp. 307-313.
32. Chatterjee, S. and Seneta, E. (1977). Towards consensus: some convergence theorems on repeated averaging, Journal of Applied Probability, 14, pp. 89-97.
33. Chua, L. O. and Green, D. N. (1976). A qualitative analysis of the behavior of dynamic nonlinear networks: Stability of autonomous networks, IEEE Transactions on Circuits and Systems, 23, 6, pp. 355-379.
34. Chung, F. and Lu, L. (2002). Connected components in a random graph with given degree sequences, Annals of combinatorics, 6, pp. 125-145.
35. Chung, F. R. K., Faber, V. and Manteuffel, T. A. (1994). An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian, SIAM Journal on Discrete Mathematics, 7, 3, pp. 443-457.
36. Chung, F. R. K., Graham, R. L. and Yau, S.-T. (1996). On sampling with Markov chains, Random Structures and Algorithms 9, 1-2, pp. 55-77.
37. Coppersmith, D. and Wu, C. W. (2005). Conditions for weak ergodicity of inhomogeneous Markov chains, Research Report 23489, IBM.
38. Dall, J. and Christensen, M. (2002). Random geometric graphs, Physical Review E 66, p. 016121.
39. de Solla Price, D. J. (1965). Networks of scientific papers, Science, 149, pp. 510-515.
40. de Solla Price, D. J. (1976). A general theory of bibliometric and other cumulative advantage processes, J. Amer. Soc. Inform. Sci., 27, pp. 292-306.
41. DeGroot, M. H. (1974). Reaching a consensus, Journal of the American Statistical Association, 69, 345, pp. 118-121.
42. Desplanques, J. (1887). Théorème d’algébre, J. de Math. Spec., 9, pp. 12-13.
43. Dmitriev, N. and Dynkin, E. (1945). On the characteristic numbers of stochastic matrices, Dokl. Akad. Nauk USSR 49, pp. 159-162, in Russian.
44. Ellis, R. B., Martin, J. L. and Yan, C. (2006). Random geometric graph diameter in the unit ball, Algorithmica To appear.
45. Erdös, P. and Gallai, T. (1960). Graphs with prescribed degrees of vertices, Mat. Lapok, 11, pp. 264-274.
46. Erdös, P. and Graham, R. L. (1972). On sums of Fibonacci numbers, Fibonacci Quarterly, 10, 3, pp. 249-254.
47. Erdös, P. and Grünbaum, B. (1973). Osculation vertices in arrangements of curves, Geometriae Dedicata, 1, 3, pp. 322-333.
48. Erdös, P. and Renyi, A. (1959). On random graphs I, Publicationes, Mathematicae, 6, pp. 290-297.
49. Fang, L. and Antsaklis, P. (2005). On communication requirements for multiagent consensus seeking, in 2005 Workshop on Networked Embedded Sensing and Control.
50. Fax, J. A. (2002). Optimal and Cooperative Control of Vehicle Formations, Ph.D. thesis, California Institute of Technology.
51. Fiedler, M. (1972). Bounds for eigenvalues of doubly stochastic matrices, Linear Algebra and Its Applications, 5, pp. 299-310.
52. Fiedler, M. (1973). Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, 23, 98, pp. 298-305.
53. Friedman, J., Kahn, J. and Szemerédi, E. (1989). On the second eigenvalue in random regular graphs, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 587-598.
54. Fujisaka, H. and Yamada, T. (1983). Stability theory of synchronized motion in coupled-oscillator systems, Progress of Theoretical Physics, 69, 1, pp. 32-47.
55. Füredi, Z. and Komlós, J. (1981). The eigenvalues of random symmetric matrices, Combinatorica, 1, pp. 233-241.
56. Gantmacher, F. R. (1960). The Theory of Matrices, vol. 1 (Chelsea Publishing Company, New York).
57. Geršgorin, S. A. (1931). Über die abgrenzung der eigenwerte einer matrix, Izv. Akad. Nauk. USSR Otd. Fiz.-Mat. Nauk, 7, pp. 749-754.
58. Gilbert, E. N. (1959). Random graphs, The Annals of Mathematical Statistics, 30, 4, pp. 1141-1144.
59. Gilbert, E. N. (1961). Random plane networks, Journal of the Society for Industrial & Applied Mathematics, 9, pp. 533-553.
60. Godsil, C. and Royle, G. (2001). Algebraic Graph Theory, Graduate Texts in Mathematics (Springer-Verlag).
61. Gradshteyn, I. S. and Ryzhik, I. M. (1994). Table of Integrals, Series, and Products, 5th ed. (Academic Press).
62. Greene, B. R., Shapere, A., Vafa, C. and Yau, S.-T. (1990). Stringy cosmic strings and noncompact Calabi-Yau manifolds, Nuclear Physics B 227(1), pp. 1-36.
63. 2 of a Laplacian, in Proceedings 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 201-210.
64. Guimerá, R., Mossa, S., Turtschi, A. and Amaral, L. A. N. (2005). The worldwide air transportation network: Anomalous centrality, community structure, and cities’ global roles, Proceedings National Academy of Sciences, 102, 22, pp. 7794-7799.
65. Hagen, L. and Kahng, A. B. (1992). New spectral methods for ratio cut partitioning and clustering, IEEE Transactions on Computer-Aided Design, 11, 9, pp. 1074-1085.
66. Hajnal, J. (1958). Weak ergodicitiy in non-homogeneous Markov chains, Proc. Cambridge Philos. Soc., 54, pp. 233-246.
67. Hakimi, S. L. (1962). On the realizability of a set of integers as degrees of the vertices of a graph, SIAM J. Appl. Math., 10, pp. 496-506.
68. Hale, J. K. (1977). Theory of Functional Differential Equations, Applied Mathematical Sciences, vol. 3 (Springer-Verlag).
69. Hatano, Y. and Mesbahi, M. (2004). Agreement over random networks, 43rd IEEE Conference on Decision and Control, pp. 2010-2015.
70. Havel, V. (1955). A remark on the existence of finite graphs, Casopis Pest. Mat., 80, pp. 477-480.
71. Heydemann, M. C., Meyer, J. C. and Sotteau, D. (1989). On forwarding indices of networks, Discrete Applied Mathematics, 23, pp. 103-123.
72. Horn, R. A. and Johnson, C. R. (1985). Matrix analysis (Cambridge University Press).
73. Ilchmann, A., Owens, D. H. and Prätzel-Wolters, D. (1987). Sufficient conditions for stability of linear time-varying systems, Systems and Control Letters, 9, pp. 157-163.
74. Jadbabaie, A., Lin, J. and Morse, A. S. (2003). Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Transactions on Automatic Control, 48, 6, pp. 988-1001.
75. Juhász, F. (1991). The asymptotic behaviour of Fiedler’s algebraic connectivity for random graphs, Discrete Mathematics, 96, pp. 59-63.
76. Kaneko, K. (1989). Chaotic but regular posi-nega switch among coded attractors by cluster-size variation, Physical Review Letters, 63, 3, pp. 219-223.
77. Karpelevich, F. I. (1951). On the characteristic roots of matrices with nonnegative elements, Izv. Akad. Nauk. USSR Ser. Mat. 14, pp. 361-383, in Russian.
78. Kellogg, R. B. (1972). On complex eigenvalues of m and p matrices, Numer. Math., 19, pp. 170-175.
79. Kolb, B. and Whishaw, I. Q. (1990). Fundamentals of Human Neuropsychology, 3rd ed. (W. H. Freeman and Company, New York).
80. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A. and Upfal, E. (2000). The Web as a graph, in Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 1-10.
81. Lafferriere, G., Williams, A., Caughman, J. and Veerman, J. J. P. (2005). Decentralized control of vehicle formations, Systems & Control Letters, 54, 9, pp. 899-910.
82. Lakshmikantham, V. and Liu, X. Z. (1993). Stability Analysis In Terms of Two Measures (World Scientific, Singapore).
83. Lévy, L. (1881). Sur la possibilité du l’équilibre électrique, C. R. Acad. Sci. Paris, 93, pp. 706-708.
84. Lin, W. and Zhan, X. (2006). Polarized networks, diameter, and synchronizability of networks, Tech. rep., arXiv: cond-mat/0604295.
85. Lin, Z., Francis, B. and Maggiore, M. (2005). Necessary and sufficient graphical conditions for formation control of unicycles, IEEE Transactions on Automatic Control, 50, 1, pp. 121-127.
86. Lubachevsky, B. and Mitra, D. (1986). A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius, Journal of the Association for Computing Machinery, 33, 1, pp. 130-150.
87. Lubotzky, A., Phillips, R. and Sarnak, P. (1988). Ramanujan graphs, Combinatorica, 8, 3, pp. 261-277.
88. Milgram, S. (1967). The small-world problem, Psychology Today, 1, pp. 61-67.
89. Miller, S. J., Novikoff, T. and Sabelli, A. (2006). The distribution of the second largest eigenvalue in families of Ramanujan graphs, Tech. rep., math.CO/0611649.
90. Minc, H. (1988). Nonnegative Matrices (John Wiley & Sons, New York).
91. Mohar, B. (1989). Isoperimetric numbers of graphs, Journal of Combinatorial Theory, Series B, 47, pp. 274-291.
92. Mohar, B. (1991a). Eigenvalues, diameter, and mean distance in graphs, Graphs and Combinatorics 7, pp. 53-64.
93. Mohar, B. (1991b). The Laplacian spectrum of graphs, in Y. Alavi, G. Chartrand, O. R. Oellermann and A. J. Schwenk (eds.), Graph Theory, Combinatorics, and Applications, vol. 2 (Wiley), pp. 871-898.
94. Mohar, B. (1997). Some applications of Laplace eigenvalues of graphs, in G. Hahn and G. Sabidussi (eds.), Graph Symmetry: Algebraic Methods and Applications (Kluwer), pp. 225-275.
95. Moreau, L. (2003). Leaderless coordination via bidirectional and unidirectional time-dependent communication,.
96. Moreau, L. (2005). Stability of multiagent systems with time-dependent communication links, IEEE Transactions on Automatic Control, 50, 2, pp. 169-182.
97. Murthy, M. R. (2003). Ramanujan graphs, Journal of the Ramanujan Mathematical Society, 18, 1, pp. 1-20.
98. Nelson, S. and Neumann, M. (1987). Generalization of the projection method with applications to SOR method for Hermitian positive semidefinite linear systems, Numerische Mathematik, 51, 2, pp. 123-141.
99. Nesterov, Y. and Nemirovskii, A. (1994). Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, vol. 13 (Society for Industrial and Applied Mathematics).
100. Neumann, M. and Schneider, H. (1999). The convergence of general products of matrices and the weak ergodicity of Markov chains, Linear Algebra and its Applications, pp. 307-314.
101. Newman, M. E. J. (2003). The structure and function of complex networks, SIAM Review, 45, 2, pp. 167-256.
102. Newman, M. E. J. and Watts, D. J. (1999). Scaling and percolation in the smallworld network model, Physical Review E, 60, 6, pp. 7332-7342.
103. Nishikawa, T., Motter, A. E., Lai, Y.-C. and Hoppensteadt, F. C. (2003). Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize? Physical Review Letters 91(1), pp. 014101-1-4.
104. Olfati-Saber, R. and Murray, R. M. (2004). Consensus problems in networks of agents with switching topology and time-delays, IEEE Transactions on Automatic Control, 49, 9, pp. 1520-1533.
105. Paz, A. (1965). Definite and quasidefinite sets of stochastic matrices, Proceedings of the American Mathematical Society, 16, pp. 634-641.
106. Paz, A. (1970). Ergodic theorems for infinite probabilistic tables, Annals of Mathematical Statistics, 41, 2, pp. 539-550.
107. Paz, A. and Reichaw, M. (1967). Ergodic theorems for sequences of infinite stochastic matrices, Proc. Cambridge Philos. Soc., 63, pp. 777-784.
108. Pecora, L. M. and Carroll, T. L. (1990). Synchronization in chaotic systems, Physical Review Letters, 64, 8, pp. 821-824.
109. Pecora, L. M. and Carroll, T. L. (1998a). Master stability functions for synchronized chaos in arrays of oscillators, in Proceedings of the 1998 IEEE Int. Symp. Circ. Syst., vol. 4 (IEEE), pp. IV-562-567.
110. Pecora, L. M. and Carroll, T. L. (1998b). Master stability functions for synchronized coupled systems, Physical Review Letters, 80, 10, pp. 2109-2112.
111. Penrose, M. (2003). Random Geometric Graphs (Oxford University Press).
112. Rapoport, A. (1957). Contribution to the theory of random and biased nets, Bulletin of Mathematical Biology, 19, 4, pp. 257-277.
113. Ren, W. and Beard, R. W. (2005). Consensus seeking in multiagent systems under dynamically changing interaction topologies, IEEE Transactions on Automatic Control, 50, 5, pp. 655-661.
114. Ren, W., Beard, R. W. and McLain, T. W. (2004). Coordination variables and consensus building in multiple vehicle systems, in V. Kumar, N. E. Leonard and A. S. Morse (eds.), Cooperative Control, Lecture Notes in Control and Information Sciences, vol. 309 (Springer-Verlag), pp. 171-188.
115. Ren, W. and Stepanyan, V. (2003). Information consensus in distributed multiple vehicle coordinated control, in Proceedings of the 42nd IEEE Conference on Decision and Control, pp. 2029-2034.
116. Seneta, E. (1973). On the historical development of the theory of finite inhomogeneous Markov chains, Proceedings of the Cambridge Philosophical Society, 74, pp. 507-513.
117. Seneta, E. (1979). Coefficients of ergodicity: structure and applications, Advances in Applied Probability, 11, pp. 576-590.
118. Shen, J. (2000). A geometric approach to ergodic non-homogeneous Markov chains, in Wavelet Analysis and Multiresolution Methods, Lecture Notes in Pure and Applied Math., vol. 212 (Marcel Dekker), pp. 341-366.
119. Sierksma, G. and Hoogeveen, H. (1991). Seven criteria for integer sequences being graphic, Journal of Graph Theory, 15, 2, pp. 223-231.
120. Su, Y. and Bhaya, A. (2001). Convergence of pseudocontractions and applications to two-stage and asynchronous multisplitting for singular m-matrices, SIAM journal of matrix analysis and its applications, 22, 3, pp. 948-964.
121. Swamy, M. N. S. and Thulasiraman, K. (1981). Graphs, Networks, and Algorithms (John Wiley & Sons).
122. Tan, C.-P. (1982). A functional form for a particular coefficient of ergodicity, Journal of Applied Probability, 19, pp. 858-863.
123. Tarjan, R. E. (1972). Depth-first search and linear graph algorithms, SIAM Journal on Computing, 1, 2, pp. 146-160.
124. Taussky, O. (1949). A recurring theorem on determinants, American Mathematical Monthly, 10, pp. 672-676.
125. Vandenberghe, L. and Boyd, S. (1996). Semidefinite programming, SIAM Review, 38, 1, pp. 49-95.
126. Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I. and Shochet, O. (1995). Novel type of phase transition in a system of self-driven particles, Physical Review Letters, 75, 6, pp. 1226-1229.
127. Wang, X. F. and Chen, G. (2002). Synchronization in small-world dynamical networks, International Journal of Bifurcation and Chaos 12(1), pp. 187-192.
128. Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of `small-world’ networks, Nature, 393, pp. 440-442.
129. Wiggins, S. (1990). Introduction to Applied Nonlinear Dynamical Systems and Chaos, Texts in Applied Mathematics, vol. 2 (Springer-Verlag).
130. Winkler, R. L. (1968). The consensus of subjective probability distributions, Management Science 15(2), pp. B61-B75.
131. Wolfowitz, J. (1963). Products of indecomposable, aperiodic, stochastic matrices, Proc. Amer. Math. Soc., 14, pp. 733-737.
132. Wu, C. W. (1998a). Global synchronization in coupled map lattices, in Proceedings of the 1998 IEEE Int. Symp. Circ. Syst., vol. 3 (IEEE), pp. III-302-305.
133. Wu, C. W. (1998b). Synchronization in arrays of chaotic circuits coupled via hypergraphs: static and dynamic coupling, in Proceedings of the 1998 IEEE Int. Symp. Circ. Syst., vol. 3 (IEEE), pp. III-287-290.
134. Wu, C. W. (2001). Synchronization in arrays of coupled nonlinear systems: passivity, circle criterion and observer design, in IEEE International Symposium on Circuits and Systems, pp. III-692-695.
135. Wu, C. W. (2002). Synchronization in coupled chaotic circuits and systems (World Scientific).
136. Wu, C. W. (2003a). Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic circuits, Physics Letters A 319, pp. 495-503.
137. Wu, C. W. (2003b). Synchronization in coupled arrays of chaotic oscillators with nonreciprocal coupling, IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, 50, 2, pp. 294-297.
138. Wu, C. W. (2005a). Agreement and consensus problems in groups of autonomous agents with linear dynamics, in Proceedings of 2005 IEEE International Symposium on Circuits and Systems, pp. 292-295.
139. Wu, C. W. (2005b). Algebraic connectivity of directed graphs, Linear and Multi-linear Algebra, 53, 3, pp. 203-223.
140. Wu, C. W. (2005c). On bounds of extremal eigenvalues of irreducible and m-reducible matrices, Linear Algebra and Its Applications 402, pp. 29-45.
141. Wu, C. W. (2005d). On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Linear Algebra and its Applications 402, pp. 207-227.
142. Wu, C. W. (2005e). Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, Physics Letters A 346, 4, pp. 281-287.
143. Wu, C. W. (2005f). Synchronization in arrays of coupled nonlinear systems with delay and nonreciprocal time-varying coupling, IEEE Transactions on Circuits and Systems-II 53, 5, pp. 282-286.
144. Wu, C. W. (2005g). Synchronization in networks of nonlinear dynamical systems coupled via a directed graph, Nonlinearity 18, pp. 1057-1064.
145. Wu, C. W. (2006a). On a matrix inequality and its application to the synchronization in coupled chaotic systems, in Complex Computing-Networks: Brain-like and Wave-oriented Electrodynamic Algorithms, Springer Proceedings in Physics, vol. 104, pp. 279-288.
146. Wu, C. W. (2006b). On some properties of contracting matrices, Tech. Rep. arxiv: math.DS/0604457.
147. Wu, C. W. (2006c). Synchronization and convergence of linear dynamics in random directed networks, IEEE Transactions on Automatic Control, 51, 7, pp. 1207-1210.
148. Wu, C. W. and Chua, L. O. (1994). A unified framework for synchronization and control of dynamical systems, International Journal of Bifurcation and Chaos, 4, 4, pp. 979-998.
149. Wu, C. W. and Chua, L. O. (1995). Synchronization in an array of linearly coupled dynamical systems, IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, 42, 8, pp. 430-447.
150. Xiao, L., Boyd, S. and Lall, S. (2005). A scheme for robust distributed sensor fusion based on average consensus, in IPSN '05: Proceedings of the 4th international symposium on Information processing in sensor networks (IEEE Press, Piscataway, NJ, USA), ISBN 0-7803-9202-7, p. 9.