N-tree approximation for the largest Lyapunov exponent of a coupled-map lattice

Abstract

The N-tree approximation scheme, introduced in the context of random directed polymers, is here applied to the computation of the maximum Lyapunov exponent in a coupled map lattice. We discuss both an exact implementation for small tree-depth $n$ and a numerical implementation for larger $n$s. We find that the phase-transition predicted by the mean field approach shifts towards larger values of the coupling parameter when the depth $n$ is increased. We conjecture that the transition eventually disappears.

arXiv commentRevTeX, 15 pages,5 figures

Cited by in corpus (1)

• Chaos in the Hamiltonian mean field model