社交网络中低代价路径发现

Discover Low-Cost Path in Social Networks

社交网络对人们生活方式直接或间接地影响。人与人之间的社交网络是一种复杂网络,对复杂网络的动态发展进行预测和控制,也是未来网络研究中的重大问题。传统的六度空间理论揭示网络中任意个体间均存在联系,且这种联系没有想象中那么远,但该理论没有对这种联系作定量的分析。在社交网络中三方闭合和近邻机制理论的基础上,研究建立人际传播模型,并在此模型基础上,发现社交网络中两个陌生个体之间的低代价可达路径,提出DLCRP算法。实验结果表明,所提出的DLCRP算法在传播代价上明显优于广度优先搜索算法,在传播代价相对较高时更能体现出其优势。

The rapid development of the social network affects people＇s lifestyle directly. Interpersonal social network is a kind of complex network, and it＇s also a major problem in the future research that forecasting and controlling complex networks dynamically. Traditional theory of six degrees of separation affirmed the widespread contact between people without quantitatively analyzing the relation from the perspective of game theory. Studies and establishes the interpersonal propagation model based on the theory of triadic closure and vicinity mechanism. Based on the model, discovers the low cost path between unfamiliar individuals in social networks and proposes the algorithm DLCRP. The experimental results show that the propagation cost of DLCRP algorithm significantly better than the breadth-first search algorithm, and it can reflect its＇ advantage more when the cost is relatively high.