title: Reconfiguration and search of social networks.
abstract: 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 k-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.
authors.affiliation: College of Physics and Information Science, Hunan Normal University, Changsha 410081, China.
authors.forename: Lianming
authors.initials: L
authors.lastname: Zhang
authors.affiliation: College of Physics and Information Science, Hunan Normal University, Changsha 410081, China ; Department of Computer Science and Technology, Hunan University of Humanities, Science and Technology, Loudi 417000, China.
authors.forename: Aoyuan
authors.initials: A
authors.lastname: Peng
authors.affiliation: College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, China.
authors.forename: Jianping
authors.identifier: 0000-0003-2268-4370
authors.initials: J
authors.lastname: Yu
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D006801:Humans; D007257:Information Theory; D008962:Models, Theoretical; D012944:Social Support; D013269:Stochastic Processes