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

F Cecconi, A Politi

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The n-tree approximation scheme, introduced in the context of random directed polymers, is applied here 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. 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.

Original languageEnglish
Pages (from-to)4998-5003
Number of pages6
JournalPhysical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
Volume56
Issue number5
Publication statusPublished - Nov 1997

Keywords

  • DIRECTED POLYMERS
  • 1/D EXPANSION
  • CHAOS
  • SYSTEMS

Cite this