A Yule - Simon process with memory
نویسنده
چکیده
– The Yule-Simon model has been used as a tool to describe the growth of diverse systems, acquiring a paradigmatic character in many fields of research. Here we study a modified Yule-Simon model that takes into account the full history of the system by means of an hyperbolic memory kernel. We show how the memory kernel changes the properties of preferential attachment and provide an approximate analytical solution for the frequency distribution density as well as for the frequency-rank distribution. In 1925 Yule [1] proposed a model to explain experimental data on the abundances of biological genera [2]. Thirty years later, Simon introduced an elegant copy and growth model [3], in spirit equivalent to Yule’s model, to explain the observed power-law distribution of word frequencies in texts [4–6]. In Simon’s growth model, new words are added to a text (more generally a stream) with constant probability p at each time step, whereas with complementary probability p̄ = 1 − p an already occurred word is chosen uniformly from within the already formed text (stream). This model yields a power-law distribution density for word frequencies P (k) ∼ k with β = 1 + 1/p̄ . The same mechanism is at play in the preferential attachment (PA) model for growing networks proposed, in their pioneering article, by Barabási and Albert [7]. In that case, a network is constructed by progressively adding new nodes and linking them to existing nodes with a probability proportional to their current connectivity. Yule-Simon processes and PA schemes are closely related to each other and a mapping between them has been provided by Bornholdt and Ebel [8]. In the original Yule-Simon process, the metaphor of text construction is somehow misleading because in that process there is no notion of temporal ordering. All existing words are equivalent and in many respects everything goes as in a Polya urn model [9]. However, the notion of temporal ordering may play an important role in determining the dynamics of many real systems. In this perspective it is interesting to investigate models where temporal ordering is explicitly taken into account. A first attempt in this direction has been provided by Dorogovtsev and Mendes (DM) [10], who studied a generalization of the Barabási-Albert
منابع مشابه
Three efficient algorithms for implementing the preferential attachment mechanism in Yule-Simon Stochastic Process
We describe how different optimized algorithms may be effective in implementing the preferential attachment mechanism in different cases. We analyze performances with respect to different values of some parameters related to the Yule process associated to the preferential attachment. We examine how performance scales with system size and provide extensive simulations to support our theoretical ...
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملObjective Bayesian Analysis of the Yule–Simon Distribution with Applications
The Yule–Simon distribution is usually employed in the analysis of frequency data. As the Bayesian literature, so far, ignored this distribution, here we show the derivation of two objective priors for the parameter of the Yule–Simon distribution. In particular, we discuss the Jeffreys prior and a loss-based prior, which has recently appeared in the literature. We illustrate the performance of ...
متن کاملHow the nature of web services drives vocabulary creation in social tagging
The social tagging system allows users to add arbitrary strings, namely ‘tags’, on a shared resource to organise and manage information. The Yule–Simon process, which is known to capture the population dynamics of social tagging behaviour, does not handle the mechanism of new vocabulary creation because this model assumes that new vocabulary creation is a Poisson-like random process. In this re...
متن کاملSelf-organization of knowledge economies ¬リニ
Suppose that homogeneous agents fully consume their time to invent new ideas and learn ideas from their friends. If the social network is complete and agents pick friends and ideas of friends uniformly at random, the distribution of ideas' popularity is an extension of the Yule–Simon distribution. It has a power-law tail, with an upward or a downward curvature. For infinite population it conver...
متن کامل