This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Distance dependent competitive interactions in a frustrated network of mobile agents

Sayantan Nag Chowdhury, Soumen Majhi, and Dibakar Ghosh S. Nag Chowdhury, S. Majhi and D. Ghosh are with the Physics and Applied Mathematics Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata 700108, India.
E-mail: [email protected] (D. Ghosh)
Abstract

Diverse collective dynamics emerge in dynamical systems interacting on top of complex network architectures. Along this line of research, temporal network has come out to be one of the most promising network platforms to investigate. Especially, such network with spatially moving agents has been established to be capable of modelling a number of practical instances. In this paper, we examine the dynamical outcomes of moving agents interacting based upon their physical proximity. For this, we particularly emphasize on the impact of competing interactions among the agents depending on their physical distance. We specifically assume attractive coupling between agents which are staying apart from each other, whereas we adopt repulsive interaction for agents that are sufficiently close in space. With this set-up, we consider two types of coupling configurations, symmetry-breaking and symmetry-preserving couplings. We encounter variants of collective dynamics ranging from synchronization, inhomogeneous small oscillation to cluster state and extreme events while changing the attractive and repulsive coupling strengths. We have been able to map all these dynamical behaviors in the coupling parameter space. Complete synchronization being the most desired state in absence of repulsive coupling, we present an analytical study for this scenario that agrees well with the numerical results.

Index Terms:
Time varying networks, Mobile agents, Extreme events, Synchronization, Inhomogeneous small oscillation.

1 Introduction

Complex network [1, 2] is the unifying paradigm behind many scientific disciplines ranging from physics, mathematics to computer science and biology. Besides the study related to local and global statistical properties of complex networks [3], researchers are equally interested in paying attention to the dynamics of their interacting units [4]. Among those collective dynamics, a widely studied phenomenon is that of synchronization [5, 6, 7, 8, 9, 10, 11, 12] of coupled oscillators arranged over the constituents of complex networks. Although, in recent times, there have been attempts in examining synchronizability of time-varying networks with different underlying structural arrangements, in most of these studies of synchronization, the nodes of the complex networks are spatially static. But, in real world networks, the individuals (nodes) move around and exchange information within close proximity. Such nodes in the contextual literature are well known as mobile agents [13, 14, 15, 16, 17, 18, 19, 20, 21] referring to those nodes whose movement highly influence the systems’ collective dynamics. But, in general, the states of those oscillators situated on top of those agents do not affect the agents’ mobility. The studies on the process of synchronization in mobile agents [22, 23, 24, 25, 26, 27, 28] have, so far, primarily concentrated on those particular cases when the mobile agents interact with each other only when they are closed enough in space. But, in all of these studies, the network architecture, i.e.,  how the oscillators are connected with each other, depends only on the attractive interaction. So, a basic query arises that how is the flow of information gets affected when different types of interactions are present in the movement. For instance, an attempt to answer this question can be made while incorporating repulsive coupling with the attractive one in such a networked system. Such co-existing dynamical interactions can be observed in a variety of systems and have been studied previously in different network set-ups yielding diverse collective states [29, 30, 31, 32, 33].

Synergy of attractive-repulsive coupling can lead to several interesting dynamical behaviors. One of such example is the emergence of solitary states in multiplex networks [34] possessing positive inter-layer and negative intra-layer interactions. Earlier, Maistrenko et al. [35] found a variety of stationary states in networks of globally coupled identical oscillators with attractive and repulsive interactions. Sathiyadevi et al. [36, 37] found diverse chimera states due to the introduction of nonlocal repulsive coupling together with an attractive coupling in a network of coupled oscillators. Also, interplay between “conformists” and “contrarians” leads to traveling wave along with the stationary states [38]. The effect of competitive interactions on the synchronization manifold among globally coupled identical Van der Pol oscillators through their velocities is rigorously addressed in ref. [39]. Even, the presence of a tiny fraction of repulsive couplings is found to enhance the synchronization of nonidentical dynamical units that are attractively coupled in a small-world network [40]. Origination of dragon-king-like extreme events as a result of the coexistence of excitatory and inhibitory chemical synaptic couplings is reported in the ref. [41]. Besides emergent dynamical patterns, co-presence of attractive and repulsive couplings carry high significance to several biological [42], physical [43], ecological [44] and even social scenarios [45].

Recently, Nag Chowdhury et al. [46] proposed an universal 0π0-\pi rule to identify the bipartiteness of networks from the anti-phase synchronization states. This article describes such a system of attractively coupled oscillators with negative links as frustrated networks [47]. Such frustrated systems under the influence of attractive-repulsive co-existing interactions may induce unanticipated phenomenon, like extreme events [48]. Most of the existing articles [49, 50, 41, 51, 52] on extreme events in dynamical systems and networks define such an event as rare event. Mathematically, a rare event is defined on a probability space χ\chi equipped with a σ\sigma-algebra 𝔹\mathbb{B} of events such that P(A)P(A) is small, where PP is the probability measure designed to quantify the probability of the occurrence of any event A𝔹A\in\mathbb{B}. But, extreme events can be rare events [53, 54, 55], or they can often be frequent in time and space [56, 57, 58, 59]. Examples of such intermittent frequent extreme events include population size of Paris [60], the bubbling of share market [61] before a crash and many more.

Along with its small occurrences, extreme event has another threat in the form of large impact. Financial and commodity market crashes, tsunamis, hurricanes, floods, epidemic disease spread, global warming-related changes in climate and weather, warfare and related forms of violent conflict, asteroid impacts, solar flares, acts of terrorism, industrial accidents, 8.0+ Richter magnitude earthquake are few examples of such large impact events. In dynamical systems, researchers are recently starting to measure the impact of such events in terms of the amount of variation from the central tendency of that observable [49, 41, 51, 62, 63, 64]. So, if ψ\psi is the observable defined on the state space UU to \mathbb{R}, then the extreme events are members of the set {uU:ψ(u)>HS}\{u\in U:\psi(u)>H_{S}\}, where HS=m+dσH_{S}=m+d\sigma with dd is the non-zero integer. Here, mm and σ\sigma are respectively the mean value and the standard deviation of all the peak values in a time series of uu. But, if HSH_{S} is too large, there will be very few values to model the tail of the distribution correctly as the variance is likely to be large due to only very extreme observations remaining. On the other hand, a low threshold value of HSH_{S} will include too many values giving a high bias. Recently, m+8σm+8\sigma is found to appropriate indicating extreme event threshold for Weibull distribution [65].

Inspired by these observations, we consider a frustrated network of limit cycle oscillators, where each node of the network is a mobile agent. Earlier all studies [66, 22, 23, 25, 27, 28, 65] related to mobile agents, considered only limited local interactions. Instead, we consider here a global network of mobile agents with co-existing switching interactions. Depending solely on the relative distance between the agents, attractive or repulsive interaction is activated. Specifically, we choose attractive interaction between those agents which are staying apart from each other, while we consider repulsive coupling for the agents that are sufficiently close. We consider two types of coupling schemes, namely symmetry-breaking and symmetry-preserving couplings. Under this set up, we explore the effect of coupling strengths which reveal quite interesting phenomena like cluster synchronization [67], complete synchronization, inhomogeneous small oscillation, extreme events etc. We also analytically derive the critical coupling strength for achieving complete synchronization using time-average Laplacian matrix in absence of repulsive interaction and numerically verify the results.

2 Mathematical framework

Refer to caption

Figure 1: Schematic diagram at a particular time: We consider N=3N=3 mobile agents in the two-dimensional XY-plane, where g=10g=10 and α=10\alpha=10. The red and black lines represent repulsive and attractive links, respectively.

We consider NN mobile agents which are moving independently on a two-dimensional (22D) physical plane S=[g,g]×[g,g]S=[-g,g]\times[-g,g]. Initially, the agents are randomly distributed on SS. The ii-th mobile agent can move in any direction with velocity (vcosθi(t),vsinθi(t))\big{(}v\cos\theta_{i}(t),v\sin\theta_{i}(t)\textbf{}) (any kind of collision among the agents are not allowed), where vv is the uniform moving velocity and θi\theta_{i} is drawn randomly from [0,2π][0,2\pi]. Higher values of velocity vv implies that the agents move the whole physical space and which increases the possibilities of interactions. Thus, if (pi(t),qi(t))\big{(}p_{i}(t),q_{i}(t)\big{)} is the position of the ii-th agent at time tt, then motion updating process will be maintained by the following relation,

pi(t+1)=pi(t)+vcos(θi(t)),qi(t+1)=qi(t)+vsin(θi(t)).\begin{split}p_{i}(t+1)=p_{i}(t)+v\cos\big{(}\theta_{i}(t)\big{)},\\ q_{i}(t+1)=q_{i}(t)+v\sin\big{(}\theta_{i}(t)\big{)}.\end{split} (1)

Refer to caption

Figure 2: Variation of degree distribution of a randomly chosen ii-th agent out of N=100N=100 mobile agents: (a) attractive neighbor and (b) repulsive neighbor. Each ii-th agent is connected with remaining (N1)(N-1) agents whenever α[0,22g]\alpha\in[0,2\sqrt{2}g]. Note that the numbers of attractive and repulsive neighbors both are widely spread. The simulation is carried out for t=3×105t=3\times 10^{5}. (c, d) Variation of degree of both matrices with respect to time tt: Just like the upper panel, we find that the neighbors of any agent are rapidly changing depending on the agent’s random movement. Here, we take g=10g=10 and α=10\alpha=10, and the uniform moving velocity v=2.0v=2.0.

If at some time tt, pi(t),qi(t)p_{i}(t),q_{i}(t) exceed |g||g|, then we re-generate a new θi(t)\theta_{i}(t) in [0,2π][0,2\pi] such that gpi(t),qi(t)g-g\leq p_{i}(t),q_{i}(t)\leq g. We define the distance between any two agents by the standard Euclidean metric as

dij(t)=(pi(t)pj(t))2+(qi(t)qj(t))2.d_{ij}(t)=\sqrt{\Big{(}p_{i}(t)-p_{j}(t)\Big{)}^{2}+\Big{(}q_{i}(t)-q_{j}(t)\Big{)}^{2}}. (2)

Next, we write the the dynamical equations characterizing the time-evolution of each agent (i=1,2,,Ni=1,2,\cdots,N) in the networked system as follows,

𝐱˙i=F(𝐱𝐢)+j=1N{kABij+kRCij}H(𝐱𝐢,𝐱𝐣),\dot{\mathbf{x}}_{i}=F(\mathbf{x_{i}})+\sum_{j=1}^{N}\{k_{A}B_{ij}+k_{R}C_{ij}\}H(\mathbf{x_{i}},\mathbf{x_{j}}), (3)

where 𝐱in\mathbf{x}_{i}\in\mathbb{R}^{n} is the state variable and F(𝐱𝐢)F(\mathbf{x_{i}}) is the corresponding vector field of the ii-th agent. Here H(𝐱𝐢,𝐱𝐣)H(\mathbf{x_{i}},\mathbf{x_{j}}) is chosen as the diffusive type coupling function, kA>0k_{A}>0 and kR<0k_{R}<0 respectively correspond to the attractive and repulsive coupling strengths. Moreover, BB and CC are the distance dependent adjacency matrices associated to the attractive and repulsive interactions such that

Bij={1,ifdij(t)>α0,ifdij(t)α,B_{ij}=\begin{cases}1,&\text{if}\hskip 2.84544ptd_{ij}(t)>\alpha\\ 0,&\text{if}\hskip 2.84544ptd_{ij}(t)\leq\alpha,\end{cases}

and

Cij={0,ifdij(t)>α1,ifdij(t)α,C_{ij}=\begin{cases}0,&\text{if}\hskip 2.84544ptd_{ij}(t)>\alpha\\ 1,&\text{if}\hskip 2.84544ptd_{ij}(t)\leq\alpha,\end{cases}

where α\alpha is the parameter lying within [0,22g][0,2\sqrt{2}g]. Here 22g2\sqrt{2}g is the maximum possible distance between any two agents lying in the 22-dimensional plane [g,g]×[g,g][-g,g]\times[-g,g]. At a particular instance, the agents whose Euclidean distance is less than α\alpha, repel to each other and repulsive interactions arise between them. Attractive coupling occurs between the agents when the distance between them is greater than α\alpha.

To illustrate this, we draw a schematic diagram with N=3N=3 mobile agents in the 22-dimensional plane [g,g]×[g,g][-g,g]\times[-g,g] in Fig. (1). At a particular time tt, we plot the position of these three agents in Fig. (1) where g=10g=10 and α=10\alpha=10 are considered. For these choices of α\alpha and gg, the adjacency matrices corresponding to attractive and repulsive interactions at that specific time instant look like

B=(011100100)B=\left(\begin{array}[]{ccccc}0&1&1\\ 1&0&0\\ 1&0&0\end{array}\right) and C=(000001010)C=\left(\begin{array}[]{ccccc}0&0&0\\ 0&0&1\\ 0&1&0\end{array}\right)

Now, we consider fix physical plane with g=10g=10 and fix the parameter α=10.\alpha=10. Each agents moving within the physical plane [g,g]×[g,g][-g,g]\times[-g,g] using the rule given in (1) with fixed velocity v=2.0v=2.0. Now we see the variation of degree distributions of the time-varying network. For this, we calculate the number of attractive and repulsive neighbors depending on the critical distance α\alpha. In Fig. 2, the degree distributions of moving agents for attractive and repulsive interactions are shown. We randomly select an agent which is moving with uniform velocity v=2.0v=2.0. We then find that the number of attractive neighbors are varying within the interval [5,92][5,92] (cf. Fig. 2(a)) and the number of repulsive neighbors of that agent is varying within [7,94][7,94] (cf. Fig. 2(a)). At any particular time-step, the sum of the number of attractive neighbors and the number of repulsive neighbors is N1N-1 for any ii-th agent. This scenario is well expressed by the lower panel of Figs. 2(c, d).

Now, on top of each mobile agent, a two-dimensional Stuart-Landau (SL) oscillator is placed where the state dynamics of each limit cycle oscillator is represented by

F(𝐱𝐢)=([1(xi2+yi2)]xiωiyi[1(xi2+yi2)]yi+ωixi),\begin{split}F(\mathbf{x_{i}})=\left(\begin{array}[]{c}\left[1-\left({x_{i}}^{2}+{y_{i}}^{2}\right)\right]x_{i}-\omega_{i}y_{i}\\ \\ \left[1-\left({x_{i}}^{2}+{y_{i}}^{2}\right)\right]y_{i}+\omega_{i}x_{i}\\ \end{array}\right),\end{split} (4)

where ωi=ω=3.0\omega_{i}=\omega=3.0 is the identical intrinsic frequency for each i=1,2,,Ni=1,2,\cdots,N.

We consider two types of diffusive interactions, namely symmetry-breaking coupling H(𝐱𝐢,𝐱𝐣)=(xjxi,0)TH(\mathbf{x_{i}},\mathbf{x_{j}})=({x_{j}}-{x_{i}},0)^{T} and symmetry-preserving coupling H(𝐱𝐢,𝐱𝐣)=(xjxi,yjyi)TH(\mathbf{x_{i}},\mathbf{x_{j}})=({x_{j}}-{x_{i}},{y_{j}}-{y_{i}})^{T}. The interesting and important part of this distance dependent coupling functions is for α=0,\alpha=0, the Eq. (3) becomes globally coupled network with attractive coupling only. In this case, movement of the agents does not effect the attractive adjacency matrix BB and the network becomes static. But, for α>0,\alpha>0, depending upon the values of attractive and repulsive coupling strengths kAk_{A} and kRk_{R}, two different cases can be implemented:

  1. 1.

    kA0k_{A}\neq 0 and kR=0:k_{R}=0: In this case, the mobile agents will interact attractively when the relative distance dijd_{ij} is greater than α\alpha and remain disconnected with each other when they are closed to each other and relative distance dijd_{ij} is less than equal to α\alpha. There is no repulsion among the agents. Here, synchronization is the most desired state for a suitable value of kA.k_{A}.

  2. 2.

    kA0k_{A}\neq 0 and kR0:k_{R}\neq 0: In this case, interplay between attractive and repulsive interactions is considered. During the spatial movement of the agents, they experience both types of interaction among them. Here, different states may arise, like inhomogeneous small oscillation, synchronization, extreme event and other intermittent states.

In the following section, we will explore the dynamics of the time-varying network (3) with two types of diffusive couplings and under above mentioned distinct coupling conditions. Our main emphasis will be to identify the parameter space by varying the two coupling strengths kAk_{A} and kRk_{R} with fixed values of other network parameters g=α=10.0g=\alpha=10.0 and v=2.0v=2.0 related to the movement of the agents.

3 Results

For numerical simulations, we integrate Eq. (3) using fifth order Runge-Kutta-Fehlberg method with a integration time step δt=0.01\delta t=0.01. At each integrating time step, θi(t)\theta_{i}(t) and thus vi(t)v_{i}(t) is updated according to rule given in (1) for each ii-th mobile agent (i=1,2,,Ni=1,2,\cdots,N). Hence, both the matrices BB and CC change at each integrating time step leading to fast switching approximation [68]. All simulations are done for fixed initial conditions

xi(0)=(1)iiN,yi(0)=(1)iiN,\begin{split}x_{i}(0)=(-1)^{i}\frac{i}{N},\\ y_{i}(0)=(-1)^{i}\frac{i}{N},\\ \end{split} (5)

unless stated otherwise 111 Inhomogeneous small oscillation depends crucially on the initial conditions, and the basin of attraction of this state is small. If the initial conditions are not chosen suitably from the basin of attraction, then the trajectories may converge to a different periodic attractor. However, other observed dynamical states can be reached from any random initial conditions starting from [1,1]×[1,1][-1,1]\times[-1,1].. In this Sec. (3), the symmetry-breaking coupling H(𝐱𝐢,𝐱𝐣)=(xjxi,0)TH(\mathbf{x_{i}},\mathbf{x_{j}})=({x_{j}}-{x_{i}},0)^{T} is considered.

3.1 Absence of repulsive interaction

For the chosen values of the parameters as mentioned above, we find different dynamical behaviors of the network system (3). We first look at the collective dynamics of the network whenever there is no repulsion among the agents and only attractive coupling is activated, i.e., when kA0k_{A}\neq 0 and kR=0k_{R}=0. In this scenario, the agents with relative distance dij(t)α=10d_{ij}(t)\leq\alpha=10 remain disconnected with each other and agents will interact with each other if their distance is greater than α\alpha.

We next intend to analytically derive the critical interaction strength kcriticalk_{critical} for which synchrony appears, based on the approach of constructing the time-average Laplacian matrix G¯=[gij¯]\overline{G}=[\overline{g_{ij}}]. For the sake of simplicity, let us start with N=2N=2 mobile agents. Then, depending on their relative distance, two possible Laplacian matrices can be observed.

  1. 1.

    Whenever dij>αd_{ij}>\alpha, then the agents interact with one another so that the corresponding Laplacian matrix becomes GA=(1111)G_{A}=\left(\begin{array}[]{ccccc}1&-1\\ -1&1\end{array}\right).

  2. 2.

    If dijαd_{ij}\leq\alpha, then the Laplacian matrix due to absence of individuals’ interaction takes the form

    G0=(0000)G_{0}=\left(\begin{array}[]{ccccc}0&0\\ 0&0\end{array}\right).

Since G0G_{0} is a null matrix so in this case G¯\overline{G} reduces to G¯=pGA\overline{G}=pG_{A}, where pp is the probability of interaction between the two agents. Since, we are considering a planar space SS of area 4g24g^{2} sq. units, then p=1Area of the interaction Area of Sp=1-\frac{\text{Area of the interaction }}{\text{Area of $S$}} becomes p=1πα24g2p=1-\frac{\pi\alpha^{2}}{4g^{2}}.

We next calculate the average Laplacian matrix G¯\overline{G} for N=3N=3 agents. For instance, depending on the spatial positions of these mobile agents for a fixed value of α\alpha, eight possible configurations have been encountered for N=3N=3. These possible cases are described below:

  1. 1.

    All the agents interact with each other and thus GA=(211121112)G_{A}=\left(\begin{array}[]{ccccc}2&-1&-1\\ -1&2&-1\\ -1&-1&2\end{array}\right).

  2. 2.

    There are three cases in which two out of the three agents interact with each other and the third one remains isolated. The corresponding Laplacian matrices are

    G12=(110110000)G_{12}=\left(\begin{array}[]{ccccc}1&-1&0\\ -1&1&0\\ 0&0&0\end{array}\right), G13=(101000101)G_{13}=\left(\begin{array}[]{ccccc}1&0&-1\\ 0&0&0\\ -1&0&1\end{array}\right) and G23=(000011011)G_{23}=\left(\begin{array}[]{ccccc}0&0&0\\ 0&1&-1\\ 0&-1&1\end{array}\right), where GijG_{ij} is the Laplacian matrix when ii-th and jj-th agents are interacting with each other, and the other third agent remains isolated. Also note that, G12+G13+G23=GAG_{12}+G_{13}+G_{23}=G_{A}.

  3. 3.

    It is also possible that two of the agents lie within the relative distance α\alpha so that they are not interacting with each other, but the third agent stays far away and interacts with both of them. The associated Laplacians are as follows

    G1=(211110101)G_{1}=\left(\begin{array}[]{ccccc}2&-1&-1\\ -1&1&0\\ -1&0&1\end{array}\right), G2=(110121011)G_{2}=\left(\begin{array}[]{ccccc}1&-1&0\\ -1&2&-1\\ 0&-1&1\end{array}\right) and G3=(101011112)G_{3}=\left(\begin{array}[]{ccccc}1&0&-1\\ 0&1&-1\\ -1&-1&2\end{array}\right), where GkG_{k} is the Laplacian matrix when the kk-th agent interacts with the other two agents, but those two agents do not interact with each other. Here note that G1+G2+G3=2GAG_{1}+G_{2}+G_{3}=2G_{A}.

  4. 4.

    Majority of the agents, i.e., all three oscillators situated within the relative distance α\alpha, hence no one can establish a connection with the others. So, Laplacian matrix can be indicated by

    G0=(000000000)G_{0}=\left(\begin{array}[]{ccccc}0&0&0\\ 0&0&0\\ 0&0&0\end{array}\right).

Then the time-average matrix for N=3N=3 becomes, G¯=p0G0+p12G12+p13G13+p23G23+p1G1+p2G2+p3G3+pAGA\overline{G}=p_{0}G_{0}+p_{12}G_{12}+p_{13}G_{13}+p_{23}G_{23}+p_{1}G_{1}+p_{2}G_{2}+p_{3}G_{3}+p_{A}G_{A}. Here pp’s stand for the probabilities associated to the respective network configurations for which we have p1=p2=p3=pap_{1}=p_{2}=p_{3}=p_{a}(say), and p12=p13=p23=pabp_{12}=p_{13}=p_{23}=p_{ab}(say). Then G¯=(2pa+pab+pA)GA\overline{G}=(2p_{a}+p_{ab}+p_{A})G_{A} and hence G¯=pGA\overline{G}=pG_{A}, where p=2pa+pab+pAp=2p_{a}+p_{ab}+p_{A} is the probability of interaction between any two agents. The scenarios corresponding to N4N\geq 4 can be similarly tackled, all of which yields the time-average matrix as G¯=pGA\overline{G}=pG_{A}, where GAG_{A} is the Laplacian matrix of order N×NN\times N in the form,

GA=(N11111N11111N11.111N1)G_{A}=\left(\begin{array}[]{cccccccc}N-1&-1&-1&\cdots&\cdots&\cdots&-1\\ -1&N-1&-1&\cdots&\cdots&\cdots&-1\\ -1&-1&N-1&\cdots&\cdots&\cdots&-1\\ \cdots&\cdots&\cdots&\cdots&\cdots.&\cdots&\cdots\\ \cdots&\cdots&\cdots&\cdots&\cdots&\cdots&\cdots\\ \cdots&\cdots&\cdots&\cdots&\cdots&\cdots&\cdots\\ -1&-1&-1&\cdots&\cdots&\cdots&N-1\end{array}\right), so that G¯\overline{G} is basically a rescaled all-to-all global Laplacian matrix.

As per our described model, the links among the agents get rewired at each integrating time step, so the convergence of all the attractors to a single attractor [69] can be assured if the time-average matrix supports synchronization [17]. As stated in the Ref. [17], if there exists a constant TT such that G(t)G(t) satisfies 1Ttt+TG(τ)𝑑τ=G¯\frac{1}{T}\int_{t}^{t+T}G(\tau)d\tau=\overline{G}, the time-average of G(t)G(t) and the system of coupled oscillators given by

𝐱˙i=F(𝐱𝐢)kj=1Ngij¯H(𝐱𝐣),i=1,2,,N\begin{array}[]{lcl}\dot{\mathbf{x}}_{i}=F(\mathbf{x_{i}})-k\sum_{j=1}^{N}\overline{g_{ij}}H(\mathbf{x_{j}}),~{}~{}~{}~{}i=1,2,...,N\end{array} (6)

with fixed interacting Laplacian matrix G¯=[gij¯]\overline{G}=[\overline{g_{ij}}] possesses a stable synchronization manifold, then there exists ϵ>0{\epsilon}^{*}>0 such that for all fixed ϵ\epsilon satisfying 0<ϵ<ϵ0<\epsilon<{\epsilon}^{*}, the coupled system according to the time-varying Laplacian G(tϵ)G(\frac{t}{\epsilon}) defined by

𝐱𝐢˙=F(𝐱𝐢)kj=1Ngij(tϵ)H(𝐱𝐣),i=1,2,,N\begin{array}[]{lcl}\dot{\mathbf{x_{i}}}=F(\mathbf{x_{i}})-k\sum_{j=1}^{N}g_{ij}(\frac{t}{\epsilon})H(\mathbf{x_{j}}),~{}~{}~{}~{}i=1,2,...,N\end{array} (7)

also sustains a stable synchrony manifold under sufficiently fast switching sequence between the network configurations.

Then, the stability of the synchronized state can be investigated by the eigen values of G¯\overline{G}. For a time-independent coupling matrix, a necessary condition for synchronization is that the master stability function (MSF) be strictly negative in each transverse direction [70]. With our choice of parameter ω\omega and the coupling function H(𝐱𝐢,𝐱𝐣)=(xjxi,0)TH(\mathbf{x_{i}},\mathbf{x_{j}})=({x_{j}}-{x_{i}},0)^{T}, the SL-system belongs to class-I MSF [70], i.e., the synchronization manifold is stable in the interval of type [β1,β2\beta_{1},\beta_{2}]. The NN eigen values of G¯\overline{G} are λ1=0\lambda_{1}=0 and λj=pN\lambda_{j}=pN, j=2,3,,Nj=2,3,...,N. Then the critical range of kAk_{A} to attain complete synchrony is obtained by the inequality β1kAλj\beta_{1}\leq k_{A}\lambda_{j}, j=2,3,,Nj=2,3,...,N which implies,

kAβ1pN=kcritical.\begin{array}[]{lcl}k_{A}\geq\frac{\beta_{1}}{pN}=k_{critical}.\end{array} (8)

Refer to caption

Figure 3: Synchrony region: The red curve is the derived critical curve plotted using the relation (8). The blue dots are the stable synchronization point (N,kA)(N,k_{A}) at which E<1010E<10^{-10}. The results are accumulated for 5050 independent numerical realizations. The green shaded region is the desynchronization region, with E1010E\geq 10^{-10}.

To verify the relation (8), we plot NkAN-k_{A} parameter space in Fig. 3 where the red solid curve is our analytically found curve kA=β1pNk_{A}=\frac{\beta_{1}}{pN} for β10.0111\beta_{1}\simeq 0.0111. This curve agrees well with our numerically found synchronization region (blue shaded region). In order to numerically study the emergence of synchrony, we define the synchronization error as

E=i,j=1(ij)N(xjxi)2+(yjyi)2N1t,\begin{array}[]{lcl}E=\bigg{\langle}\frac{\sum_{i,j=1(i\not=j)}^{N}\sqrt{\left(x_{j}-x_{i}\right)^{2}+\left(y_{j}-y_{i}\right)^{2}}}{N-1}\bigg{\rangle}_{t},\end{array} (9)

where t\langle\cdot\rangle_{t} represents time average obtained over a long time interval (taken as 3×1053\times 10^{5} time steps here) after initial transient of 3×1053\times 10^{5} time steps. In our work, complete synchronization corresponds to the state when EE becomes less than 101010^{-10} accounting 5050 independent network realizations. Note that, we find a small fluctuations in the relation (8) for finding kcriticalk_{critical}. These fluctuations may occur due to various reasons, including insufficient realizations, approximate choice of the value of β1\beta_{1}, or for the effect of the uniform moving velocity vv. Even, this small fluctuation may be due to our choice of pp. Although, for static agent assumption or v=0v=0, our chosen p=1πα24g2p=1-\frac{\pi\alpha^{2}}{4g^{2}} works absolutely correctly. But when the agents are moving, the agents do not necessarily maintain this exact relation (8). In fact, in deriving the relation (8), we use the negativity of the maximum Lyapunov exponent in the transverse direction of the synchronization manifold, which is a necessary condition, not a sufficient one. All these lead to small fluctuations in kcriticalk_{critical} compared to our derived critical synchronization curve kcritical=β1pNk_{critical}=\frac{\beta_{1}}{pN}. Notably, this density dependent threshold for the emergence of synchrony is found to be relevant and is of practical interest, particularly in the studies of the bacterial infection, biofilm formation and bioluminescence where quorum-sensing transition is observed in indirectly coupled systems [71, 72].

This result is quite important due to the fact that if we randomly distribute NN agents in the plane SS and then set v=0v=0 (i.e., when the network becomes static), complete synchronization is not guaranteed depending on their initial placements. As the connected agents may exhibit complete synchronization depending on suitable coupling strength kAk_{A}, but the disconnected agents remain isolated and as a result of that they maintain isolated trajectories. But, the mobility of each agent allows them to interact even if they are long-distant, under sufficiently long simulations. These occasional interactions induce complete synchronization among them for appropriate critical coupling strength.

Such occasional minimal interaction is found to be beneficial for the emergence of complete synchronization, instead of continuous-time coupling, from the point of view of optimal interactional cost [73, 74]. This confined interaction may be useful in case of robotic networks and wireless communication systems, where transmission signals are turned on if the agents are lying sufficiently close to each other and where we will have to inspect if synchronization can still occur.

Refer to caption

Figure 4: Cluster Synchronization: The oscillators maintain a small oscillation around (a) 0.028630.02863 for the set UU and (b) 0.02863-0.02863 for the set VV. All the oscillators of each set UU and VV converge to a single attractor. (c) The time-series of xix_{i} of all N=100N=100 oscillators reveal that trajectories converge to two distinct trajectories. (c) These final converged trajectories look like oscillation death states, but the upper panel (a, b) already reveal the existence of small oscillation. (d) Two clusters are clearly observed. Here, the attractive coupling strength kA=1.0k_{A}=1.0.

3.2 Effect of global attractive coupling

To analyze the effect of only attractive coupling, one requires to turn-off the repulsive coupling kRk_{R}. But this is not the only possible way of setting on repulsion free interaction. Instead, one may realize the scenario by setting α=0\alpha=0. This specific choice of α\alpha transforms the repulsive matrix CC to null matrix, and attractive matrix in the form

B=(0111101111011110)~{}~{}~{}~{}~{}~{}~{}~{}B=\left(\begin{array}[]{cccccccc}0&1&1&\cdots&\cdots&\cdots&1\\ 1&0&1&\cdots&\cdots&\cdots&1\\ 1&1&0&\cdots&\cdots&\cdots&1\\ \cdots&\cdots&\cdots&\cdots&\cdots&\cdots&\cdots\\ \cdots&\cdots&\cdots&\cdots&\cdots&\cdots&\cdots\\ \cdots&\cdots&\cdots&\cdots&\cdots&\cdots&\cdots\\ 1&1&1&\cdots&\cdots&\cdots&0\end{array}\right)

Note that the matrix BB now becomes a static, i. e., a time-independent matrix. Under this set-up, one may expect complete synchronization, but for higher values of kAk_{A}, we can not obtain convergence of those attractors into one attractor. Instead of that, we find incomplete synchronization in the form of cluster synchronization for kA0.19k_{A}\geq 0.19. We define U={xi|i is odd}U=\{x_{i}|~{}~{}i~{}\text{ is odd}\} and V={xi|iis even}V=\{x_{i}|~{}~{}i~{}\text{is even}\}. After the initial transient, the xix_{i} of trajectories of the sets UU and VV converge respectively to two different trajectories as shown in Figs. 4(a, b) for kA=1.0k_{A}=1.0. Both the sets UU and VV contain 5050 oscillators. The global network evolves into two equipotent subsets of oscillators in which members of the same cluster are synchronized to the same trajectory, but members of different clusters, oscillating with different small amplitudes. Notice that the oscillators that start with negative xix_{i} as per relation (5) end up with positive xix_{i} and vice-versa. Figure 4(c) portrays the time series of xix_{i} for i=1,2,,100i=1,2,\cdots,100. Although, Fig. 4(c) reflects oscillation death like scenario, but Figs. 4(a, b) reveal a small oscillation around 0.028630.02863 for the set UU and 0.02863-0.02863 for the set VV. Figure 4(d) depicts snapshot of the position of the oscillators at a particular time tt. All N=100N=100 oscillators are symmetrically distributed around the origin, the unstable stationary point of the system (3).

Such partial synchronization may show up in swarms of unmanned autonomous vehicles, power grids and swarms of animals [75]. This interesting phenomenon is also hold for random initial conditions choosing from [1,1]×[1,1][-1,1]\times[-1,1]. But, in that case, the cardinality of UU and VV vary significantly in each realization. We also find that, if we increase kAk_{A} by keeping fixed the initial conditions as per the relation (5), still we do not observe complete synchronization for kA0.19k_{A}\geq 0.19. They still show cluster synchronization for suitable kAk_{A}. However, for smaller suitable kAk_{A}, the trajectories exhibit complete synchronization converging to a single periodic attractor. For N=100N=100 oscillators, complete synchronization can be obtained for kA<0.19k_{A}<0.19.

Refer to caption

Figure 5: (a) Inhomogeneous small oscillation: variation of xi(t)x_{i}(t) of all the oscillators for N=100N=100. (b) Complete synchronization: variation of xi(t)x_{i}(t) of N=51N=51 oscillators. Other parameters are kA=1.0k_{A}=1.0 and kR=0.10k_{R}=-0.10. The initial conditions are chosen as per the relation (5). (c) Attractor switching: Without any loss of generality, the 9999-th oscillator is chosen randomly among N=100N=100 oscillators. The time-series depicts the occasional switching of the attractor. (d) The chaotic attractor: A single attractor is shown here to illustrate the attractor switching. Other parameters are kA=1.0k_{A}=1.0 and kR=0.27k_{R}=-0.27.

3.3 Interplay between attractive and repulsive interactions

3.3.1 Inhomogeneous small oscillation

Now, we consider α=10\alpha=10 along with kA=1.0k_{A}=1.0 and kR=0.10k_{R}=-0.10, so that both the couplings can play a decisive role. Under this choice of parameters, we observe the time-series of each oscillator exhibits chaotic behavior. Again, those xix_{i} of N=100N=100 oscillators distribute equally on both sides of yi=0y_{i}=0. Similarly, yiy_{i} of those oscillators are distributed equally on both sides of xi=0x_{i}=0. One of such scenario is shown in Fig. 5(a). It is observed that each of these two groups is not synchronized. They maintain their chaotic small oscillations. The simulations are done using initial conditions of relation (5).

Recently this type of oscillations is reported by Dixit et al.[76] for two coupled SL-oscillators under the influence of dynamic interaction. But, our study is quite different from them. Our network consists of mobile agents, and their relative distance dij(t)d_{ij}(t) actually decides the mutual interaction type, which is completely different from the study [76]. In fact, we found this state for large networks, which help to deny the finite-size effect. Moreover, each split group in our case consists more than 22-oscillators and those trajectories do not lead to any cluster synchronization.

To study the effect of network size NN, a detailed numerical study is perceived. We find that there exists a NcriticalN_{critical}, beyond which network shows such inhomogeneous small oscillation. Numerically, we find this NcriticalN_{critical} is 5151. For N52N\geq 52, such chaotic small oscillation is observed. For N<52N<52, the attractors are converged to a single attractor and the trajectories are exhibiting periodic behavior. In Fig. 5(b), we plot the xix_{i}’s of all N=51N=51 oscillators, which are oscillating synchronously.

Refer to caption

Figure 6: On-off intermittency: The red dashed horizontal line is the extreme event indicating threshold HS=m+8σH_{S}=m+8\sigma, where mm is the sample mean and σ\sigma is the standard deviation of the whole data. The error dynamics, EE shows irregular and rare switching from the zero value to non-zero values. The parameters are N=100N=100, kA=1.0k_{A}=1.0, α=g=10.0\alpha=g=10.0, v=2.0v=2.0 and kR=0.44k_{R}=-0.44.

To scrutinize the effect of kRk_{R}, we fix the attractive coupling kA=1.0k_{A}=1.0, and slowly increase the absolute magnitude of kRk_{R}. We observe that with increment of kRk_{R}, the amplitude of the oscillators increase. After a certain value of kRk_{R}, the attractors of one group, which are initially separated by the axes (See Fig. 5(a)), are crossing the axes frequently. The trajectory of ii-th oscillator crosses the axes and joins the other group for sometimes, before it comes back to its original group. To illustrate this, we choose randomly an agent from N=100N=100 oscillators, and plot its time series in Fig. 5(c). The corresponding attractor is also shown in Fig. 5(d) to demonstrate the chaotic switching behavior of the attractor. Interestingly, further slight increment of kRk_{R} leads to complete synchronization. At kR=0.28k_{R}=-0.28, all N=100N=100 oscillators oscillate synchronously and re-gain their isolated periodic dynamics. They oscillate in the limit cycle regime from [1,1][-1,1].

3.3.2 Extreme events

Further decrement of kRk_{R} (for fixed kA=1.0k_{A}=1.0) destabilizes the synchronization manifold and after a certain value of kRk_{R}, the error dynamics becomes intermittent. Specifically, for most of the time the synchronization error EE (cf. Eq. (9)) remains near zero (lies within the interval [1010,106][10^{-10},10^{-6}]), but occasionally this EE becomes non-zero. For a narrow range of kRk_{R} with fixed kA=1.0k_{A}=1.0, we find this intermittent error trajectories exhibiting extremely large values. To reveal this issue, we plot variation of synchronization error EE in Fig. 6, which is accumulated over a sufficiently long time interval. For this entire data, we calculate the sample mean m=0.0011m=0.0011 and the standard deviation σ=0.0199\sigma=0.0199. We then define a extreme event threshold HS=m+8σ0.1606H_{S}=m+8\sigma\simeq 0.1606, which is plotted over the error dynamics with horizontal dashed line in Fig. 6. In this particular accumulated data of EE, we find 25702570 data points having value of EE, which is greater than HSH_{S}. Thus, the probability of {E>HS}\{E>H_{S}\} is 0.00085670.0008567. However, this probability varies with each realization, and for our choice of HS=m+8σH_{S}=m+8\sigma, Cantelli’s inequality [77, 78] yields the upper bound for each realization as

P(EHS)165.\begin{array}[]{lcl}P(E\geq H_{S})\leq\frac{1}{65}.\end{array} (10)

In the existing literatures [79, 80], this type of intermittency is known as on-off intermittency. This type of intermittent error, the trajectories experiencing non-uniform, uncertain extensive expeditions from the synchronous manifold and can be considered as an appropriate candidate for extreme events. Earlier, local instability of synchronization manifold due to on-off intermittency causing extreme events in a pair of coupled chaotic electronic circuits is reported [81]. Also, Nag Chowdhury et al. [65] found a similar mechanism for the generation of extreme events in a mobile network of chaotic oscillators.

Refer to caption

Figure 7: Non-Gaussian distribution of EnE_{n}: Local maxima EnE_{n} of EE is accumulated and histogram of them is plotted in semilog scale. This histogram resemblances with L-shaped PDF exhibiting non-Gaussian distribution. The red dashed vertical line is the significant height HS=m+8σH_{S}=m+8\sigma. The parameters are N=100N=100, kA=1.0k_{A}=1.0, α=g=10\alpha=g=10, v=2.0v=2.0 and kR=0.44k_{R}=-0.44.

Refer to caption

Figure 8: Parameter Space kRkAk_{R}-k_{A}: The yellow and gray regions respectively correspond to the states E<10100E<10^{-10}\simeq 0 (i.e., complete synchrony) and the inhomogeneous small oscillation. The blue area stands for the extreme events whereas the red zone represents the state where the error EE becomes intermittent but HS0.01H_{S}\leq 0.01. Finally, the area in cyan corresponds to the desynchronization state. Other parameters are N=100N=100, g=α=10g=\alpha=10 and v=2.0v=2.0. Here, 100100 independent realizations are used to obtain this parameter space.

To further resolve whether the spikes in Fig. 6 qualify for extreme events or not, we determine the local maximum values EnE_{n} of EE and plot the histogram for the event sizes EnE_{n} in Fig. 7. Note that the length of the collected time series is sufficient enough so that due to statistical regularity, inclusion of new sample does not affect the structure of the histogram. Pisarchik et al. [82] pointed out a special characteristic of extreme events, which is the L-shaped probability density function (PDF) of EnE_{n} in the semi-log scale. In spirit of all these facts, we define extreme events in this article as follows,

  1. 1.

    These short lasting events are recurrent, aperiodic and of different amplitudes higher than the significant height HS=m+8σH_{S}=m+8\sigma. In order to further eliminate the small amplitude events, another restriction is maintained, HS>0.01H_{S}>0.01 is taken along with HS=m+8σH_{S}=m+8\sigma [65, 82].

  2. 2.

    They appear much more often than Gaussian statistics and they are unpredictable almost surely with respect to time, where an event is defined as almost surely if the set of possible exceptions may be non-empty but has zero Lebesgue measure [83].

  3. 3.

    The appearance of these large events would have very small probability (though the exact measure of small needs to be quantified) [48].

Clearly, the histogram in Fig. (7) is an approximate representation of the distribution f(x)f(x) of the numerical data. In the next, we define a return interval kk. Mathematically, a return interval kk occurs if Xi>HSX_{i}>H_{S} and Xi+k>HSX_{i+k}>H_{S}, but XjHSX_{j}\leq H_{S} for i<j<i+ki<j<i+k, where XiX_{i} is the value of the observable XX at the ii-th step. Suppose, WHSW_{H_{S}} is the number of total return intervals. So, we have kik_{i} for i=1,2,,WHSi=1,2,\cdots,W_{H_{S}} such that not necessarily all the kik_{i} are distinct. Clearly, if kik_{i} is short then a cluster of accumulated extreme events can be observed. In contrast, a large value of return interval definitely portrays few occurrences of extreme events. Also, let k1+k2++kWHS=Wk_{1}+k_{2}+\cdots+k_{W_{H_{S}}}=W, then the mean return interval is

RHS=1WHSi=1WHSki=WWHS.\begin{array}[]{lcl}R_{H_{S}}=\frac{1}{W_{H_{S}}}\sum_{i=1}^{W_{H_{S}}}k_{i}=\frac{W}{W_{H_{S}}}.\end{array} (11)

This relation (11) clearly indicates that the mean return interval RHSR_{H_{S}} is relatively short if the occurrence of extreme events is frequent (i.e., WHSW_{H_{S}} is high). Similarly, if WHSW_{H_{S}} is small then the mean return interval is relatively high. But, this number of return intervals WHSW_{H_{S}} is dependent on various factors and thus it varies on realizations. Hence, relation (11) gives different average return interval RHSR_{H_{S}} based on different realizations. Using time series analogous of Kac’s Lemma [84, 85, 86], RHSR_{H_{S}} can be described in terms of the tail of the normalized distribution density f(x)f(x) as

RHS=WWHS1HSf(y)𝑑y.\begin{array}[]{lcl}R_{H_{S}}=\frac{W}{W_{H_{S}}}\simeq\frac{1}{\int_{H_{S}}^{\infty}f(y)dy}.\end{array} (12)

Thus, there exists a one-one relation between the chosen threshold HSH_{S} and the mean return interval RHSR_{H_{S}}, which is solely determined by the normalized distribution f(x)f(x).

3.3.3 Different dynamical states in the kAkRk_{A}-k_{R} coupling parameter space

For a complete understanding of interplay between attractive and repulsive interactions (i.e., for α0\alpha\neq 0), a two dimensional kAkRk_{A}-k_{R} parameter space is presented in Fig. 8. In this figure, we vary kAk_{A} from [0.1,1.1][0.1,1.1] whereas kRk_{R} is varied within [0.0,0.50][0.0,-0.50]. Initially, in absence of repulsive coupling, i.e., for kR=0.0k_{R}=0.0, complete synchronization is observed for suitable choices of kAk_{A} where E<1010E<10^{-10}. As per this Fig. 8, whenever kAk_{A} reaches to 0.50.5, then the introduction of small kR<0.0k_{R}<0.0 may destroy the limit cycle behavior of the oscillators and their synchronized behavior is also lost. The reflected region of inhomogeneous small oscillation enlarges with further increment of positive coupling kAk_{A}. Interestingly, for a fixed kA0.5k_{A}\geq 0.5, the decrement of kRk_{R} helps to restore the periodic behavior of the attractors. With suitable choices of kRk_{R} for fixed kA0.5k_{A}\geq 0.5, this transition from inhomogeneous small oscillation to complete synchronized state occurs through the path of attractor switching, as already shown in Fig. 5. The attractors are quenched and with further decrement of kRk_{R} for appropriate kAk_{A}, the trajectories switch between the co-existing attractors and finally regain their respective periodic synchronized attractor.

When kRk_{R} is further decreased, the synchronization error EE becomes intermittent and reveals occasional away journey from the synchronization manifold. This regime is depicted through the red and blue regions in the Fig. (8). In order to distinguish between these red and blue regions, we calculate the significant height HSH_{S}. When HSH_{S} lies within (106,0.01](10^{-6},0.01], we label those states as the intermittent region (in red). For HS>0.01H_{S}>0.01, we define those states as extreme events which obey additional few clauses mentioned earlier. While in complete synchronization, all the attractors converge into a single attractor. But, during the appearance of extreme events, most of the time all the trajectories evolve over a converged single trajectory, but occasionally due to the local repulsion (of suitable strength kRk_{R}) few trajectories leave the converged attractor and follow their own path for a relatively short time. Hence, during those time, the error trajectory leaves the equilibrium point E=0.0E=0.0 (the synchronization manifold) and exhibit a large excursion exceeding HS=m+8σH_{S}=m+8\sigma. This choice of HSH_{S} is influenced by the Ref. [65], where the authors gave analytical logic behind the choice of such extreme event indicating threshold. The second variables yiy_{i} of all N=100N=100 oscillators are plotted over a short time-interval and the corresponding error dynamics are also presented through an arrow in Fig. 8. As expected, if kRk_{R} is further decreased while keeping kAk_{A} fixed, desynchrony states are observed.

Refer to caption

Figure 9: Phase diagram in the kRkAk_{R}-k_{A} parameter plane: The yellow region corresponds to the states of complete synchronization. The blue area stands for the extreme events whereas the red zone represents the state where the error EE becomes intermittent, but HS0.01H_{S}\leq 0.01. Finally, the area in cyan corresponds to the desynchronization state. Other parameters are N=100N=100, g=α=10g=\alpha=10 and v=2.0v=2.0. Here, symmetry-preserving vector coupling among the local dynamical units is considered in which 100100 independent realizations are used to obtain this parameter space.

4 Symmetry-preserving coupling

In this section, we deal with the scenario in which the local dynamical units, i.e., the SL-oscillators are coupled through both the variables so that the coupling becomes (rotational) symmetry-preserving. Our main emphasis will be to examine how this change affects the collective dynamics of the networked system. We depict the dynamical outcomes through Fig. 9 in which the phase diagram in the kRkAk_{R}-k_{A} parameter plane is portrayed. As can be seen from the figure, the presence of only attractive coupling readily induces complete synchronization in the system. Moreover, in contrast to our earlier observation for symmetry-breaking coupling (cf. Fig. 8), this synchrony sustains as kAk_{A} increases. This is mainly because now the coupling function does not allow to break the symmetry yielding inhomogeneous small oscillation. On the other hand, switching the repulsive coupling strength kRk_{R} on, one observes occasional jumps in the error dynamics (for suitable strengths of couplings) that indicates the appearance of intermittent states. More importantly, further increment of kRk_{R} leads to the intermittent states that satisfy the criteria of being considered as extreme events. This result demonstrates that our observations of complete synchronization or the extreme events on the considered network set-up is not limited to a specific choice of symmetry-breaking coupling function.

5 Discussion and Conclusion

In this study, we have considered Stuart-Landau oscillators on top of mobile agents moving in a finite region of two-dimensional plane. Due to the spatial movement of the agents, the relative distance between any two agents always varies with time. Using this spatial distance between the agents, two competing interactions are introduced. Whenever the agents stay inside a closed ball of radius α\alpha, the oscillators are repulsively coupled bidirectionally through diffusive linear coupling. On the contrary, whenever the mobile agents lie beyond the closed communication ball of radius α\alpha, they are coupled through attractive coupling. Under this set-up of the networked system, we have encountered diverse collective behaviors and provided rigorous investigation of each of them.

Firstly, we have addressed the effect of sole attractive interaction among the dynamical agents. In order to accomplish this, we first set the repulsive strength to zero for which complete synchronization is found for α=10\alpha=10. This result is quite interesting as for a static time-independent network, complete synchronization is not possible. Mobility of the agents play the decisive role to converge all the attractors to a single one. Analytically, the critical attractive coupling strength for synchrony is calculated, which exhibit excellent agreement with the numerical results. To investigate further the sole influence of attractive coupling, the repulsive matrix is set to be a null matrix by keeping α=0\alpha=0 fixed. This different strategy leads to complete synchronization for suitable choice of kAk_{A} and cluster synchronization beyond a certain value of kAk_{A}.

Next we dealt with our prime issue of coexisting attraction and repulsion. The coexistence of such competing interactions can demolish the synchronized behavior of the whole system. Under suitable choices of both coupling strength, inhomogeneous small oscillation is perceived. In this state, each oscillator maintains chaotic behavior though we set initially each oscillator into limit cycle regime. Further reduction of repulsive strength helps to regain their periodic behavior through the path of attractor switching. Moreover, further lessening leaves the error dynamics intermittent. This irregular away journey of error trajectory from the synchronization manifold gives rise to infrequent large deviated events. Using few characterizations, we confirmed these states as extreme events. The mean return interval of these extreme events is approximated using time series analogs of Kac’s lemma in relation (12). This relation indicates the dependency of average return interval RHSR_{H_{S}} on the threshold HSH_{S}. The larger RHSR_{H_{S}} clearly corresponds to larger HSH_{S} and vice-versa. The route for generating such large amplitude events is also addressed in terms of on-off intermittency. An upper bound for the probability of occurrence of extreme events is calculated in relation (10) depending on the choice of HSH_{S}.

Further, to elucidate the mechanism behind inhomogeneous small oscillation of those oscillators, vector coupling is introduced. This coupling helps to preserve the rotational symmetry of SL-oscillators. Although, this vector coupling yields behavior like complete synchrony and extreme events, but it eliminates the appearance of such small oscillation, which is occurred during symmetry-breaking coupling.

We have been able to portray the whole scenario of all these emerging collective behaviors in a two-dimensional parameter space of the competing coupling strengths. This parameter space manifests the fact that by tuning any one of the coupling strength, one can avoid such devastating extreme events. This fact can be used as one of the influential strategy for controlling extreme events. Such controlled usage of antibiotics [87, 88] already found to be helpful in avoiding worsening medical cost and mortality especially for life-threatening bacteria infections.

In this article, we analyzed the interplay of positive and negative interactions in coupled identical limit cycle oscillators, by considering SL system on top of each mobile agent. An important direction of future generalization may include networks of chaotic oscillators, which is where our approach might make a difference. The chaotic dynamics [89, 90, 91, 92] are expected to reveal an even wider spectrum of interesting dynamical states. This remains the core interesting avenue for future work.

Acknowledgements

SNC and DG were supported by Department of Science and Technology, Government of India (Project No. EMR/2016/001039). SNC would also like to thank Physics and Applied Mathematics Unit of Indian Statistical Institute, Kolkata for their support during the pandemic COVID-19.

References

  • [1] M. E. J. Newman, Networks: An Introduction.   Oxford, U.K.: Oxford University Press, 2010.
  • [2] A.-L. Barabási et al., Network science.   Cambridge university press, 2016.
  • [3] R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, p. 47, 2002.
  • [4] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, “Complex networks: Structure and dynamics,” Phys. Rep., vol. 424, no. 4-5, pp. 175–308, 2006.
  • [5] A. Arenas, A. Díaz-Guilera, J. Kurths, Y. Moreno, and C. Zhou, “Synchronization in complex networks,” Phys. Rep., vol. 469, no. 3, pp. 93–153, 2008.
  • [6] S. Rakshit, B. K. Bera, and D. Ghosh, “Invariance and stability conditions of interlayer synchronization manifold,” Physical Review E, vol. 101, no. 1, p. 012308, 2020.
  • [7] X. F. Wang and G. Chen, “Synchronization in scale-free dynamical networks: robustness and fragility,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, no. 1, pp. 54–62, 2002.
  • [8] S. Vaidyanathan, C. Volos, V.-T. Pham, K. Madhavan, and B. A. Idowu, “Adaptive backstepping control, synchronization and circuit simulation of a 3-d novel jerk chaotic system with two hyperbolic sinusoidal nonlinearities,” Archives of Control Sciences, vol. 24, no. 3, 2014.
  • [9] S. Rakshit, B. K. Bera, E. M. Bollt, and D. Ghosh, “Intralayer synchronization in evolving multiplex hypernetworks: Analytical approach,” SIAM Journal on Applied Dynamical Systems, vol. 19, no. 2, pp. 918–963, 2020.
  • [10] S. Vaidyanathan, C. Volos, V.-T. Pham, and K. Madhavan, “Analysis, adaptive control and synchronization of a novel 4-d hyperchaotic hyperjerk system and its spice implementation,” Archives of Control Sciences, vol. 25, no. 1, 2015.
  • [11] C. W. Wu and L. O. Chua, “On a conjecture regarding the synchronization in an array of linearly coupled dynamical systems,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 43, no. 2, pp. 161–165, 1996.
  • [12] S. Rakshit, B. K. Bera, and D. Ghosh, “Synchronization in a temporal multiplex neuronal hypernetwork,” Physical Review E, vol. 98, no. 3, p. 032305, 2018.
  • [13] B. Kerr, M. A. Riley, M. W. Feldman, and B. J. Bohannan, “Local dispersal promotes biodiversity in a real-life game of rock–paper–scissors,” Nature, vol. 418, no. 6894, pp. 171–174, 2002.
  • [14] T. Reichenbach, M. Mobilia, and E. Frey, “Mobility promotes and jeopardizes biodiversity in rock–paper–scissors games,” Nature, vol. 448, no. 7157, pp. 1046–1049, 2007.
  • [15] C. Song, Z. Qu, N. Blumm, and A.-L. Barabási, “Limits of predictability in human mobility,” Science, vol. 327, no. 5968, pp. 1018–1021, 2010.
  • [16] A. Buscarino, L. Fortuna, M. Frasca, and S. Frisenna, “Interaction between synchronization and motion in a system of mobile agents,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 26, no. 11, p. 116302, 2016.
  • [17] D. J. Stilwell, E. M. Bollt, and D. G. Roberson, “Sufficient conditions for fast switching synchronization in time-varying network topologies,” SIAM Journal on Applied Dynamical Systems, vol. 5, no. 1, pp. 140–156, 2006.
  • [18] S. Nag Chowdhury, S. Kundu, M. Duh, M. Perc, and D. Ghosh, “Cooperation on interdependent networks by means of migration and stochastic imitation,” Entropy, vol. 22, no. 4, p. 485, 2020.
  • [19] M. Frasca, A. Buscarino, A. Rizzo, L. Fortuna, and S. Boccaletti, “Synchronization of moving chaotic agents,” Physical Review Letters, vol. 100, no. 4, p. 044102, 2008.
  • [20] N. Fujiwara, J. Kurths, and A. Díaz-Guilera, “Synchronization in networks of mobile oscillators,” Physical Review E, vol. 83, no. 2, p. 025101, 2011.
  • [21] K. Uriu, S. Ares, A. C. Oates, and L. G. Morelli, “Dynamics of mobile coupled phase oscillators,” Physical Review E, vol. 87, no. 3, p. 032911, 2013.
  • [22] S. Majhi and D. Ghosh, “Synchronization of moving oscillators in three dimensional space,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 27, no. 5, p. 053115, 2017.
  • [23] K. Uriu, Y. Morishita, and Y. Iwasa, “Random cell movement promotes synchronization of the segmentation clock,” Proceedings of the National Academy of Sciences, vol. 107, no. 11, pp. 4979–4984, 2010.
  • [24] S. N. Chowdhury, S. Majhi, D. Ghosh, and A. Prasad, “Convergence of chaotic attractors due to interaction based on closeness,” Physics Letters A, vol. 383, no. 35, p. 125997, 2019.
  • [25] M. Porfiri, D. J. Stilwell, E. M. Bollt, and J. D. Skufca, “Random talk: Random walk and synchronizability in a moving neighborhood network,” Physica D: Nonlinear Phenomena, vol. 224, no. 1-2, pp. 102–113, 2006.
  • [26] S. N. Chowdhury and D. Ghosh, “Synchronization in dynamic network using threshold control approach,” EPL (Europhysics Letters), vol. 125, no. 1, p. 10011, 2019.
  • [27] B. Kim, Y. Do, and Y.-C. Lai, “Emergence and scaling of synchronization in moving-agent networks with restrictive interactions,” Physical Review E, vol. 88, no. 4, p. 042818, 2013.
  • [28] S. Majhi, D. Ghosh, and J. Kurths, “Emergence of synchronization in multiplex networks of mobile rössler oscillators,” Physical Review E, vol. 99, no. 1, p. 012308, 2019.
  • [29] B. K. Bera, C. Hens, and D. Ghosh, “Emergence of amplitude death scenario in a network of oscillators under repulsive delay interaction,” Physics Letters A, vol. 380, no. 31-32, pp. 2366–2373, 2016.
  • [30] A. Mishra, C. Hens, M. Bose, P. K. Roy, and S. K. Dana, “Chimeralike states in a network of oscillators under attractive and repulsive global coupling,” Physical Review E, vol. 92, no. 6, p. 062920, 2015.
  • [31] Q. Wang, G. Chen, and M. Perc, “Synchronous bursts on scale-free neuronal networks with attractive and repulsive coupling,” PLoS one, vol. 6, no. 1, 2011.
  • [32] C. Hens, P. Pal, S. K. Bhowmick, P. K. Roy, A. Sen, and S. K. Dana, “Diverse routes of transition from amplitude to oscillation death in coupled oscillators under additional repulsive links,” Physical Review E, vol. 89, no. 3, p. 032901, 2014.
  • [33] X.-J. Tian, X.-P. Zhang, F. Liu, and W. Wang, “Interlinking positive and negative feedback loops creates a tunable motif in gene regulatory networks,” Physical Review E, vol. 80, no. 1, p. 011926, 2009.
  • [34] S. Majhi, T. Kapitaniak, and D. Ghosh, “Solitary states in multiplex networks owing to competing interactions,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 29, no. 1, p. 013108, 2019.
  • [35] Y. Maistrenko, B. Penkovsky, and M. Rosenblum, “Solitary state at the edge of synchrony in ensembles with attractive and repulsive interactions,” Physical Review E, vol. 89, no. 6, p. 060901, 2014.
  • [36] K. Sathiyadevi, V. Chandrasekar, D. Senthilkumar, and M. Lakshmanan, “Distinct collective states due to trade-off between attractive and repulsive couplings,” Physical Review E, vol. 97, no. 3, p. 032207, 2018.
  • [37] K. Sathiyadevi, V. Chandrasekar, and D. Senthilkumar, “Stable amplitude chimera in a network of coupled stuart-landau oscillators,” Physical Review E, vol. 98, no. 3, p. 032301, 2018.
  • [38] H. Hong and S. H. Strogatz, “Kuramoto model of coupled oscillators with positive and negative coupling parameters: an example of conformist and contrarian oscillators,” Physical Review Letters, vol. 106, no. 5, p. 054102, 2011.
  • [39] T. Vaz Martins and R. Toral, “Synchronisation induced by repulsive interactions in a system of van der pol oscillators,” Progress of Theoretical Physics, vol. 126, no. 3, pp. 353–368, 2011.
  • [40] I. Leyva, I. Sendina-Nadal, J. Almendral, and M. Sanjuán, “Sparse repulsive coupling enhances synchronization in complex networks,” Physical Review E, vol. 74, no. 5, p. 056112, 2006.
  • [41] A. Mishra, S. Saha, M. Vigneshwaran, P. Pal, T. Kapitaniak, and S. K. Dana, “Dragon-king-like extreme events in coupled bursting neurons,” Physical Review E, vol. 97, no. 6, p. 062311, 2018.
  • [42] M. Inoue and K. Kaneko, “Dynamics of coupled adaptive elements: Bursting and intermittent oscillations generated by frustration in networks,” Physical Review E, vol. 81, no. 2, p. 026203, 2010.
  • [43] B. Ottino-Löffler and S. H. Strogatz, “Volcano transition in a solvable model of frustrated oscillators,” Physical Review Letters, vol. 120, no. 26, p. 264102, 2018.
  • [44] F. S. Bacelar, J. M. Calabrese, and E. Hernández-García, “Exploring the tug of war between positive and negative interactions among savanna trees: Competition, dispersal, and protection from fire,” Ecological Complexity, vol. 17, pp. 140–148, 2014.
  • [45] M. Szell, R. Lambiotte, and S. Thurner, “Multirelational organization of large-scale social networks in an online world,” Proceedings of the National Academy of Sciences, vol. 107, no. 31, pp. 13 636–13 641, 2010.
  • [46] S. N. Chowdhury, D. Ghosh, and C. Hens, “Effect of repulsive links on frustration in attractively coupled networks,” Physical Review E, vol. 101, no. 2, p. 022310, 2020.
  • [47] P. M. Gade and G. Rangarajan, “Frustration induced oscillator death on networks,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 23, no. 3, p. 033104, 2013.
  • [48] V. Lucarini, D. Faranda, J. M. M. de Freitas, M. Holland, T. Kuna, M. Nicol, M. Todd, S. Vaienti et al., Extremes and recurrence in dynamical systems.   John Wiley & Sons, 2016.
  • [49] A. Ray, S. Rakshit, D. Ghosh, and S. K. Dana, “Intermittent large deviation of chaotic trajectory in Ikeda map: Signature of extreme events,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 29, no. 4, p. 043131, 2019.
  • [50] G. Ansmann, R. Karnatak, K. Lehnertz, and U. Feudel, “Extreme events in excitable systems and mechanisms of their generation,” Physical Review E, vol. 88, no. 5, p. 052911, 2013.
  • [51] A. Ray, A. Mishra, D. Ghosh, T. Kapitaniak, S. K. Dana, and C. Hens, “Extreme events in a network of heterogeneous Josephson junctions,” Physical Review E, vol. 101, no. 3, p. 032209, 2020.
  • [52] A. Ray, S. Rakshit, G. K. Basak, S. K. Dana, and D. Ghosh, “Understanding the origin of extreme events in El Niño southern oscillation,” Physical Review E, vol. 101, no. 6, p. 062210, 2020.
  • [53] W. Cousins and T. P. Sapsis, “Unsteady evolution of localized unidirectional deep-water wave groups,” Physical Review E, vol. 91, no. 6, p. 063204, 2015.
  • [54] S. Guth and T. P. Sapsis, “Machine learning predictors of extreme events occurring in complex dynamical systems,” Entropy, vol. 21, no. 10, p. 925, 2019.
  • [55] G. Dematteis, T. Grafke, and E. Vanden-Eijnden, “Rogue waves and large deviations in deep sea,” Proceedings of the National Academy of Sciences, vol. 115, no. 5, pp. 855–860, 2018.
  • [56] I. G. Grooms and A. J. Majda, “Stochastic superparameterization in a one-dimensional model for wave turbulence,” Communications in Mathematical Sciences, vol. 12, no. 3, pp. 509–525, 2014.
  • [57] A. J. Majda and Y. Lee, “Conceptual dynamical models for turbulence,” Proceedings of the National Academy of Sciences, vol. 111, no. 18, pp. 6548–6553, 2014.
  • [58] D. Cai, A. J. Majda, D. W. McLaughlin, and E. G. Tabak, “Dispersive wave turbulence in one dimension,” Physica D: Nonlinear Phenomena, vol. 152, pp. 551–572, 2001.
  • [59] A. J. Majda and X. T. Tong, “Intermittency in turbulent diffusion models with a mean gradient,” Nonlinearity, vol. 28, no. 11, p. 4171, 2015.
  • [60] D. Sornette, “Dragon-kings, Black Swans and the Prediction of Crises,” Swiss Finance Institute, Swiss Finance Institute Research Paper Series, vol. 2, doi:10.2139/ssrn.1596032, 2009.
  • [61] J. A. Feigenbaum, “A statistical analysis of log-periodic precursors to financial crashes,” Quantitative Finance, vol. 1, pp. 346–360, 2001.
  • [62] C. Bonatto, M. Feyereisen, S. Barland, M. Giudici, C. Masoller, J. R. R. Leite, and J. R. Tredicce, “Deterministic optical rogue waves,” Physical Review Letters, vol. 107, no. 5, p. 053901, 2011.
  • [63] K. Dysthe, H. E. Krogstad, and P. Müller, “Oceanic rogue waves,” Annu. Rev. Fluid Mech., vol. 40, pp. 287–310, 2008.
  • [64] A. Slunyaev, C. Kharif, and E. Pelinovsky, Rogue Waves in the Ocean.   Springer, Berlin, 2009.
  • [65] S. N. Chowdhury, S. Majhi, M. Ozer, D. Ghosh, and M. Perc, “Synchronization to extreme events in moving agents,” New J. Phys., vol. 21, no. 7, p. 073048, 2019.
  • [66] A. Buscarino, L. Fortuna, M. Frasca, and A. Rizzo, “Dynamical network interactions in distributed control of robots,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 16, no. 1, p. 015116, 2006.
  • [67] L. M. Pecora, F. Sorrentino, A. M. Hagerstrom, T. E. Murphy, and R. Roy, “Cluster synchronization and isolated desynchronization in complex networks with symmetries,” Nature communications, vol. 5, no. 1, pp. 1–8, 2014.
  • [68] D. J. Stilwell, E. M. Bollt, and D. G. Roberson, “Synchronization of time-varying networks under fast switching,” in 2006 American Control Conference.   IEEE, 2006, pp. 6–pp.
  • [69] S. N. Chowdhury and D. Ghosh, “Hidden attractors: A new chaotic system without equilibria,” The European Physical Journal Special Topics, vol. 229, no. 6-7, pp. 1299–1308, 2020.
  • [70] L. M. Pecora and T. L. Carroll, “Synchronization in chaotic systems,” Physical Review Letters, vol. 64, no. 8, p. 821, 1990.
  • [71] A. Camilli and B. L. Bassler, “Bacterial small-molecule signaling pathways,” Science, vol. 311, no. 5764, pp. 1113–1116, 2006.
  • [72] A. F. Taylor, M. R. Tinsley, F. Wang, Z. Huang, and K. Showalter, “Dynamical quorum sensing and synchronization in large populations of chemical oscillators,” Science, vol. 323, no. 5914, pp. 614–617, 2009.
  • [73] M. Schröder, M. Mannattil, D. Dutta, S. Chakraborty, and M. Timme, “Transient uncoupling induces synchronization,” Physical Review Letters, vol. 115, no. 5, p. 054101, 2015.
  • [74] A. Tandon, M. Schröder, M. Mannattil, M. Timme, and S. Chakraborty, “Synchronizing noisy nonidentical oscillators by transient uncoupling,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 26, no. 9, p. 094817, 2016.
  • [75] F. Sorrentino, L. M. Pecora, A. M. Hagerstrom, T. E. Murphy, and R. Roy, “Complete characterization of the stability of cluster synchronization in complex dynamical networks,” Science advances, vol. 2, no. 4, p. e1501737, 2016.
  • [76] S. Dixit and M. D. Shrimali, “Static and dynamic attractive–repulsive interactions in two coupled nonlinear oscillators,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 30, no. 3, p. 033114, 2020.
  • [77] F. P. Cantelli, “Sui confini della probabilita,” in Atti del Congresso Internazionale dei Matematici: Bologna del 3 al 10 de settembre di 1928, 1929, pp. 47–60.
  • [78] B. Ghosh, “Probability inequalities related to markov’s theorem,” The American Statistician, vol. 56, no. 3, pp. 186–190, 2002.
  • [79] J. Heagy, T. Carroll, and L. Pecora, “Desynchronization by periodic orbits,” Physical Review E, vol. 52, no. 2, p. R1253, 1995.
  • [80] N. Platt, E. Spiegel, and C. Tresser, “On-off intermittency: A mechanism for bursting,” Physical Review Letters, vol. 70, no. 3, p. 279, 1993.
  • [81] H. L. d. S. Cavalcante, M. Oriá, D. Sornette, E. Ott, and D. J. Gauthier, “Predictability and suppression of extreme events in a chaotic system,” Physical Review Letters, vol. 111, no. 19, p. 198701, 2013.
  • [82] A. N. Pisarchik, R. Jaimes-Reátegui, R. Sevilla-Escoboza, G. Huerta-Cuellar, and M. Taki, “Rogue waves in a multistable system,” Physical Review Letters, vol. 107, no. 27, p. 274101, 2011.
  • [83] N. Akhmediev and E. Pelinovsky, “Editorial–introductory remarks on “discussion & debate: Rogue waves–towards a unifying concept?”,” The European Physical Journal Special Topics, vol. 185, no. 1, pp. 1–4, 2010.
  • [84] M. Kac, “On the notion of recurrence in discrete stochastic processes,” Bulletin of the American Mathematical Society, vol. 53, no. 10, pp. 1002–1010, 1947.
  • [85] E. G. Altmann and H. Kantz, “Recurrence time analysis, long-term correlations, and extreme events,” Physical Review E, vol. 71, no. 5, p. 056106, 2005.
  • [86] J. F. Eichner, J. W. Kantelhardt, A. Bunde, and S. Havlin, “Statistics of return intervals in long-term correlated records,” Physical Review E, vol. 75, no. 1, p. 011128, 2007.
  • [87] X. Chen and F. Fu, “Social learning of prescribing behavior can promote population optimum of antibiotic use,” Frontiers in Physics, vol. 6, p. 139, 2018.
  • [88] X. C. and F. Fu, “Imperfect vaccine and hysteresis,” Proceedings of the Royal Society B, vol. 286, no. 1894, p. 20182406, 2019.
  • [89] O. E. Rössler, “An equation for continuous chaos,” Physics Letters A, vol. 57, no. 5, pp. 397–398, 1976.
  • [90] B. Yan, S. He, and K. Sun, “Design of a network permutation entropy and its applications for chaotic time series and eeg signals,” Entropy, vol. 21, no. 9, p. 849, 2019.
  • [91] S. He, K. Sun, and X. Wu, “Fractional symbolic network entropy analysis for the fractional-order chaotic systems,” Physica Scripta, vol. 95, no. 3, p. 035220, 2020.
  • [92] B. Yan, S. He, and S. Wang, “Multistability and formation of spiral waves in a fractional-order memristor-based hyperchaotic lü system with no equilibrium points,” Mathematical Problems in Engineering, vol. 2020, 2020.