arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.1279physics.soc-phcs.SI
收藏

度-属性相关可调网络中的广义友谊悖论

Generalized friendship paradox in networks with tunable degree-attribute correlation

Hang-Hyun Jo, Young-Ho Eom

摘要:

由于复杂网络中的拓扑异质性,一个有趣的现象是友谊悖论:你的朋友平均比你有更多的朋友。最近,这个悖论已经被推广到任意节点属性,称为广义友谊悖论(GFP)。GFP在网络层面的起源已被证明是植根于度和属性之间的正相关性。然而,需要更详细地理解GFP如何适用于单个节点。为此,我们首先分析了一个可解模型来描述不相关情况下节点的悖论持有概率。然后,我们数值研究了度-度和度-属性相关性可调的网络的相关模型。与网络层次不同,我们发现在个体层次上度-属性相关性与悖论持有概率的相关性可能取决于网络是排斥性的还是排斥性的。这些发现有助于我们理解复杂网络中拓扑结构和节点属性之间的相互作用。

英文摘要:

One of interesting phenomena due to topological heterogeneities in complex networks is the friendship paradox: Your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary node attributes, called generalized friendship paradox (GFP). The origin of GFP at the network level has been shown to be rooted in positive correlations between degrees and attributes. However, how the GFP holds for individual nodes needs to be understood in more detail. For this, we first analyze a solvable model to characterize the paradox holding probability of nodes for the uncorrelated case. Then we numerically study the correlated model of networks with tunable degree-degree and degree-attribute correlations. In contrast to the network level, we find at the individual level that the relevance of degree-attribute correlation to the paradox holding probability may depend on whether the network is assortative or dissortative. These findings help us to understand the interplay between topological structure and node attributes in complex networks.

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

↑