arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.01605physics.soc-phcond-mat.stat-mechcs.SI
收藏

社交网络的统计物理学

Statistical physics of social networking

Vaibhav Wasnik

摘要:

在这项工作中,我们试图从数学的角度来理解社交网络。在第一种情况下,我们考虑一个网络,其中每个代表个人的节点可以以一定的概率与相邻节点连接,并与朋友的朋友连接。我们发现,以上一个特定的值的一个选定的参数组合,两个广泛分离的节点之间的连接的概率是一个无标度。接下来,我们考虑一个简化的在线社交媒体网络的情况,其中每个人在单位时间内以恒定的概率添加朋友:来自建议邻居的朋友以及来自他/她的朋友列表的朋友。我们发现,在网络形成以来的大时间的限制下,两个相距甚远的个体之间的连接概率是一个无标度量。因此,我们证明了一个不同的规模自由方面的网络没有讨论过的文献。

英文摘要:

In this work we make an attempt to understand social networks from a mathematical viewpoint. In the first instance we consider a network where each node representing an individual can connect with a neighbouring node with a certain probability along with connecting with individuals who are friends of friends. We find that above a particular value of a chosen combination of parameters, the probability of connection between two widely separated nodes is a scale free. We next consider a simplified case of online social media networks in which each individual adds at a friends at constant probability per unit time: friends from a suggested neighbourhood as well as from his/her friendlist. We find that in the limit of large times since formation of the network, the probability of connection between two widely separated individuals is a scale free quantity. We hence, demonstrate a different scale free facet of networks not discussed before in literature.

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

↑