Moderate Growth Time Series for Dynamic Combinatorics Modelisation
Symbolic Computation
2007-08-17 v1 Multiagent Systems
Combinatorics
Abstract
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.
Cite
@article{arxiv.0708.2213,
title = {Moderate Growth Time Series for Dynamic Combinatorics Modelisation},
author = {Luaï Jaff and Gérard H. E. Duchamp and Hatem Hadj Kacem and Cyrille Bertelle},
journal= {arXiv preprint arXiv:0708.2213},
year = {2007}
}