Matrix Multinomial Systems with Finite Syntax

Rudolf Hanel


Typically, describing complex processes and the sequences of events they generate requires both statistical and structural information. Statistical information alone does not suffice when intrinsic constraints allow a process to produce well-formed sequences of events but not others. Typically, processes become history dependent; the multiplicity of well-formed sequences with identical histogram and derived concepts, entropy for instance, start to depend on the structure, the grammar, of the underlying process. We demonstrate that for a sufficiently well behaved class of complex processes, it is possible to derive an exact criterion for deciding whether a sequence of arbitrary length is well formed or not. The approach is based on representing events by matrices and sequences of events by products of respective matrices. Formally such processes have a multinomial structure only that the elements are not numbers, but matrices. We demonstrate the approach by applying it to enumerate the well known Oslo sand-pile model, resulting in an elegant formula for the number of stable attractor states for Oslo sand-piles of arbitrary size.


  1. Bandt C. and Pompe B. (2002), Permutation Entropy: A Natural Complexity Measure for Time Series, Phys. Rev. Lett. 88 174102.
  2. Corominas-Murtra B., Hanel R., and Thurner S. (2015), Understanding scaling through history-dependent processes with collapsing sample space, Proc. Nat. Acad. Sci. USA 112 5348-5353.
  3. Corral A. (2004), Calculation of the transition matrix and of the occupation probabilities for the states of the Oslo sandpile model, Phys. Rev. E 69 026107;
  4. Fontana W. (1991), Algorithmic Chemistry, In Artificial Life II, SFI studies in the Sciences of Complexity (Eds.: Langton, C.G.; Taylor C.; Farmer, D.; Rasmussen, S.) Addison-Wesley 1991; 159-209.
  5. Hanel R., Thurner S., and Gell-Mann M. (2014), How multiplicity of random processes determines entropy: derivation of the maximum entropy principle for complex systems, Proc. Nat. Acad. Sci. USA 111 6905- 6910.
  6. Hanel R., Corominas-Murtra B., and Thurner S. (2015), Analytical computation of frequency distributions of path-dependent processes by means of a non-multinomial maximum entropy approach, arXiv:1511.00414.
  7. Miller G.A. and Chomsky N. (1963) Finitary models of language users, In Handbook of Mathematical Psychology (Ed.: D. Luce) John Wiley & Sons, 419-491.
  8. Shannon C.E. (1948), A Mathematical Theory of Communication, Bell Syst. Tech. J. 27 379-423, 623-656.
  9. Kullback S. and Leibler R.A. (1951), On information and sufficiency, Ann. Math. Stat. 22 79-86.
  10. Pólya G. (1930), Sur quelques points de la théorie des probabilités, Ann. Inst. Henri Poincare 1 117-161.
  11. Wolpert, D.H. and Macready W.G. (1996), No free lunch theorems for search, Technical Report, SFI-TR-95- 02-010, Santa Fe Institute.
  12. Zurek W. H. (1989), Thermodynamic cost of computation, algorithmic complexity, and the information metric, Nature 341 119-124.

Paper Citation

in Harvard Style

Hanel R. (2016). Matrix Multinomial Systems with Finite Syntax . In Proceedings of the 1st International Conference on Complex Information Systems - Volume 1: COMPLEXIS, ISBN 978-989-758-181-6, pages 26-31. DOI: 10.5220/0005877100260031

in Bibtex Style

author={Rudolf Hanel},
title={Matrix Multinomial Systems with Finite Syntax},
booktitle={Proceedings of the 1st International Conference on Complex Information Systems - Volume 1: COMPLEXIS,},

in EndNote Style

JO - Proceedings of the 1st International Conference on Complex Information Systems - Volume 1: COMPLEXIS,
TI - Matrix Multinomial Systems with Finite Syntax
SN - 978-989-758-181-6
AU - Hanel R.
PY - 2016
SP - 26
EP - 31
DO - 10.5220/0005877100260031