Author
Abstract
In this article, we examine the classical law of Bradford. This law yields groups with an equal number of articles, but where the number of journals increases geometrically. Within each group, and starting with the last ones (the least productive journals) we examine the maximal productivity of the journals. We describe, using only ym, the maximal productivity (of the journal of rank one), all the possible productivities of the journals in every Bradford group. The same method shows that the most productive journal in every group p (starting with the last group) produces a number of articles mp, where:[FORMULA] $$m_p\;\approx\;{{k^p}\over{e^E}}$$ where k is the Bradford multiplicator and E is the number of Euler. Hence, the maximal journal productivity in each group forms an approximate Bradford law with fixed universal constant e−E ≈ 0.56. We can say that the dual law of a Bradford law is an approximate Bradford law. This approach is not a pure rank method (as is Bradford's law), nor a pure frequency method (as is Lotka's law), but a frequency method within a rank method. The formula for mp gives a theoretical formula (and hence an explanation) for k, the Bradford multiplier, which is easily applied in practical data. It also sheds more light on the Yablonsky‐Goffman‐Warren formula for k, which has only been established experimentally. © 1986 John Wiley & Sons, Inc.
Suggested Citation
L. Egghe, 1986.
"The dual of Bradford's law,"
Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 37(4), pages 246-255, July.
Handle:
RePEc:bla:jamest:v:37:y:1986:i:4:p:246-255
DOI: 10.1002/(SICI)1097-4571(198607)37:43.0.CO;2-D
Download full text from publisher
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:bla:jamest:v:37:y:1986:i:4:p:246-255. 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.
We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.