arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0607588math.NTcond-mat.stat-mech
收藏

素数的小世界网络

A Small World Network of Prime Numbers

Anjan Kumar Chandra, Subinay Dasgupta

摘要:

根据哥德巴赫猜想,任何偶数都可以分解为两个素数之和:$n = p + q$。我们构造了一个网络,其中每个节点是一个素数,对应于每个偶数$n$,我们把一个链接之间的组件素数$p$和$q$。在大多数情况下,偶数可以用多种方式分解,然后我们选择概率为$|p - q|^α$的{ \em one}分解。通过平均最短距离和聚类系数的计算,得出了$α> -1.8$的网络是小世界型的,而$α< -1.8$的网络是正则型的结论。我们还提出了一个理论上的理由,这种行为。

英文摘要:

According to Goldbach conjecture, any even number can be broken up as the sum of two prime numbers : $n = p + q$. We construct a network where each node is a prime number and corresponding to every even number $n$, we put a link between the component primes $p$ and $q$. In most cases, an even number can be broken up in many ways, and then we chose {\em one} decomposition with a probability $|p - q|^α$. Through computation of average shortest distance and clustering coefficient, we conclude that for $α> -1.8$ the network is of small world type and for $α< -1.8$ it is of regular type. We also present a theoretical justification for such behaviour.

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

↑