Information Theory Meets Power Laws

Bibliography

1. Aarseth, E.J. (1997). Cybertext: Perspectives on Ergodic Literature. Baltimore, MD: Johns Hopkins University Press.
2. Adams, T.M. and Nobel, A.B. (2010). Uniform convergence of Vapnik‐Chervonenkis classes under ergodic sampling. The Annals of Probability 38 (4): 1345–1367.
3. Adger, D. (2019). Language Unlimited: The Science Behind Our Most Creative Power. Oxford: Oxford University Press.
4. Ahlswede, R., Balkenhol, B., and Khachatrian, L.H. (1996). Some properties of fix‐free codes. Proceedings of the 1st INTAS International Seminar on Coding Theory and Combinatorics, 1996, Thahkadzor, Armenia, pp. 20–33.
5. Algoet, P.H. and Cover, T.M. (1988). A sandwich proof of the Shannon‐McMillan‐Breiman theorem. The Annals of Probability 16: 899–909.
6. Allouche, J.‐P. and Shallit, J. (2003). Automatic Sequences. Theory, Applications, Generalizations. Cambridge: Cambridge University Press.
7. Altmann, G. (1980). Prolegomena to Menzerath's law. Glottometrika 2: 1–10.
8. Altmann, E.G., Pierrehumbert, J.B., and Motter, A.E. (2009). Beyond word frequency: bursts, lulls, and scaling in the temporal distributions of words. PLoS ONE 4: e7678.
9. Arratia, R. and Waterman, M.S. (1989). The Erdös‐Rényi strong law for pattern matching with a given proportion of mismatches. The Annals of Probability 17: 1152–1169.
10. Baayen, R.H. (2001). Word frequency distributions. Dordrecht: Kluwer Academic Publishers.
11. Barron, A.R. (1985a). The strong ergodic theorem for densities: generalized Shannon‐McMillan‐Breiman theorem. ...