Parameter space reduction criteria to search for synchronization domains in coupled discrete systems

Based on analytical considerations, we introduce criteria that enable us to encapsulate the parameter domains for which chaotic synchronization in linearly coupled map systems may be attained. Our aim is to provide means to readily determine parameter regions which preclude synchronization. This results in a significant reduction of parameter space that one needs to explore. Our findings hold for both identical and quasi-identical (small parameter mismatch) maps subjected to unidirectional and bidirectional coupling. As a testing ground we present numerical calculations for the logistic and cubic maps which validate the predictive capability of our approach. Our main contribution relies on the applicability of one of our criteria to experimental situations. Since in real life it is almost impossible to construct two truly identical systems, the results for quasi-identical maps are of particular relevance.