Title :
On Synchronizability of Kleinberg Small World Networks
Author :
Yi Zhao ; Jianwen Feng ; Jingyi Wang
Author_Institution :
Coll. of Math. & Comput. Sci., Shenzhen Univ., Shenzhen, China
Abstract :
In this paper, the impact of edge-adding probability on both synchronizability and average path length of Klein berg small world networks is investigated. It could be seen from the analysis that two dimensional Klein berg small world networks have similar properties as NW small world networks but Klein berg small world network is more general, that is, the synchronizability becomes stronger as the edge-adding probability increases. Moreover, the average path length of Klein berg small world network decreases with the increasing edge-adding probability. And this phenomenon is verified by numerical simulations on a network of Lorenz oscillators. Then, it could be deduced from the phenomenon observed that compared with the small probabilities of longer distance of the edge-adding, the large probabilities of shorter distance of the edge-adding could achieve better synchronizability. This means the probabilities of the edge-adding play more important than the length of edge-adding to enhance the synchronizability of the small world network.
Keywords :
graph theory; numerical analysis; probability; small-world networks; synchronisation; Kleinberg small world networks; Lorenz oscillators; NW small world networks; average path length; edge-adding probability; numerical simulations; synchronizability; Chaos; Couplings; Eigenvalues and eigenfunctions; Laplace equations; Lattices; Oscillators; Synchronization; Kleinberg small world network; average path length; edge-adding probability; synchronizability;
Conference_Titel :
Computational Intelligence and Security (CIS), 2012 Eighth International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
978-1-4673-4725-9
DOI :
10.1109/CIS.2012.53