arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.1012cs.SI
收藏

社交网络中团队的舒适度

Comfortability of a Team in Social Networks

Lakshmi Prabha S, T. N. Janakiraman

摘要:

社会网络分析(SNA)中有很多指标(测度或度量),如密度、凝聚力等。基于图论的概念定义了社会网络的核心舒适团队,并分析了其结构性质。舒适性是一个成功的团队工作的重要属性(特征)之一。因此,有必要在任何给定的社交网络中找到一个舒适和成功的团队。利用图论中的控制概念证明了在任意网络中组建核心舒适团队是NP-完全的。其次,我们给出了两个多项式时间的近似算法,用于在任意给定的网络中寻找这样一个核心舒适团队,其性能比为O(ln Δ),其中Δ是给定网络(图)的最大度。证明了该算法的时间复杂度为O(n^{3}),其中n为网络(图)中的人数(顶点)。在无标度网络中也证明了算法的有效性。

英文摘要:

There are many indexes (measures or metrics) in Social Network Analysis (SNA), like density, cohesion, etc. We have defined a new SNA index called "comfortability". In this paper, core comfortable team of a social network is defined based on graph theoretic concepts and some of their structural properties are analyzed. Comfortability is one of the important attributes (characteristics) for a successful team work. So, it is necessary to find a comfortable and successful team in any given social network. It is proved that forming core comfortable team in any network is NP-Complete using the concepts of domination in graph theory. Next, we give two polynomial-time approximation algorithms for finding such a core comfortable team in any given network with performance ratio O(ln Δ), where Δis the maximum degree of a given network (graph). The time complexity of the algorithm is proved to be O(n^{3}), where n is the number of persons (vertices) in the network (graph). It is also proved that the algorithms give good results in scale-free networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑