Moderate Growth Time Series for Dynamic Combinatorics Modelisation

Luaï Jaff (1) , Gérard H.E. Duchamp (1) , Hatem Hadj Kacem (2) , Cyrille Bertelle (3)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 MIRACL - Multimedia, InfoRmation systems and Advanced Computing Laboratory
3 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes

Here, we present a family of time series with a simple growth constraint. This family can be the basis of a model to apply to emerging computation in business and micro-economy where global functions can be expressed from local rules. We explicit a double statistics on these series which allows to establish a one-to-one correspondence between three other ballot-like strunctures.

Mots clés: Time series; Complex systems; Growth constraint; local rules; Dyck words; Permutations; Codes

Domaines: Calcul formel [cs.SC]; Complexité [cs.CC]; Système multi-agents [cs.MA]; Combinatoire [math.CO]

Luaï Jaff, Gérard H.E. Duchamp, Hatem Hadj Kacem, Cyrille Bertelle. Moderate Growth Time Series for Dynamic Combinatorics Modelisation. ECELM-2, Jun 2006, Tirgu-Mures, Romania. ⟨hal-00167108⟩