CoChat
Sign Up
Cited by 1,188

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A Brief History of Generative Models for Power Law and Lognormal Distributions

Mitzenmacher, Michael·2004·Internet Mathematics
DOI 10.1080/15427951.2004.10129088
Open this paper in CoChat — free account

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/15427951.2004.10129088

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • In the copying model, α ≈ 2 corresponds to near-pure preferential attachment (γ → 0) in a one-edge-per-arrival regime, where each impression or recommendation resolves into a single allocation of attention - predominantly steered toward already-popular creators, with a small net exploratory component.

    “In the copying model (Mitzenmacher 2004; Easley, J. Kleinberg, et al. 2010; Chung et al. 2003), α ≈ 2 corresponds to near-pure preferential attachment ( γ → 0) in a one-edge-per-arrival regime, where each impression or recommendation resolves into a single allocation of attention - predominantly steered toward already-popular creators, with a small net exploratory component.”

    From "Rich-Get-Richer"? Platform Attention and Earnings Inequality using Patreon Earnings Data (2025) · cites this paper as Mitzenmacher 2004

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 40

  1. J. Aitchison and J. A. C. Brown. The Lognormal Distribution. Cambridge University Press, 1957.
  2. A. P. Allen, B. Li, and E. L. Charnov. Population fluctuations, power laws and mixtures of lognormal distributions. Ecology Letters, 4:1-3, 2001.
  3. A.-L. Barabási, R. Albert, and H. Jeong. Mean-field theory for scale-free random networks. Physica A, vol. 272, pages 173-189, 1999.
  4. P. Barford and M. Crovella. Generating Representative Web Workloads for Network and Server Performance Evaluation. In Proceedings of ACM SIGMETRICS, pp 151-160, 1998.
  5. B. Berry. Déjà vu, Mr. Krugman. Urban Geography, vol 20, 1, pp. 1-2, 1999.
  6. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády. The degree sequence of a scale-free random process. Random Structures and Algorithms, vol 18(3): 279-290, 2001.
  7. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the Web: experiments and models. In Proc. of the 9th World Wide Web Conference, 2000.
  8. J. M. Carlson and J. Doyle. Highly optimized tolerance: a mechanism for poer laws in designed systems. Physics Review E, 60(2):1412- 1427, 1999.
  9. D. Champernowne. A model of income distribution. Economic Journal, 63:318-351, 1953.
  10. J. Cox, S. Ross, and M. Rubinstien. Option pricing: a simplified approach. Journal of Financial Economics, 7:229-265, 1979.
  11. M. Crovella and A. Bestavros. Self-similarity in world wide web traffic: evidence and possible causes. IEEE/ACM Transactions on Networking, 5(6):835-846, 1997.
  12. M. Crovella, M. S. Taqqu, and A. Bestavros. Heavy-tailed probability distributions in the world wide web. In A Practical Guide to Heavy Tails, editors R. J. Adler, R. E. Feldman, M. S. Taqqu. Chapter 1, pp. 3-26, Chapman and Hall, 1998.
  13. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-Law relationships of the Internet topology. In Proceedings of the ACM SIGCOMM 1999 Conference, pages 251-261, 1999.
  14. X. Gabaix. Zipf's law for cities: an explanation. Quarterly Journal of Economics, 114:739-767. 1999.
  15. B. A. Huberman and L. A. Adamic. The Nature of Markets in the World Wide Web. Quarterly Journal of Economic Commerce, vol 1., pp. 5-12, 2000.
  16. J. C. Hull. Introduction to futures and options markets (third edition). Prentice-Hall, Inc., New Jersey, 1997.
  17. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The Web as a graph: Measurements, Models, and Methods. In Proceedings of the International Conference on Combinatorics and Computing, 1999.
  18. P. L. Krapivsky and S. Redner. Organization of growing random networks. Physical Review E, 63, 066123-1 -066123014, 2001.
  19. P. Krugman. The Self-Organizing Economy. Blackwell, Cambridge MA, 1996.
  20. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large scale knowledge bases from the Web. In Proceedings of the 25th VLDB Conference, 1999.
  21. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the Web graph. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 57-65, 2000.
  22. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the self-similar nature of Ethernet traffic. IEEE/ACM Transactions on Networking pp. 1-15, 1994.
  23. W. Li. Random Texts Exhibit Zipf's-Law-Like Word Frequency Distribution. IEEE Transactions on Information Theory, 38(6):1842-1845, 1992.
  24. A. J. Lotka. The frequency distribution of scientific productivity. Journal of the Washington Academy of Sciences, 16:317-323, 1926.
  25. B. Mandelbrot. An informational theory of the statistical structure of languages. In Communication Theory, edited by W. Jackson, Betterworth, pp. 486-502, 1953.
  26. B. Mandelbrot. Fractals and Scaling in Finance. Springer-Verlag, New York, 1997.
  27. D. McAlister. The law of the geometric mean. Proceedings of the Royal Society, 29:367, 1879.
  28. A. Medina, I. Matta, and J. Byers. On the origin of power laws in Internet topologies. Computer Communication Review, 30(2), pages 18-28, 2000.
  29. M. Mitzenmacher. Dynamic Models for File Size Distributions and Double Pareto Distributions. Preprint, available at http://www.eecs.harvard.edu/∼michaelm/NEWWORK/papers/.
  30. E. W. Montroll and M. F. Shlesinger. On 1/f noise and other distributions with long tails. Proceedings of the National Academy of Sciences, USA, 79:3380-3383, 1982.
  31. E. W. Montroll and M. F. Shlesinger. Maximum entropy formalism, fractals, scaling phenomena, and 1/f noise: a tale of tails. Journal of Statistical Physics, 32:209-230, 1983.
  32. T. Nakajima and A. Higurashi. A use of two-channel radiances for an aeresol characterization from space. Geophysical Research Letters, 25:3815-3818, 1998.
  33. V. Paxson and S. Floyd. Wide-area traffic: the failure of Poisson modeling. IEEE/ACM Transactions on Networking, vol. 3, pp. 226-244, 1995.
  34. R. Perline. Zipf's law, the central limit theorem, and the random division of the unit interval. Physical Review E, 54(1):220-223, 1996.
  35. W. J. Reed The Pareto law of incomes -an explanation and an extension. Submitted to Journal of Business and Economic Statistics. 2000. Available at http://www.math.uvic.ca/faculty/reed/index.html.
  36. M. S. Wheatland and P. A. Sturrock. Avalanche models of solar flares and the distribution of active regions. The Astrophysical Journal, 471:1044-1048, 1996.
  37. G. Yule. A mathematical theory of evolution based on the conclusions of Dr. J.C. Willis, F.R.S. Philosophical Transactions of the Royal Society of London (Series B), 213:21-87 (1925).
  38. X. Zhu, J. Yu, and J. Doyle. Heavy tails, generalized coding, and optimal web layout. In Proceedings of IEEE INFOCOM, 2001.
  39. G. Zipf. Selective Studies and the Principle of Relative Frequency in Language. Harvard University Press, Cambridge, MA, 1932.
  40. G. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley, Cambridge, MA, 1949.

Cited by

Sorted by citations

Metadata

Authors
Mitzenmacher, M.
Venue
Internet Mathematics
Publisher
Internet Mathematics
Published
2004-01
Volume
1
Issue
2
Pages
226-251
ISSN
  • 1542-7951
  • 1944-9488
DOI
10.1080/15427951.2004.10129088
Cited by
1,188
References
1
Language
en

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review