اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA mathematical theory of fame
78
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study empirically how the fame of WWI fighter-pilot aces, measured in numbers of web pages mentioning them, is related to their achievement, measured in numbers of opponent aircraft destroyed. We find that on the average fame grows exponentially with achievement; the correlation coefficient between achievement and the logarithm of fame is 0.72. The number of people with a particular level of achievement decreases exponentially with the level, leading to a power-law distribution of fame. We propose a stochastic model that can explain the exponential growth of fame with achievement. Next, we hypothesize that the same functional relation between achievement and fame that we found for the aces holds for other professions. This allows us to estimate achievement for professions where an unquestionable and universally accepted measure of achievement does not exist. We apply the method to Nobel Prize winners in Physics. For example, we obtain that Paul Dirac, who is a hundred times less famous than Einstein contributed to physics only two times less. We compare our results with Landaus ranking.
قيم البحث
اقرأ أيضاً
We investigate a pool of international chess title holders born between 1901 and 1943. Using Elo ratings we compute for every player his expected score in a game with a randomly selected player from the pool. We use this figure as players merit. We m
easure players fame as the number of Google hits. The correlation between fame and merit is 0.38. At the same time the correlation between the logarithm of fame and merit is 0.61. This suggests that fame grows exponentially with merit.
While current studies on complex networks focus on systems that change relatively slowly in time, the structure of the most visited regions of the Web is altered at the timescale from hours to days. Here we investigate the dynamics of visitation of a
major news portal, representing the prototype for such a rapidly evolving network. The nodes of the network can be classified into stable nodes, that form the time independent skeleton of the portal, and news documents. The visitation of the two node classes are markedly different, the skeleton acquiring visits at a constant rate, while a news documents visitation peaking after a few hours. We find that the visitation pattern of a news document decays as a power law, in contrast with the exponential prediction provided by simple models of site visitation. This is rooted in the inhomogeneous nature of the browsing pattern characterizing individual users: the time interval between consecutive visits by the same user to the site follows a power law distribution, in contrast with the exponential expected for Poisson processes. We show that the exponent characterizing the individual users browsing patterns determines the power-law decay in a documents visitation. Finally, our results document the fleeting quality of news and events: while fifteen minutes of fame is still an exaggeration in the online media, we find that access to most news items significantly decays after 36 hours of posting.
We study the motion of substance in a finite channel that belongs to a network. The channel splits to two arms in a node of the network. There is an additional split of the secondary arm. We obtain analytical relationships for the distribution of the
substance in the nodes of the channel for the case of stationary regime of the motion of the substance in the arms of the channel. The obtained results are discussed from the point of view of application of the model to migration dynamics: model of motion of migrants in a channel consisting of chains of countries with different probabilities for obtaining permission to stay for the migrants in the different countries of the channel
We analyze properties of apportionment functions in context of the problem of allocating seats in the European Parliament. Necessary and sufficient conditions for apportionment functions are investigated. Some exemplary families of apportionment func
tions are specified and the corresponding partitions of the seats in the European Parliament among the Member States of the European Union are presented. Although the choice of the allocation functions is theoretically unlimited, we show that the constraints are so strong that the acceptable functions lead to rather similar solutions.
One-shot anonymous unselfishness in economic games is commonly explained by social preferences, which assume that people care about the monetary payoffs of others. However, during the last ten years, research has shown that different types of unselfi
sh behaviour, including cooperation, altruism, truth-telling, altruistic punishment, and trustworthiness are in fact better explained by preferences for following ones own personal norms - internal standards about what is right or wrong in a given situation. Beyond better organising various forms of unselfish behaviour, this moral preference hypothesis has recently also been used to increase charitable donations, simply by means of interventions that make the morality of an action salient. Here we review experimental and theoretical work dedicated to this rapidly growing field of research, and in doing so we outline mathematical foundations for moral preferences that can be used in future models to better understand selfless human actions and to adjust policies accordingly. These foundations can also be used by artificial intelligence to better navigate the complex landscape of human morality.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
