arXiv subjects

Sarika Jalan

Publications and source records attributed to Sarika Jalan.

At least 109 records · Page 6Linked to original sources

arXiv2013

Transition from the self-organized to the driven dynamical clusters

We study the mechanism of formation of synchronized clusters in coupled maps on networks with various connection architectures. The nodes in a cluster are self- synchronized or driven-synchronized, based on the coupling strength and underlying network structures. A smaller coupling strength region shows driven clusters independent of the network rewiring strategies, whereas a larger coupling strength region shows the transition from the self-organized cluster to the driven cluster as network connections are rewired to the bi-partite type. Lyapunov function analysis is performed to understand the dynamical origin of cluster formation. The results provide insights into the relationship between the topological clusters which are based on the direct connections between the nodes, and the dynamical clusters which are based on the functional behavior of these nodes.

nlin.CD↗

arXiv2013

Role of delay in the mechanism of cluster formation

We study the role of delay in phase synchronization and phenomena responsible for cluster formation in delayed coupled maps on various networks. Using numerical simulations, we demonstrate that the presence of delay may change the mechanism of unit to unit interaction. At weak coupling values, same parity delays are associated with the same phenomenon of cluster formation and exhibit similar dynamical evolution. Intermediate coupling values yield rich delay-induced driven cluster patterns. A Lyapunov function analysis sheds light on the robustness of the driven clusters observed for delayed bipartite networks. Our results reveal that delay may lead to a completely different relation, between dynamical and structural clusters, than observed for the undelayed case.

nlin.CD↗

arXiv2011

Spectral Properties of Directed Random Networks with Modular Structure

We study spectra of directed networks with inhibitory and excitatory couplings. We investigate in particular eigenvector localization properties of various model networks for different value of correlation among their entries. Spectra of random networks, with completely uncorrelated entries show a circular distribution with delocalized eigenvectors, where as networks with correlated entries have localized eigenvectors. In order to understand the origin of localization we track the spectra as a function of connection probability and directionality. As connections are made directed, eigenstates start occurring in complex conjugate pairs and the eigenvalue distribution combined with the localization measure shows a rich pattern. Moreover, for a very well distinguished community structure, the whole spectrum is localized except few eigenstates at boundary of the circular distribution. As the network deviates from the community structure there is a sudden change in the localization property for a very small value of deformation from the perfect community structure. We search for this effect for the whole range of correlation strengths and for different community configurations. Furthermore, we investigate spectral properties of a metabolic network of zebrafish, and compare them with those of the model networks.

cond-mat.dis-nn↗

arXiv2010

Symbolic dynamics and synchronization of coupled map networks with multiple delays

We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of certain symbol sequences related to the characteristics of the dynamics. In particular, we show that the resulting forbidden sequences are closely related to the time delays in the system. We present two applications to coupled map lattices, namely (1) detecting synchronization and (2) determining unknown values of the transmission delays in networks with possibly directed and weighted connections and measurement noise. The method is applicable to multi-dimensional as well as set-valued maps, and to networks with time-varying delays and connection structure.

nlin.CD↗

arXiv2010

Random matrix analysis of localization properties of Gene co-expression network

We analyze gene co-expression network under the random matrix theory framework. The nearest neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral rigidity test follows random matrix prediction for a certain range, and deviates after wards. Eigenvector analysis of the network using inverse participation ratio (IPR) suggests that the statistics of bulk of the eigenvalues of network is consistent with those of the real symmetric random matrix, whereas few eigenvalues are localized. Based on these IPR calculations, we can divide eigenvalues in three sets; (A) The non-degenerate part that follows RMT. (B) The non-degenerate part, at both ends and at intermediate eigenvalues, which deviate from RMT and expected to contain information about {\it important nodes} in the network. (C) The degenerate part with $zero$ eigenvalue, which fluctuates around RMT predicted value. We identify nodes corresponding to the dominant modes of the corresponding eigenvectors and analyze their structural properties.

q-bio.MN↗

arXiv2009

Spectral analysis of deformed random networks

We study spectral behavior of sparsely connected random networks under the random matrix framework. Sub-networks without any connection among them form a network having perfect community structure. As connections among the sub-networks are introduced, the spacing distribution shows a transition from the Poisson statistics to the Gaussian orthogonal ensemble statistics of random matrix theory. The eigenvalue density distribution shows a transition to the Wigner's semicircular behavior for a completely deformed network. The range for which spectral rigidity, measured by the Dyson-Mehta $Δ_3$ statistics, follows the Gaussian orthogonal ensemble statistics depends upon the deformation of the network from the perfect community structure. The spacing distribution is particularly useful to track very slight deformations of the network from a perfect community structure, whereas the density distribution and the $Δ_3$ statistics remain identical to the undeformed network. On the other hand the $Δ_3$ statistics is useful for the larger deformation strengths. Finally, we analyze the spectrum of a protein-protein interaction network for Helicobacter, and compare the spectral behavior with those of the model networks.

cond-mat.stat-mech↗

arXiv2009

Deformed Gaussian Orthogonal Ensemble description of Small-World networks

The study of spectral behavior of networks has gained enthusiasm over the last few years. In particular, Random Matrix Theory (RMT) concepts have proven to be useful. In discussing transition from regular behavior to fully chaotic behavior it has been found that an extrapolation formula of the Brody type can be used. In the present paper we analyze the regular to chaotic behavior of Small World (SW) networks using an extension of the Gaussian Orthogonal Ensemble. This RMT ensemble, coined the Deformed Gaussian Orthogonal Ensemble (DGOE), supplies a natural foundation of the Brody formula. SW networks follow GOE statistics till certain range of eigenvalues correlations depending upon the strength of random connections. We show that for these regimes of SW networks where spectral correlations do not follow GOE beyond certain range, DGOE statistics models the correlations very well. The analysis performed in this paper proves the utility of the DGOE in network physics, as much as it has been useful in other physical systems.

cond-mat.dis-nn↗

arXiv2008

Random matrix analysis of network Laplacians

We analyze eigenvalues fluctuations of the Laplacian of various networks under the random matrix theory framework. Analyses of random networks, scale-free networks and small-world networks show that nearest neighbor spacing distribution of the Laplacian of these networks follow Gaussian orthogonal ensemble statistics of random matrix theory. Furthermore, we study nearest neighbor spacing distribution as a function of the random connections and find that transition to the Gaussian orthogonal ensemble statistics occurs at the small-world transition.

cond-mat.stat-mech↗

arXiv2008

How much random a random network is : a random matrix analysis

We analyze complex networks under random matrix theory framework. Particularly, we show that $Δ_3$ statistic, which gives information about the long range correlations among eigenvalues, provides a qualitative measure of randomness in networks. As networks deviate from the regular structure, $Δ_3$ follows random matrix prediction of linear behavior, in semi-logarithmic scale with the slope of $1/π^2$, for the longer scale.

cond-mat.stat-mech↗

arXiv2008

Coupled Dynamics on Networks

We study the synchronization of coupled dynamical systems on a variety of networks. The dynamics is governed by a local nonlinear map or flow for each node of the network and couplings connecting different nodes via the links of the network. For small coupling strengths nodes show turbulent behavior but form synchronized clusters as coupling increases. When nodes show synchronized behaviour, we observe two interesting phenomena. First, there are some nodes of the floating type that show intermittent behaviour between getting attached to some clusters and evolving independently. Secondly, we identify two different ways of cluster formation, namely self-organized clusters which have mostly intra-cluster couplings and driven clusters which have mostly inter-cluster couplings.

nlin.CD↗

arXiv2007

Randomness, chaos, and structure

We show how a simple scheme of symbolic dynamics distinguishes a chaotic from a random time series and how it can be used to detect structural relationships in coupled dynamics. This is relevant for the question at which scale in complex dynamics regularities and patterns emerge.

nlin.CD↗

arXiv2007

Random matrix analysis of complex networks

We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random, scale-free and small-world networks. These distributions follow Gaussian orthogonal ensemble statistic of RMT. To probe long-range correlations in the eigenvalues we study spectral rigidity via $Δ_3$ statistic of RMT as well. It follows RMT prediction of linear behavior in semi-logarithmic scale with slope being $\sim 1/π^2$. Random and scale-free networks follow RMT prediction for very large scale. Small-world network follows it for sufficiently large scale, but much less than the random and scale-free networks.

cond-mat.stat-mech↗

arXiv2007

Universality in Complex Networks: Random Matrix Analysis

We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world and random networks follow universal Gaussian orthogonal ensemble statistics of random matrix theory. Secondly we show an analogy between the onset of small-world behavior, quantified by the structural properties of networks, and the transition from Poisson to Gaussian orthogonal ensemble statistics, quantified by Brody parameter characterizing a spectral property. We also present our analysis for a protein-protein interaction network in budding yeast.

nlin.AO↗

arXiv2007

Analytical results for stochastically growing networks: connection to the zero range process

We introduce a stochastic model of growing networks where both, the number of new nodes which joins the network and the number of connections, vary stochastically. We provide an exact mapping between this model and zero range process, and use this mapping to derive an analytical solution of degree distribution for any given evolution rule. One can also use this mapping to infer about a possible evolution rule for a given network. We demonstrate this for protein-protein interaction (PPI) network for Saccharomyces Cerevisiae.

cond-mat.stat-mech↗

arXiv2006

Symbolic Synchronization and the Detection of Global Properties of Coupled Dynamics from Local Information

We study coupled dynamics on networks using symbolic dynamics. The symbolic dynamics is defined by dividing the state space into a small number of regions (typically 2), and considering the relative frequencies of the transitions between those regions. It turns out that the global qualitative properties of the coupled dynamics can be classified into three different phases based on the synchronization of the variables and the homogeneity of the symbolic dynamics. Of particular interest is the {\it homogeneous unsynchronized phase} where the coupled dynamics is in a chaotic unsynchronized state, but exhibits (almost) identical symbolic dynamics at all the nodes in the network. We refer to this dynamical behaviour as {\it symbolic synchronization}. In this phase, the local symbolic dynamics of any arbitrarily selected node reflects global properties of the coupled dynamics, such as qualitative behaviour of the largest Lyapunov exponent and phase synchronization. This phase depends mainly on the network architecture, and only to a smaller extent on the local chaotic dynamical function. We present results for two model dynamics, iterations of the one-dimensional logistic map and the two-dimensional Hénon map, as local dynamical function.

nlin.CD↗

arXiv2005

Detection of synchronised chaos in coupled map networks using symbolic dynamics

We present a method based on symbolic dynamics for the detection of synchronization in networks of coupled maps and distinguishing between chaotic and random iterations. The symbolic dynamics are defined using special partitions of the phase space which prevent the occurrence of certain symbol sequences related to the characteristics of the dynamics. Synchrony in a large network can be detected using measurements from only a single node by checking for the presence of forbidden symbol transitions. The method utilises a relatively short time series of measurements and hence is computationally very fast. Furthermore, it is robust against parameter uncertainties, is independent of the network size, and does not require knowledge of the connection structure.

nlin.CD↗

arXiv2005

Synchronization of Coupled Chaotic Dynamics on Networks

We review some recent work on the synchronization of coupled dynamical systems on a variety of networks. When nodes show synchronized behaviour, two interesting phenomena can be observed. First, there are some nodes of the floating type that show intermittent behaviour between getting attached to some clusters and evolving independently. Secondly, two different ways of cluster formation can be identified, namely self-organized clusters which have mostly intra-cluster couplings and driven clusters which have mostly inter-cluster couplings.

nlin.CD↗

arXiv2003

Synchronized clusters in coupled map networks: Self-organized and driven phase synchronization

We study the synchronization of coupled maps on a variety of networks including regular one and two dimensional networks, scale free networks, small world networks, tree networks, and random networks. For small coupling strengths nodes show turbulent behavior but form phase synchronized clusters as coupling increases. We identify two different ways of cluster formation, self-organized clusters which have mostly intra-cluster couplings and driven clusters which have mostly inter-cluster couplings. The synchronized clusters may be of dominant self-organized type, dominant driven type or mixed type depending on the type of network and the parameters of the dynamics. There are some nodes of the floating type that show intermittent behaviour between getting attached to some clusters and evolving independently. The residence times of a floating node in a synchronized cluster show an exponential distribution. We define different states of the coupled dynamics by considering the number and type of synchronized clusters. For the local dynamics governed by the logistic map we study the phase diagram in the plane of the coupling constant ($ε$) and the logistic map parameter ($μ$). For large coupling strengths and nonlinear coupling we find that the scale free networks and the Caley tree networks lead to better cluster formation than the other types of networks with the same average connectivity. For most of our study we use the number of connections of the order of the number of nodes which allows us to distinguish between the two mechanisms of cluster formation. As the number of connections increases the number of nodes forming clusters and the size of the clusters in general increase.

nlin.CD↗