|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2012, Number 12, Pages 30–33
(Mi ivm8756)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
The Zipf law for random texts with unequal letter probabilities and the Pascal pyramid
V. V. Bochkareva, E. Yu. Lernerb a Chair of Radiophysics, Kazan (Volga Region) Federal University, Kazan, Russia
b Chair of Economic Cybernetics, Kazan (Volga Region) Federal University, Kazan, Russia
Abstract:
The model of word generation with independent unequal letter probabilities is analyzed in the article. It is proved that the probability $p(r)$ of words of rank $r$ has the power asymptotic behavior. Elementary methods not similar to Conrad and Mitzenmacher ones are used to represent a short proof of the theorem. We derive also an explicit formula of power.
Keywords:
Zipf law, monkey model, order statistics, power laws, Pascal pyramid, recursive sequences, functional equations.
Received: 25.11.2011
Citation:
V. V. Bochkarev, E. Yu. Lerner, “The Zipf law for random texts with unequal letter probabilities and the Pascal pyramid”, Izv. Vyssh. Uchebn. Zaved. Mat., 2012, no. 12, 30–33; Russian Math. (Iz. VUZ), 56:12 (2012), 25–27
Linking options:
https://www.mathnet.ru/eng/ivm8756 https://www.mathnet.ru/eng/ivm/y2012/i12/p30
|
Statistics & downloads: |
Abstract page: | 261 | Full-text PDF : | 92 | References: | 32 | First page: | 2 |
|