arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.16337physics.soc-ph
收藏

度偏网络采样下友谊悖论消失

Friendship paradox disappears under degree biased network sampling

Keio University(庆应义塾大学)

Wojciech Roga

AI总结:

研究证明在度偏采样下,顶点的期望度数等于其邻居的期望度数,从而使得传统社交网络中著名的友谊悖论消失。

摘要:

我们证明在无向图中,度偏采样下顶点的期望度数等于其邻居的期望度数。因此,在这种偏采样下,传统社交网络中著名的友谊悖论结果消失。该恒等式等价于图上随机游走的稳态存在,或等价于由顶点度数差定义的总流量守恒。

英文摘要:

We show that in an undirected graph under degree biased sampling the expected degree of vertices is equal to the expected degree of their neighbors. In consequence, under the biased sampling the social network result known as the friendship paradox disappears. The identity is equivalent to the existence of a stationary state of a random walk on the graph or to the conservation of the total flow defined by the difference of the degrees of the vertices.

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

↑