{
  "id": "zipfs-law",
  "title": "Zipf's Law",
  "lang": "en",
  "source_lang": "en",
  "summary": "Zipf’s law is an empirical rank–frequency relationship in which an item’s frequency is approximately inversely proportional to its rank.",
  "category": "mathematics",
  "subcategory": "probability-statistics",
  "type": "concept",
  "aliases": [
    "Zipf law",
    "Zipfian distribution",
    "Zipf distribution",
    "rank–frequency law"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/zipfs-law/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/zipfs-law/",
      "json": "https://aiwiki.page/zh/zipfs-law.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Zipf’s law is an empirical regularity in which the frequency or size of an item is approximately inversely proportional to its rank when items are arranged from largest to smallest. Its best-known application is to words in a text: the second most frequent word occurs roughly half as often as the most frequent, the third roughly one-third as often, and so on. Named after the American linguist George Kingsley Zipf, the law also provides a reference model for city populations, the popularity of online resources, and other systems containing a few very common or large items and many rare or small ones.\n\nIn its strict form, the relationship is \\(f(r)\\propto r^{-1}\\), where \\(r\\) denotes rank and \\(f(r)\\) denotes frequency or size. More broadly, “Zipfian” often describes a power-law rank relationship \\(f(r)\\propto r^{-s}\\), with an exponent \\(s\\) near, but not necessarily equal to, one. This distinction matters: an approximately straight line on logarithmic axes does not establish an exact inverse-rank law, and a similar pattern can arise through several different mechanisms.\n\nZipf’s law connects empirical studies of language and social organization with probability, statistical inference, and information theory. Its mathematical formulation clarifies how rank relates to frequency distributions; its applications reveal both the usefulness and the limitations of describing complex systems through a single scaling exponent."
    },
    {
      "heading": "Historical development",
      "text": "The observation underlying Zipf’s law predates Zipf’s own work. In 1913, the French scholar Jean-Baptiste Estoup discussed regularities in word frequencies in his studies of shorthand and language. Zipf subsequently made rank–frequency relationships central to a broader research program. His books The Psycho-Biology of Language (1935) and Human Behavior and the Principle of Least Effort (1949) brought together evidence from language and other forms of human activity, helping establish the inverse-rank relationship as a widely recognized empirical law.\n\nZipf interpreted linguistic regularities through a “principle of least effort.” In his account, speakers benefit from reusing a small repertoire of expressions, whereas listeners benefit from distinctions that reduce ambiguity. The observed organization of vocabulary was presented as a balance between these competing pressures. This was a substantive explanatory proposal, not simply another way to state the rank equation. The empirical relationship can be examined independently of whether that particular explanation is accepted, and later models have shown that similar frequency patterns need not arise from communicative optimization.\n\nRelated discoveries developed in other fields. Vilfredo Pareto’s late nineteenth-century studies of income distributions established another influential form of power-law regularity. Felix Auerbach discussed the distribution of city sizes in 1913, and Alfred Lotka described an inverse-power relationship for scientific productivity in 1926. These findings concern different units and different statistical representations: an income distribution, an author-productivity distribution, and a rank–size curve are not interchangeable. Their mathematical relationships nevertheless encouraged the broader study of highly unequal distributions.\n\nDuring the 1950s, Benoît Mandelbrot and Herbert A. Simon developed influential but different approaches to these patterns. Mandelbrot investigated statistical language models and information-theoretic formulations, including a shifted rank law. Simon’s 1955 paper “On a Class of Skew Distribution Functions” showed how cumulative growth with preferential selection can generate skewed distributions. Their work helped move the subject beyond cataloguing empirical straight lines toward specifying processes capable of producing them.\n\nLater research increasingly emphasized large datasets, explicit statistical estimation, and comparisons between competing distributions. Mark E. J. Newman’s 2005 review of power laws and the 2009 methodological work of Aaron Clauset, Cosma Rohilla Shalizi, and Newman became prominent reference points for this approach. In contemporary usage, Zipf’s law is therefore both a specific inverse-rank hypothesis and a historical entry point into the wider analysis of heavy-tailed data. Distinguishing these meanings prevents approximate scaling, exact mathematical distributions, and proposed causal explanations from being treated as the same claim."
    },
    {
      "heading": "Mathematical formulation and normalization",
      "text": "Suppose a collection contains \\(N\\) distinct items, ranked by decreasing probability of occurrence. A finite Zipf distribution assigns rank \\(r\\), for \\(r=1,\\ldots,N\\), the probability\n\n\\[p_r=\\frac{r^{-s}}{H_{N,s}}, \\qquad H_{N,s}=\\sum_{k=1}^{N}k^{-s}.\\]\n\nHere \\(s>0\\) controls the steepness of the distribution, and \\(H_{N,s}\\) is the normalizing constant that makes the probabilities sum to one. This is a probability mass function over ranks. The strict inverse-rank law corresponds to \\(s=1\\); empirical discussions often retain the name when an estimated exponent differs moderately from one.\n\nNormalization is essential because proportionality alone does not define a probability distribution. For \\(s=1\\), the constant is the harmonic number \\(H_N\\). As \\(N\\) grows,\n\n\\[H_N=\\log N+\\gamma+O(N^{-1}),\\]\n\nwhere \\(\\gamma\\) is the Euler–Mascheroni constant and \\(\\log\\) denotes the natural logarithm. Thus the leading item’s probability is \\(1/H_N\\), rather than a universal fixed number. For a hypothetical vocabulary of 10,000 items following the strict finite law, \\(H_N\\) is approximately \\(9.79\\), giving the first-ranked item a probability of about \\(0.102\\). This is a model calculation, not a general estimate for natural language.\n\nAn infinite-support version behaves differently. The series \\(\\sum_{r=1}^{\\infty}r^{-s}\\) converges only for \\(s>1\\), in which case\n\n\\[p_r=\\frac{r^{-s}}{\\zeta(s)},\\]\n\nwith \\(\\zeta\\) the Riemann zeta function. At \\(s=1\\), no positive constant can normalize the inverse-rank sequence over all positive integers. Consequently, an exact infinite Zipf distribution with exponent one is not a probability distribution. Statements about an unbounded inverse-rank vocabulary must specify a cutoff, a changing normalization, or an asymptotic interpretation.\n\nThe exponent also determines concentration. A larger \\(s\\) places more probability on the leading ranks; a smaller positive \\(s\\) makes probabilities more nearly equal across a fixed finite support. If the rank itself is treated as a random variable, its \\(q\\)-th moment in the infinite-support model is\n\n\\[\\mathbb{E}[R^q]=\\frac{\\zeta(s-q)}{\\zeta(s)},\\]\n\nprovided \\(s>q+1\\). In particular, its expected value exists only for \\(s>2\\), and its variance is finite only for \\(s>3\\). These are moments of the sampled rank, not of word length, city population, or another quantity associated with the ranked item. Confusing those variables can lead to incorrect interpretations of the model’s mathematical properties."
    },
    {
      "heading": "Rank curves, tail distributions, and exponent conventions",
      "text": "A rank–size relationship describes ordered observations rather than directly specifying how many observations fall within each size interval. Suppose the size at rank \\(r\\) is approximately\n\n\\[x(r)=Cr^{-s}.\\]\n\nInverting the equation gives \\(r(x)\\approx(C/x)^{1/s}\\). Since rank approximately counts the number of observations at least as large as \\(x\\), the fraction exceeding \\(x\\) scales as\n\n\\[\\Pr(X\\ge x)\\propto x^{-\\beta}, \\qquad \\beta=\\frac{1}{s}.\\]\n\nThis exceedance probability is the complementary cumulative distribution function. The relationship is exact only under appropriate idealizations; finite samples, discrete sizes, and ties require additional care.\n\nIf sizes can be approximated by a continuous variable with probability density function \\(p(x)\\propto x^{-\\alpha}\\), integration gives an exceedance exponent \\(\\beta=\\alpha-1\\), assuming \\(\\alpha>1\\). Hence\n\n\\[\\alpha=1+\\frac{1}{s}.\\]\n\nA strict Zipf rank exponent \\(s=1\\) therefore corresponds to a density exponent \\(\\alpha=2\\), not to a density proportional to \\(x^{-1}\\). This distinction is particularly important when comparing linguistic rank plots with studies that report frequency histograms, city-size densities, or income tails.\n\nFor a continuous Pareto distribution above a lower cutoff \\(x_{\\min}\\), the survival function is\n\n\\[\\Pr(X\\ge x)=\\left(\\frac{x}{x_{\\min}}\\right)^{-\\beta}, \\qquad x\\ge x_{\\min}.\\]\n\nIts inverse-rank behavior has \\(s=1/\\beta\\). Some fields call \\(\\beta\\) the Pareto exponent; others report the density exponent \\(\\alpha\\), and some use “Zipf exponent” without making clear whether they mean \\(s\\) or its reciprocal. Numerical comparisons are meaningful only after identifying the plotted quantity and the exponent convention.\n\nPower laws are also associated with scale invariance. For the ideal rank curve, multiplying rank by \\(a\\) multiplies size by \\(a^{-s}\\), so \\(x(ar)/x(r)=a^{-s}\\). On logarithmic axes this becomes\n\n\\[\\log x(r)=\\log C-s\\log r.\\]\n\nThe result is a straight line with slope \\(-s\\). Finite cutoffs and normalization still matter, however, and a straight-looking segment does not demonstrate scale invariance over all sizes.\n\nAnother consequence follows by dividing ranks into multiplicative intervals. Under the strict law, the total probability between ranks \\(a\\) and \\(ba\\) is approximately \\(\\log(b)/H_N\\), provided the ranks lie well within the support. Successive equal-width intervals on a logarithmic rank axis therefore contain approximately equal total probability. This explains how a large collection of individually rare items can collectively account for a substantial share of observations, even though no single low-frequency item is prominent."
    },
    {
      "heading": "Word frequencies and linguistic structure",
      "text": "The canonical linguistic application begins by dividing a text collection into tokens and grouping those tokens into types. A token is an occurrence; a type is the category to which occurrences are assigned. In an English word-based analysis, repeated occurrences of “the” belong to one type. After types are sorted by their token counts, their rank–frequency curve often contains a broad region close to an inverse-rank relationship. Common grammatical words occupy the highest ranks, while specialized vocabulary, names, and unusual forms populate the lower-frequency tail.\n\nThe counting procedure materially affects the result. Converting all letters to lowercase merges forms otherwise counted separately. Lemmatization groups inflected forms under a dictionary form, while a surface-form analysis keeps them distinct. Decisions about punctuation, hyphens, contractions, and numbers change both vocabulary size and frequency counts. Languages with productive inflection or compounding introduce further differences, and languages whose writing systems do not routinely separate words with spaces require explicit segmentation. A Zipf exponent is therefore inseparable from the unit being counted.\n\nObserved curves also change across ranks. The most frequent function words form a small, linguistically constrained group and need not lie on the same line as middle-ranked words. At the opposite end, many types occur once, producing a plateau in the empirical rank plot because their counts are tied. Such words are called hapax legomena. A one-occurrence plateau is partly a consequence of finite observation: a true probability much smaller than the reciprocal of the corpus size cannot be resolved accurately through raw counts.\n\nVocabulary growth provides a related but distinct regularity, commonly called Heaps’ law. If \\(V(T)\\) is the number of distinct types observed after \\(T\\) tokens, an empirical approximation is \\(V(T)\\approx KT^b\\), often with \\(0<b<1\\). Under independent sampling from a fixed probability sequence, the expected number of observed types is\n\n\\[\\mathbb{E}[V(T)] =\\sum_i\\left[1-(1-p_i)^T\\right].\\]\n\nFor an infinite sequence with \\(p_i\\) asymptotically proportional to \\(i^{-s}\\), where \\(s>1\\), this leads to vocabulary growth of order \\(T^{1/s}\\). The strict \\(s=1\\) case requires special treatment because the corresponding infinite probability sequence cannot be normalized.\n\nReal texts depart from independent sampling. Topics make words cluster; authors and genres have different vocabularies; new names and technical terms enter over time. Combining documents can therefore produce a rank distribution different from that of any individual document. Zipf’s law describes aggregate frequency inequality, but does not by itself capture syntax, meaning, narrative order, or the dependence between successive words. Two texts can have almost identical word-frequency curves while differing profoundly in linguistic organization."
    },
    {
      "heading": "Cities, popularity, and other empirical settings",
      "text": "For city populations, Zipf’s law is usually expressed as a rank–size rule: the population of the city at rank \\(r\\) is approximately the largest city’s population divided by \\(r\\). This is a statement about a system of cities within a specified territory and period, not about the internal population distribution of a single city. Studies in urbanization and economics have repeatedly examined whether the upper part of a national city-size distribution approaches this form.\n\nThe definition of a city is crucial. An administrative municipality, a continuously built-up settlement, and a metropolitan labor-market area can have very different populations. A large urban region divided among many municipalities may appear as several moderate-sized cities under one definition and a single leading city under another. Minimum population thresholds and national boundaries also affect the ranked sample. Consequently, differences between estimated exponents can reflect measurement choices as well as demographic processes.\n\nA dominant capital or commercial center may stand well above an otherwise approximately linear rank plot, a pattern often discussed as urban primacy. At smaller settlement sizes, the distribution may bend away from the upper-tail relationship. A country can therefore exhibit an approximately Zipfian upper tail without its entire settlement system following one power law. Xavier Gabaix’s 1999 work provided an influential growth-based account linking city-size scaling to proportionate growth under suitable conditions, while subsequent research has continued to examine the roles of migration, economic structure, and urban definitions.\n\nPopularity distributions on the Internet offer a different application. Requests for files, views of pages, or visits to sites can be ranked by frequency, often revealing a small head of highly requested objects and a long tail of infrequent ones. Here the measured item might be a page, domain, video, query string, or file, and the observation window can range from minutes to years. Automated traffic, recommendation systems, breaking events, and changing catalogs alter the resulting curve. Similar descriptive patterns occur in sales and cultural consumption, but the exponent is not fixed across products or periods.\n\nOther unequal distributions require particular caution. Lotka-type scientific productivity and species-abundance distributions can be compared mathematically with rank laws, but their empirical units and mechanisms differ. Citation networks also have growth dynamics absent from a fixed vocabulary model, while ecological samples are shaped by detection probabilities and sampling effort. Calling these patterns “Zipfian” is useful only when the measured variable, rank range, and approximation are specified. The resemblance of two rank curves is evidence of a shared statistical shape, not evidence that cities, words, organisms, and online resources obey one common causal law."
    },
    {
      "heading": "Generative mechanisms",
      "text": "One major explanation uses preferential attachment, in which an item already observed frequently is more likely to receive another occurrence. In Simon’s model, each step introduces a new category with probability \\(\\rho\\); otherwise, an existing category is selected in proportion to its current count. This combines innovation with cumulative advantage. Older or initially fortunate categories tend to become large because their existing size raises their probability of further growth.\n\nFor the idealized Simon process, the distribution of category sizes has an asymptotic exponent\n\n\\[\\alpha=1+\\frac{1}{1-\\rho}.\\]\n\nUsing the rank–density relationship gives a rank exponent \\(s=1-\\rho\\). When the innovation probability is small, the rank exponent is close to one. The model demonstrates how a simple stochastic process can generate a Zipf-like pattern without assuming that categories have been explicitly optimized. Its fixed innovation rate and age-dependent advantages are substantive assumptions, however, and observed vocabulary growth or item lifetimes may not match them.\n\nA second family of explanations uses Gibrat’s law of proportionate growth. In a simple form,\n\n\\[X_{t+1}=G_tX_t,\\]\n\nwhere the growth factor \\(G_t\\) does not systematically depend on current size. Taking logarithms converts growth into addition. Repeated independent multiplicative changes ordinarily suggest a lognormal distribution at a fixed age, rather than automatically producing a Pareto tail. Entry, exit, lower boundaries, resetting, and mixing across ages can change the long-run distribution. Suitable combinations yield power-law tails, but their exponent depends on the specific growth and boundary conditions.\n\nInformation-theoretic models instead examine trade-offs between diversity and cost. Suppose a distribution over ranks maximizes information entropy subject to a fixed average logarithmic rank cost. With constraints \\(\\sum_r p_r=1\\) and \\(\\sum_r p_r\\log r=c\\), a Lagrange-multiplier calculation gives\n\n\\[p_r\\propto e^{-\\lambda\\log r}=r^{-\\lambda}.\\]\n\nThis derives a power law from a specified optimization problem. It does not establish that logarithmic rank is the actual cost used by speakers or other agents, nor does the calculation alone require \\(\\lambda=1\\). The empirical interpretation of the constraint is the central explanatory issue.\n\nMixtures and hidden heterogeneity provide another route. Different topics, environments, or subpopulations may each have characteristic frequencies; combining them can yield a broad aggregate distribution even when individual components do not share the same scaling behavior. Random text-generation models can likewise produce approximate rank laws under some assumptions, without reproducing the structure of natural language. These examples establish a key limitation of explanation from distributional shape: Zipf-like scaling is compatible with multiple processes. Discriminating among them requires additional evidence, such as growth trajectories, innovation rates, temporal correlations, or changes induced by external conditions."
    },
    {
      "heading": "Variants, cutoffs, and related distributions",
      "text": "A widely used extension is the Zipf–Mandelbrot law,\n\n\\[p_r=\\frac{(r+q)^{-s}} {\\sum_{k=1}^{N}(k+q)^{-s}},\\]\n\nwhere \\(q\\) shifts the rank coordinate and the denominator normalizes the finite distribution. For \\(q=0\\), this reduces to the ordinary finite Zipf form. A positive shift softens the relative differences among the highest ranks. It can represent curvature near the head that a pure power law misses, although adding a parameter also makes fitting more flexible and increases the importance of model comparison.\n\nAn exponentially truncated model has the form\n\n\\[p_r\\propto r^{-s}e^{-r/r_c},\\]\n\nwhere \\(r_c\\) sets a characteristic cutoff scale. At ranks much smaller than \\(r_c\\), the exponential factor changes slowly and the model can resemble a power law. At much larger ranks, probabilities fall more quickly. Such a form can describe a system with a limited repertoire or additional suppression of rare items, but the fitted cutoff does not by itself identify the underlying constraint.\n\nBroken power laws use different exponents over different rank ranges. For word frequencies, this can accommodate a common-vocabulary region and a steeper rare-word region; for other applications it may reflect different growth regimes or a mixture of populations. Continuity at the breakpoint can be imposed, reducing the number of independent parameters. Yet an apparent break may also arise from incomplete sampling, a change in the definition of an item, or the combination of datasets. A fitted breakpoint is therefore a descriptive feature unless supported by a separate mechanism.\n\nThe lognormal distribution is an especially important alternative. It can generate a highly unequal set of sizes and a rank plot that appears nearly linear over a limited range. Stretched exponential distributions can also resemble power laws over restricted intervals. These models differ substantially outside the observed range, so extrapolations to extremely rare events or exceptionally large objects may depend more on model choice than on the visible quality of a plot.\n\nTerminology adds another complication. A “Zipf distribution” often means a discrete probability distribution on positive integers, whereas a “Zipf plot” may simply be an empirical plot of ordered sizes. A “zeta distribution” usually denotes the infinite-support form normalized by \\(\\zeta(s)\\). The Yule–Simon distribution, associated with preferential growth, has a power-law tail but is not identical at every integer to a zeta distribution. Distinguishing exact distributions from asymptotic equivalence matters when calculating probabilities for small values, comparing likelihoods, or interpreting deviations at the most frequent ranks."
    },
    {
      "heading": "Estimation and statistical assessment",
      "text": "Assessment begins with the data-generating and measurement process. The analyst must define an item, an observation, the sampling frame, and any threshold below which observations are absent. Word frequencies require a tokenization rule; city sizes require a geographic definition; online requests require decisions about automated traffic and repeated events. The empirical ranks are themselves estimated from these observations. When true frequencies are close, random variation can change their order, especially among rare items.\n\nFitting a straight line to a log–log plot using ordinary least squares is simple but often unreliable. Count variability is not constant across ranks, zeros cannot be logged, and ordering the observations creates dependencies. Discarding low counts or logarithmically binning observations changes the effective weighting. A high coefficient of determination shows that transformed points lie near a fitted line; it does not establish a particular probability model, the absence of systematic curvature, or the correctness of an exponent estimate.\n\nMaximum likelihood estimation is usually better suited to a specified distribution. If independent observations are generated from a fixed rank-probability model with known support \\(N\\), and \\(n_r\\) is the observed count of rank \\(r\\), then\n\n\\[\\ell(s) =-s\\sum_{r=1}^{N}n_r\\log r -T\\log H_{N,s}, \\qquad T=\\sum_{r=1}^{N}n_r.\\]\n\nThe estimate maximizes this expression. If ranks are assigned after inspecting the same counts, however, the labels are not externally fixed categories. If unseen types are possible, the support is also uncertain. These features require more care than simply inserting observed ranks into the likelihood.\n\nFor a continuous Pareto tail with fixed lower cutoff, a familiar estimator is\n\n\\[\\widehat{\\beta} =\\frac{n}{\\sum_{i=1}^{n}\\log(x_i/x_{\\min})}.\\]\n\nThis estimates the survival exponent \\(\\beta\\), not the rank exponent directly, and is not an exact formula for a discrete Zipf distribution. The cutoff \\(x_{\\min}\\) determines which observations are treated as belonging to the tail; estimating it changes both the sample size and the uncertainty of the exponent. A distribution fitted only above a high threshold may explain a small fraction of all observations.\n\nGoodness-of-fit can be evaluated by comparing empirical and fitted cumulative distributions and by simulating new datasets from the fitted model. When parameters or cutoffs have been estimated, they should generally be re-estimated within the simulated samples used to calibrate a test. Bootstrap sampling can help quantify uncertainty, while likelihood comparisons or predictive evaluation can distinguish power laws from alternatives. Dependence, such as words clustered within documents, requires corresponding adjustments to the sampling model. Failure to reject a Zipf model indicates compatibility with the test and data, not proof of an exact law."
    },
    {
      "heading": "Computational implications and unresolved questions",
      "text": "Zipfian demand has direct consequences for caching and storage. If requests are independent and an ideal cache holds the \\(K\\) most popular objects from a fixed catalog of size \\(N\\), its hit probability is\n\n\\[P_{\\mathrm{hit}}(K) =\\frac{H_{K,s}}{H_{N,s}}.\\]\n\nUnder the strict inverse-rank model, this is approximately \\((\\log K+\\gamma)/(\\log N+\\gamma)\\) when both quantities are sufficiently large. A relatively small collection of popular objects can therefore serve many requests, but a long tail continues to generate misses. Real caches face additional complications: finite object sizes, changing popularity, replacement policies, and correlations between requests.\n\nIn machine learning, unequal token frequencies mean unequal amounts of evidence. A common word or symbol may appear millions of times while a rare one appears only a handful of times. Parameters associated with rare items consequently have fewer direct observations, even when the total training set is very large. Subword representations partly change the unit of analysis by dividing uncommon words into reusable pieces. The resulting frequency curve is a property of both the source material and the segmentation procedure, rather than a tokenization-independent law.\n\nThe distribution also matters for compression. An ideal code length for an item of probability \\(p_r\\) is \\(-\\log_2 p_r\\) bits. For a Zipf model,\n\n\\[-\\log_2 p_r =\\log_2 H_{N,s}+s\\log_2 r.\\]\n\nThus ideal code length grows logarithmically with rank. This connects unequal frequencies with the logic of assigning short codes to common items and longer codes to rare ones. Actual text compression must also exploit sequence dependence and context: a rank distribution alone cannot account for the predictability supplied by grammar, repeated phrases, or document structure.\n\nA continuing theoretical question is why exponents near one occur so often, despite the many mechanisms capable of producing broader power-law families. Preferential growth, constrained optimization, and heterogeneous mixtures can each yield scaling, yet their predictions for the exponent and its stability differ. Important discriminating quantities include the rate at which new categories appear, the persistence of an item’s rank, growth rates conditional on size, and departures from scaling after changes in system organization.\n\nThe status of the law also depends on its intended precision. A finite dataset can support an approximately inverse-rank relationship across a stated range, but cannot establish exact scaling over unobserved ranks or future periods. Conversely, systematic departures are often scientifically informative rather than mere imperfections: curvature may reveal separate populations, changing innovation rates, finite resources, or a poorly chosen observational unit. Current research therefore treats the exponent, the scaling range, temporal behavior, and measurement process as distinct objects of investigation, rather than reducing the evidence to whether a single plotted line appears straight."
    }
  ],
  "links": [
    "power-law",
    "language",
    "probability",
    "information-theory",
    "probability-mass-function",
    "probability-distribution",
    "natural-logarithm",
    "riemann-zeta-function",
    "random-variable",
    "expected-value",
    "variance",
    "cumulative-distribution-function",
    "probability-density-function",
    "pareto-distribution",
    "urbanization",
    "economics",
    "internet",
    "stochastic-process",
    "lognormal-distribution",
    "information-entropy",
    "ordinary-least-squares",
    "coefficient-of-determination",
    "maximum-likelihood-estimation",
    "bootstrap-sampling",
    "machine-learning"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}