Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2013 (2013), Article ID 391782, 11 pages
Research Article

Reconfiguration and Search of Social Networks

1College of Physics and Information Science, Hunan Normal University, Changsha 410081, China
2Department of Computer Science and Technology, Hunan University of Humanities, Science and Technology, Loudi 417000, China
3College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, China

Received 6 October 2013; Accepted 17 November 2013

Academic Editors: H. R. Karimi and W. Zhang

Copyright © 2013 Lianming Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Social networks tend to exhibit some topological characteristics different from regular networks and random networks, such as shorter average path length and higher clustering coefficient, and the node degree of the majority of social networks obeys exponential distribution. Based on the topological characteristics of the real social networks, a new network model which suits to portray the structure of social networks was proposed, and the characteristic parameters of the model were calculated. To find out the relationship between two people in the social network, and using the local information of the social network and the parallel mechanism, a hybrid search strategy based on -walker random and a high degree was proposed. Simulation results show that the strategy can significantly reduce the average number of search steps, so as to effectively improve the search speed and efficiency.