{'fraction_non_alphanumeric': 0.03656079893703656, 'fraction_numerical': 0.011615447259011615, 'mean_word_length': 4.834458614653664, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 7, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Coupling-induced periodic windows in networked discrete-time systems

Networked nonlinear systems present a variety of emergent phenomena as a result of the mutual interactions between their units. An interesting feature of these systems is the presence of stable periodic behavior even when each unit oscillates chaotically if in isolation. Surprisingly, the mechanism in which the network interaction replaces chaos by periodicity is still poorly understood. Here, we show that such an onset of regularity can occur via replication of periodic windows. This phenomenon multiplies the stability domains in the system parameter space, not only suppressing chaos but also making the network less vulnerable to external disturbances such as shocks and noise. Moreover, we observe that the network cluster synchronizes for the parameters corresponding to the replica periodic windows. To confirm these observations, we employ the formalism of the master stability function demonstrating that the complete synchronized state is indeed transversally unstable in the replica windows.

In the last two decades, many efforts have been devoted to quantifying the stability of networks composed of dynamical units. In this direction, reliable approaches to assess both linear [1][2][3] and global [4,5] stability of synchronized states are available. However, the stability of the synchronized behavior is not the only concern, for the sake of the network's plain functioning, additional attention is required to harness possible unstable behavior.
In particular, the occurrence of chaotic behavior in many applications is one type of instability that threatens the system's functioning with unpredictability and large solution variability. In this scenario, several approaches have been developed to control chaos in low-dimensional systems [6][7][8][9] and some of them were also applied to high-dimensional systems [10][11][12]. Interestingly, often lowdimensional chaotic systems spontaneously exhibit stable periodic behavior when networked, e.g., coupled with identical copies of themselves [13][14][15][16]. In addition, networks of coupled discrete-time systems have been investigated in the context of synchronization [17][18][19], partial synchronization patterns [16,[20][21][22], switching in time between different types of partial synchronization patterns [23] or sub-patterns [24]. However, much less attention has been paid to the investigation of complex periodic windows in such networks. Moreover, despite of the general knowledge about the bifurcations giving rise to periodicity, the mechanisms in which the mutual interactions within the network establish stable periodic behavior in a collection of chaotic systems are not completely understood.
To shed light on these mechanisms, one may consider the occurrence of mutual disturbances among the network units as a starting point. From this perspective, the concept of non-feedback methods for suppressing chaos can be applicable. In general, these techniques are characterized by external interventions in the system dynamics aiming to suppress chaotic behavior without destroying the system's main characteristics. In particular, for periodically driven systems, a very effective non-feedback method to eliminate chaotic behavior is the addition of a second periodic forcing with a small amplitude to the system dynamics [25][26][27][28][29][30][31][32][33]. Remarkably, this extra periodic forcing has been found not only to mitigate chaos for individual p-1 arXiv:2201.07672v1 [nlin.AO] 6 Dec 2021 sets of system parameters but for large extensions of the system parameter space [34,35]. Specifically, the weak periodic forcing replicates intervals of the system parameter space containing parameters leading to stable periodic behavior, i.e., periodic windows. Generally, the replica windows contain stable periodic orbits with the same period and stability characteristics as the ones populating the original window. This phenomenon has been called replication of periodic windows [34,35].
Following these developments, the multiplication of periodic windows has been observed also for discrete-time systems in which an external time-alternating perturbation creates identical copies of pre-existing periodic windows [36]. Interestingly, in this study, the period of the perturbation corresponds to a multiplication factor to the number of periodic windows. The system exhibits duplication, triplication, and quadruplication of periodic windows when the perturbation is of periods two, three, and four, respectively [36]. Later on, the same phenomenon has been proposed as a mechanism to increase the availability of stable domains and, consequently, reduce the effects of noise and parameter inaccuracies in dynamical systems such as the Hénon map, Langevin equation, and Chua's circuit [37]. Moreover, replication of periodic windows has been recently shown to occur in a model for two asymmetrically coupled neurons [38]. Coupling asymmetries have been also demonstrated to suppress chaotic behavior in larger oscillator networks [39] whereas unit asymmetries (heterogeneity) can also induce synchronous states [40][41][42].
Here, we report that the replication of periodic windows is an intrinsic mechanism for the onset of periodicity in symmetrical networks of identical discrete-time units. More specifically, we demonstrate that the mutual interaction among the units replaces the periodic perturbations and, the replication of periodic windows occurs in these systems without external interventions. We first show how the distance between the replica windows depends on the coupling intensity among the units. Next, we investigate the interplay between the synchronized behavior of the network and the replication of periodic windows. We observe that original periodic windows correspond to states of complete synchronization in the network, while in replica windows, the network contains phase cluster states. These states are characterized by network clusters containing completely synchronized units oscillating out-of-phase with other clusters. Remarkably, we observe replica periodic windows in which the number of phase clusters equals the total number of units in the system, this solution corresponds to traveling waves in the network. Finally, we implement the formalism of the master stability function to demonstrate that completely synchronized states are transversally unstable for the parameters composing the replica periodic windows. This confirms the general occurrence of the phase clusters.
Network Model. -We consider a network of identical one-dimensional discrete-time units diffusively coupled via their defining function. Each unit is coupled to its first neighbors and periodic boundary conditions are adopted. The dynamical equation describing this system is given by: where the variable θ t i defines the dynamical state of the unit i with i = 1, . . . , N at a discrete-time t. The constants σ and N control the coupling strength among the maps and the network size, respectively. The set D i prescribes the adjacency of a unit i, while the constant D i is the respective number of units connected to i. The local dynamics of the network is given by the Circle map f (θ) = θ + Ω − K 2π sin(2πθ). The behavior of this particular map is determined by two control parameters, defining a two-dimensional parameter space K × Ω. This parameter plane contains the periodic windows of interest in this work, constituting the sole reason for our choice of this particular system. In Fig. 1, we show a schematic of the coupling structures approached through the text. Coupling-induced Replications. -To effectively demonstrate the replication of periodic windows in the parameter space of the network, we first examine the parameter space of the uncoupled system, i.e., σ = 0 in Eq. (1). For that, in Fig. 2(a), we color code the period p (periodp) of orbits occurring in a subset of the parameter plane K × Ω of the map. The parameter pairs corresponding to orbits with p ≤ 20 are marked with different colors (see color bar), the points corresponding to p > 20 are marked in gray, while black corresponds to chaotic behavior. The periodic window O in Fig. 2(a) is a typical structure of periodicity in the parameter space of nonlinear dynamical systems known by different names such as crossroad area [43], shrimp-shaped window [44], compound window [45], among others [46,47]. These windows have been observed in the parameter space of low-dimensional mathematical models of a number of systems [48][49][50][51][52][53][54][55][56][57][58] and in laboratory experiments with electronic circuits [59][60][61]. The bifurcations delimitating these windows are well understood. Typically, a saddle-node bifurcation (boundary between the black and apricot regions in Fig. 2(a)) gives rise to the main period-2 orbit in the window. In turn, this orbit undergoes period-doubling, creating subharmonic period-4 (brown region) orbits which underlie the next segment of the periodic window. The successive period-doubling bifurcations develop the periodic orbits into a chaotic attractor (upper boundary in Fig. 2(a)). We now consider the coupled system with N = 4 as in the schematic shown in Fig. 1(b). For σ = 0.125 in Fig. 2(b), we observe that, due to the network coupling, the original periodic window is multiplied by three. With this, a substantial portion of the parameter plane K × Ω corresponding to chaotic behavior at the level of each isolated map leads to stable periodic behavior in the network. Interestingly, the two new replicated windows possess the same period-2 main periodic orbit as the one previously existing in the uncoupled map. In contrast, the subharmonic orbits present in the original window are not entirely preserved in the replicas, they appear intermingled with irregular solutions. For instance, notice in the brown regions in Fig. 2(b) and Fig. 2(c) that the windows corresponding to subharmonic orbits are most affected at their borders, coinciding with regimes of slow convergence to the periodic orbits. These parameter regions are prone to the onset of additional attractors due to the network coupling. The coexistence of the subharmonic orbits with irregular solutions in these regions gives their observed riddled aspect. Next, in Fig. 2(c), by increasing the coupling strength among the network units, for σ = 0.22 we observe that the periodic windows move apart from each other. This ability offers a level of controllability to the network, making possible the suppression of chaos in predetermined regions of the parameter space or tuning the network to exhibit periodic trajectories with the desired period.
The results in Fig. 2 suggest the replication of periodic windows as a mechanism for the appearance of stable periodic behavior in networked systems. However, the replication occurs locally in the system parameter space for windows containing orbits with a given period. In different regions of the parameter space, the network coupling may as well replace periodic windows of the uncoupled system by irregular behavior. This raises the question about the net effect of the network coupling in a large portion of the parameter space. To shed light on this issue, we estimate the intervals of the K × Ω plane leading to stable periodic orbits. For that, we define a finite region of the parameter The pairs (Ω, K) resulting in stable periodic orbits are identified by their largest Lyapunov exponent Λ 1 < 0, and denoted by S. Then, we estimate the regularity-index α as the intersection of S and E: With this, we investigate the local abundance of stable periodic orbits in the system's parameter space by computing α as a function of the network parameters. First, in Subsequently, the regularity index decreases to the levels of the uncoupled system due to the disappearance of the window B. Next, to gather more insights on the stability gains, in Fig. 3(b), we compute α for different network sizes N . The most striking characteristic of these results is the strong influence of the parity of N on α. The regularity index is significantly higher for networks of even sizes, this behavior is already a clue to the mechanism underlying the replications. Specifically, we demonstrate later that the formation of phase cluster synchronization is essential for the phenomenon. In special, for the investigated parameter region, networks with an even number of units favor the stability of periodic orbits with even periods due to the possibility of symmetric distributions of units in the attractors. Considering the period-2 orbit, which dominates the periodicity region (apricot color in Fig. 2), for an even N , the phase cluster state is composed of two clusters with N/2 units in each part of the attractor. For an odd N this symmetry is broken and the stability is no longer favored. This parity preference is due to the balance between the coupling in networks with even sizes and the attractors of the local dynamics with even periods. One can see in Fig. 3(b) that for odd network sizes, N = 7 and N = 9, the stability gain decreases significantly. Another consequence of the symmetric organization of the units in the attractors extension, is the optimal network size N = 4 for the stability gain seen in Fig. 3(b). This occurs because, for the specific coupling intensity considered in this figure, the network size N = 4 is the configuration providing the largest number of different phase clusters. Finally, the regularity index decreases p-3 for larger N , we attribute this decline in the stability gain to the onset of phenomena in higher dimensions that generally difficult the occurrence of periodic windows, e.g., multistability, hyperchaos, and long-lasting transients in large networks [62,63]. Since the networks addressed in this study are composed of identical units, one possible solution for these systems is complete synchronization. For this behavior, each map in the network evolves identically in time. As a consequence, the coupling term in Eq. (1) vanishes and the maps exhibit the solution of the uncoupled case. Therefore, the occurrence of completely synchronized states is incompatible with the replacement of chaotic orbits by stable periodic ones. Hence, next, we unravel the interplay between synchronization and the replication of periodic windows in the network parameter space. First, we introduce a global synchronization measure to detect synchronous behavior among the units as: computed over a time interval of length T = 500 after a transient is disregarded. In Fig. 4(a), for N = 4 and σ = 0.22, we obtain the synchronization error E sync as a function of the parameters K and Ω, for which the replication of periodic windows takes place in the parameter space (same parameters as in Fig. 2(c)). We observe that the parameters composing the original periodic window O corresponds to E sync = 0, i.e., the complete synchronized solution (dark blue in Fig. 4(a)). In Fig. 4(b), we show the time evolution for a parameter set from the original periodic window illustrating the complete synchronized behavior, θ t 1 = θ t 2 = θ t 3 = θ t 4 around the period-2 orbit. Conversely, in Fig. 4(a), we observe that the two replica windows, A and B, corresponds to network solutions with E sync = 0. Therefore, inside these windows, the network is synchronized in frequency, but not in phase. In addition, the values of E sync are close to uniform inside the respective windows, indicating the occurrence of only one synchronization pattern within the window. However, the values of E sync differ among the replica windows, i.e., syn-chronization patterns are not the same for different replica windows. In fact, by obtaining the time evolution for a parameter set in window B, in Fig. 4(c), we observe the formation of two phase clusters containing two completely synchronized units around the period-2 orbit, i.e., θ t 1 = θ t 2 , θ t 3 = θ t 4 and θ t 2 = θ t 3 . For a parameter set in window A, two different phase clusters are formed θ t 1 = θ t 3 , θ t 2 = θ t 4 , and with θ t 2 = θ t 3 around the same period-2 orbit, producing a larger synchronization error. In addition, for σ → 0, all three network synchronization patterns discussed in Fig.  4 coexist in the region of the original periodic window. For larger networks (as in Fig. 1(c)), the number of phase clusters in the replica windows will vary and produce a diversity of solutions. For p < N , the synchronized states are clustered in different phases of the periodic orbit, for p > N not all possible phases available in the periodic orbit are occupied. One interesting scenario emerges when the number of different phase clusters equals the network size p = N , i.e., all units are out of phase around the same periodic orbit. This configuration results in replica windows containing waves traveling along the network as a solution. We illustrate this behavior for different network sizes in Figs. 5(a)-5(f). In these figures, the windows containing the traveling waves are marked with the respective period of their orbits. The periods match the size of the respective network sizes.
In Fig. 6(a), for N = 9 (Fig. 5(e)), we obtain a spacetime plot to show the corresponding traveling wave solution in the network. In Fig. 6(b), we show the time evolution of all units in the network exhibiting different phases in a period-9 orbit, i.e., θ t 1 = . . . = θ t 9 . Note that some units possess very similar phases, which indicates small deviations in the phases are preventing complete synchronization and, consequently, chaotic oscillations.
In this section, we observe that the appearance of replica periodic windows is associated with phase cluster states of the network. Therefore, one may conclude that the p-4 Coupling-induced periodic windows in networked discrete-time systems  onset of such windows requires the absence of completely synchronized states in the network. In the next section, we confirm this possibility by obtaining the transversal stability of complete synchronized states.
Mechanism. -Now, we demonstrate the connection between complete synchronization being transversally unstable and the onset of replica periodic windows in the network. For that, we employ the formalism of the master stability function (MSF) for networked discrete-time systems. We first write the dynamical equation describing the network in a more general form: (1). (4) Different from the original system defined in Eq. (1), in which the maps are diffusively coupled via their defining function f (θ t ), in Eq. (4), the maps are coupled by a linear coupling function h(θ t ). This facilitates the implementation of MSF and it also exemplifies the occurrence of our reported phenomenon in a different network setup. The coupling matrix G satisfies the condition N j=0 G ij = 0 for any i and it can be diagonalized with a set of eigenvalues {λ i , i = 1, . . . , N }. Perturbing the solution θ t of Eq. (4) as δθ t ≡ θ t − s(t), we obtain the following variational: where The largest Lyapunov exponent of Eq. (7) yields the MSF Ψ Ω,K (γ) for a network topology specified by the parameter γ containing Circle maps defined by Ω and K. For two maps coupled as shown in Fig. 1(a), the coupling matrix G is written as: with eigenvalues λ 1 = 0 and λ 2 = −2. The eigenvalue λ 1 = 0 does not influence the transversal stability of completely synchronized states since it corresponds to an eigenvector tangent to it. Now, we first demonstrate the occurrence of replication of periodic windows for the coupling scheme adopted in Eq. (4) and for G prescribed by the matrix in Eq. (8). By computing the largest nonzero Lyapunov exponent Λ 1 , for σ = 0.3, we show in Fig. 7(a) the onset of one replica window marked with the letter A. Next, we fix the parameter Ω = 0.5 and analyze the transversal stability via MSF as a function of K in the interval [5.0,6.5], i.e., the dashed line in Fig. 7(a) crossing the original window O and the replica A. Hence, in Fig. 7(b), we validate our estimative of Ψ Ω,K (γ) by comparing it with the synchronization error E sync defined in Eq. (3). In this figure, we observe that Ψ Ω,K (γ) is successfully describing the stability of the synchronized state, i.e., Ψ Ω,K (γ) < 0 for E sync = 0. Hence, in Fig. 7(c), we demonstrate that, in fact, the synchronized state is transversaly unstable Ψ Ω,K (γ) > 0 in the parameter region corresponding to the replica window with Λ 1 < 0, red in Fig. 7(c). Therefore, once the completely synchronized solution is unstable, the network approaches the phase cluster configuration allowing the out-of-phase behavior of the maps close of a stable periodic orbit composing the solutions observed for the replica windows.
Conclusions. -In summary, we investigate the role of the coupling in establishing regularity in the state-space of a networked system of discrete-time units. We observe the onset of stable periodic orbits occurring via replications of periodic windows in the parameter space of these systems. This phenomenon implies a significant gain to the stability domain of the network, enabling not only suppression of chaos for large regions of the system parameter space, but also increasing the system robustness to external perturbations such as localized shocks or noise. We characterize the dependence of the reported phenomenon regarding the main network parameters, i.e., network size and coupling intensity. We found the existence of optimal values of these parameters for the replications to occur. In particular, we emphasize that the replication phenomenon is very well observed in small networks. For networks with a high number of units, it may be difficult to visualize this phenomenon. In higher dimensions, the possibility of solutions with a larger number of positive Lyapunov exponents increases. For this case, the periodic windows are not well defined. Moreover, for larger networks, the trapping of trajectories in nonattracting chaotic sets dwelling inside periodic windows desynchronizes the network for times that are indefinitely long.
Moreover, we report that the replication of periodic win-dows occurring in networked systems is closely related to the phenomenon of cluster synchronization networks. More specifically, since our network is composed of identical units, the occurrence of complete synchronization reduces the state-space dynamics to the uncoupled behavior. Consequently, there would not be the onset of new stable periodic orbits in the system. However, we verify that the network solution in the replica windows is cluster synchronized. The units are completely synchronized within clusters but out of phase from one cluster to another. These phase clusters spontaneously generate the internal disturbances to replicate the periodic windows of the adopted map. We show that, in a peculiar case in which the number of phase clusters equals the network size, traveling waves arise in the network state-space where all units are out-of-phase around the same periodic orbit. Finally, we employ the master stability function analysis to demonstrate that the occurrence of replica windows requires the completely synchronized states to be transversally unstable. * * *