A Small World Network of Prime Numbers

DOI10.1016/J.PHYSA.2005.02.089MaRDI QIDQ6477572zbMATH OpenFDO

Authors Anjan Kumar Chandra, Subinay Dasgupta

Publication date 24 July 2006

Full work available at URL https://doi.org/10.1016/J.PHYSA.2005.02.089

Abstract: 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{|}^{alpha}$. Through computation of average shortest distance and clustering coefficient, we conclude that for $alpha>-1.8$ the network is of small world type and for $alpha<-1.8$ it is of regular type. We also present a theoretical justification for such behaviour.

This page was built for publication: A Small World Network of Prime Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477572)