IDEAS home Printed from https://ideas.repec.org/a/spr/sankha/v81y2019i2d10.1007_s13171-018-0135-9.html
   My bibliography  Save this article

Asymptotically Normal Estimators for Zipf’s Law

Author

Listed:
  • Mikhail Chebunin

    (Sobolev Institute of Mathematics
    Novosibirsk State University)

  • Artyom Kovalevskii

    (Novosibirsk State University
    Novosibirsk State Technical University)

Abstract

We study an infinite urn scheme with probabilities corresponding to a power function. Urns here represent words from an infinitely large vocabulary. We propose asymptotically normal estimators of the exponent of the power function. The estimators use the number of different elements and a few similar statistics. If we use only one of the statistics we need to know asymptotics of a normalizing constant (a function of a parameter). All the estimators are implicit in this case. If we use two statistics then the estimators are explicit, but their rates of convergence are lower than those for estimators with the known normalizing constant.

Suggested Citation

  • Mikhail Chebunin & Artyom Kovalevskii, 2019. "Asymptotically Normal Estimators for Zipf’s Law," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 81(2), pages 482-492, December.
  • Handle: RePEc:spr:sankha:v:81:y:2019:i:2:d:10.1007_s13171-018-0135-9
    DOI: 10.1007/s13171-018-0135-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13171-018-0135-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13171-018-0135-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chebunin, Mikhail & Kovalevskii, Artyom, 2016. "Functional central limit theorems for certain statistics in an infinite urn scheme," Statistics & Probability Letters, Elsevier, vol. 119(C), pages 344-348.
    2. Paul Travis Nicholls, 1987. "Estimation of Zipf parameters," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 38(6), pages 443-445, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Igor Borisov & Maman Jetpisbaev, 2022. "Poissonization Principle for a Class of Additive Statistics," Mathematics, MDPI, vol. 10(21), pages 1-20, November.
    2. B. M. Gupta & Suresh Kumar & B. S. Aggarwal, 1999. "A comparision of productivity of male and female scientists of CSIR," Scientometrics, Springer;Akadémiai Kiadó, vol. 45(2), pages 269-289, June.
    3. Iksanov, Alexander & Kotelnikova, Valeriya, 2022. "Small counts in nested Karlin’s occupancy scheme generated by discrete Weibull-like distributions," Stochastic Processes and their Applications, Elsevier, vol. 153(C), pages 283-320.
    4. Baskaran, Thushyanthan & Blöchl, Florian & Brück, Tilman & Theis, Fabian J., 2011. "The Heckscher-Ohlin model and the network structure of international trade," International Review of Economics & Finance, Elsevier, vol. 20(2), pages 135-145, April.
    5. Leo Egghe & Ronald Rousseau, 2012. "Theory and practice of the shifted Lotka function," Scientometrics, Springer;Akadémiai Kiadó, vol. 91(1), pages 295-301, April.
    6. Bertoli-Barsotti, Lucio & Lando, Tommaso, 2015. "On a formula for the h-index," Journal of Informetrics, Elsevier, vol. 9(4), pages 762-776.
    7. Ronald Rousseau, 2002. "Lack of standardisation in informetric research. Comments on “Power laws of research output. Evidence for journals of economics” by Matthias Sutter and Martin G. Kocher," Scientometrics, Springer;Akadémiai Kiadó, vol. 55(2), pages 317-327, August.
    8. Hongguang Dong & Menghui Li & Ru Liu & Chensheng Wu & Jinshan Wu, 2017. "Allometric scaling in scientific fields," Scientometrics, Springer;Akadémiai Kiadó, vol. 112(1), pages 583-594, July.
    9. Mikhail Chebunin & Sergei Zuyev, 2022. "Functional Central Limit Theorems for Occupancies and Missing Mass Process in Infinite Urn Models," Journal of Theoretical Probability, Springer, vol. 35(1), pages 1-19, March.
    10. B. M. Gupta & C. R. Karisiddippa, 1999. "Collaboration and author productivity: A study with a new variable in Lotka's law," Scientometrics, Springer;Akadémiai Kiadó, vol. 44(1), pages 129-134, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sankha:v:81:y:2019:i:2:d:10.1007_s13171-018-0135-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.