اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPageRank of integers
148
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We build up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows to find this vector for matrices of billion size. This network provides a new PageRank order of integers.
قيم البحث
اقرأ أيضاً
Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks
where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutr
PageRank is a Web page ranking technique that has been a fundamental ingredient in the development and success of the Google search engine. The method is still one of the many signals that Google uses to determine which pages are most important. The
main idea behind PageRank is to determine the importance of a Web page in terms of the importance assigned to the pages hyperlinking to it. In fact, this thesis is not new, and has been previously successfully exploited in different contexts. We review the PageRank method and link it to some renowned previous techniques that we have found in the fields of Web information retrieval, bibliometrics, sociometry, and econometrics.
We use the methods of quantum chaos and Random Matrix Theory for analysis of statistical fluctuations of PageRank probabilities in directed networks. In this approach the effective energy levels are given by a logarithm of PageRank probability at a g
iven node. After the standard energy level unfolding procedure we establish that the nearest spacing distribution of PageRank probabilities is described by the Poisson law typical for integrable quantum systems. Our studies are done for the Twitter network and three networks of Wikipedia editions in English, French and German. We argue that due to absence of level repulsion the PageRank order of nearby nodes can be easily interchanged. The obtained Poisson law implies that the nearby PageRank probabilities fluctuate as random independent variables.
In this paper, we discuss P(n), the number of ways in which a given integer n may be written as a sum of primes. In particular, an asymptotic form P_as(n) valid for n towards infinity is obtained analytically using standard techniques of quantum stat
istical mechanics. First, the bosonic partition function of primes, or the generating function of unrestricted prime partitions in number theory, is constructed. Next, the density of states is obtained using the saddle-point method for Laplace inversion of the partition function in the limit of large n. This directly gives the asymptotic number of prime partitions P_as(n). The leading term in the asymptotic expression grows exponentially as sqrt[n/ln(n)] and agrees with previous estimates. We calculate the next-to-leading order term in the exponent, porportional to ln[ln(n)]/ln(n), and show that an earlier result in the literature for its coefficient is incorrect. Furthermore, we also calculate the next higher order correction, proportional to 1/ln(n) and given in Eq.(43), which so far has not been available in the literature. Finally, we compare our analytical results with the exact numerical values of P(n) up to n sim 8 10^6. For the highest values, the remaining error between the exact P(n) and our P_as(n) is only about half of that obtained with the leading-order (LO) approximation. But we also show that, unlike for other types of partitions, the asymptotic limit for the prime partitions is still quite far from being reached even for n sim 10^7.
We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $ntoinfty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic partition function
of primes, in number theory called the generating function of the distinct prime partitions, in the saddle-point approximation. We find that our result of $Q_{as}(n)$, which includes two higher-order corrections to the leading term in its exponent and a pre-exponential correction factor, approximates the exact $Q(n)$ far better than its simple leading-order exponential form given so far in the literature.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
