“…In the case of unknown time series embedded in geometrical spaces with arbitrary values for the embedding dimension d and the time delay τ, this simplified procedure cannot be applied; in this case, the estimation of the Lyapunov exponent is performed by using a lot of different algorithms (Bremen, Udwadia, & Proskurowski, 1997;Brown, Bryant, & Abarbanel, 1991;Bryant, Brown, & Abarbanel, 1990;Chistianssen & Rugh, 1997;Diakonos, Pingel, & Schmelcher, 2000;Hegger, 1999;Oiwa & Fielder, 1998;Oiwa & Fielder, 2002;Pyragas, 1997;Rosenstein, Collins, & de Luca, 1993;Sano & Sawada, 1985;Wright, 1984) each one of them has its own advantages and disadvantages and its own speed and accuracy. In this project this task is performed by the Wolf's algorithm (Wolf, Swift, Swinney, & Vastano, 1985), that allows the estimation of the largest positive Lyapunov exponent of an unknown time series; the main idea behind this algorithm, is the selection of a trajectory point, the identification of its nearest spatial neighbor and the measurement of their distance as they evolve in time by t e (this parameter is known as evolution time).…”