Better synchronizability predicted by crossed double cycle

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 73, Issue 3, 2006, Pages

  Zhou, Tao ^a   Zhao, Ming ^a   Wang, Bing Hong ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CROSSED DOUBLE CYCLE; EIGENRATIO; POWER-LAW; SYNCHRONIZABILITY;

CRYSTAL LATTICES; EIGENVALUES AND EIGENFUNCTIONS;

SYNCHRONIZATION;

EID: 33644776678     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.73.037101     Document Type: Article

References (40)

1. S. Strogatz, SYNC-How the Emerges from Chaos in the Universe, Nature, and Daily Life (Hyperion, New York, 2003).
2. L. M. Pecora and T. L. Carroll, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.64.821 64, 821 (1990).
3. K. M. Cuomo and A. V. Oppenheim, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.71.65 71, 65 (1993).
4. H. G. Winful and L. Rahman, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.65.1575 65, 1575 (1990).
5. K. Otsuka, R. Kawal, S. L. Hwong, J. Y. Ko, and J. L. Chern, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.84.3049 84, 3049 (2000).
6. D. Hansel and H. Sompolinsky, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.68.718 68, 718 (1992).
7. M. de Sousa Vieira, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.82.201 82, 201 (1999).
8. J. F. Heagy, T. L. Carroll, and L. M. Pecora, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.50.1874 50, 1874 (1994).
9. C. W. Wu and L. O. Chua, IEEE Trans. Circuits Syst., I: Fundam. Theory Appl. ITCAEX 1057-7122 10.1109/81.404047 42, 430 (1995).
10. P. M. Gade, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.54.64 54, 64 (1996).
11. S. C. Manrubia and A. S. Mikhailov, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.60.1579 60, 1579 (1999).
12. D. J. Watts and S. H. Strogatz, Nature (London) NATUAS 0028-0836 10.1038/30918 393, 440 (1998).
13. A.-L. Barabási and R. Albert, Science SCIEAS 0036-8075 10.1126/science.286.5439.509 286, 509 (1999).
14. L. F. Lago-Fernández, R. Huerta, F. Corbacho, and J. A. Siguenza, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.84.2758 84, 2758 (2000).
15. X. F. Wang and G. Chen, Int. J. Bifurcation Chaos Appl. Sci. Eng. IJBEE4 0218-1274 10.1142/S0218127402004292 12, 187 (2002).
16. O. Kwon and H.-T. Moon, Phys. Lett. A PYLAAG 0375-9601 10.1016/S0375-9601(02)00575-3 298, 319 (2002).
17. L. M. Pecora and T. L. Carroll, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.80.2109 80, 2109 (1998).
18. G. Hu, J. Yang, and W. Liu, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.58.4440 58, 4440 (1998).
19. M. Barahona and L. M. Pecora, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.89.054101 89, 054101 (2002).
20. L. M. Pecora and M. Barahona, Chaos Complexity Lett. 1556-3995 1, 61 (2005).
21. In a network, the distance between two vertices is defined as the number of edges along the shortest path connecting them. The average distance L of the network, then, is defined as the mean distance between two vertices, averaged over all pairs of vertices.
22. P. M. Gade and C.-K. Hu, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.62.6409 62, 6409 (2000).
23. P. G. Lind, J. A. C. Gallas, and H. J. Herrmann, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.70.056207 70, 056207 (2004).
24. T. Nishikawa, A. E. Motter, Y.-C. Lai, and F. C. Hoppensteadt, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.91.014101 91, 014101 (2003).
25. H. Hasegawa, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.70.066107 70, 066107 (2004).
26. U. Brandes, J. Math. Sociol. 0022-250X 15, 163 (2001).
27. M. E. J. Newman, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.64. 016131 64, 016132 (2001).
28. H. Hong, B. J. Kim, M. Y. Choi, and H. Park, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.69.067105 69, 067105 (2004).
29. M. Zhao, T. Zhou, B.-H. Wang, and W.-X. Wang, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.72.057102 72, 057102 (2005).
30. F. Qi, Z. Hou, and H. Xin, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.91.064102 91, 064102 (2003).
31. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications (MacMillan, London, 1976).
32. A network G is isomorphic to a network H if there exists a bijective mapping θ:V (G) →V (H) satisfying the adjacency-preserving condition: (xy) E (G) [θ (x) θ (y)] E (H), where V (•) and E (•) denote the sets of vertices and edges, respectively. Popularly speaking, two networks are isomorphic, which means they have the same structure.
33. J.-M. Xu, Topological Structure and Analysis of Interconnection Networks (Kluwer Academic, Dordrecht, 2001).
34. Note that, θ0, θ1,..., θN-1 is the sort ascending of γ0, γ1,..., γN-1.
35. A. E. Motter, C. Zhou, and J. Kurths, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.71.016116 71, 016116 (2005).
36. M. Chavez, D. U. Hwang, A. Amann, H. G. E. Hontschel, and S. Boccaletti, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.94.218701 94, 218701 (2005).
37. C.-Y. Yin, B.-H. Wang, W.-X. Wang, T. Zhou, and H.-J. Yang, Phys. Lett. A PYLAAG 0375-9601 351, 220 (2006).
38. G. H. Barnes, IEEE Trans. Comput. ITCOB4 0018-9340 17, 746 (1968).
39. K. Efe, IEEE Trans. Comput. ITCOB4 0018-9340 40, 1312 (1991).
40. P. Kulasinghe and S. Bettayeb, IEEE Trans. Comput. ITCOB4 0018-9340 44, 923 (1995).