Sanjiv K. Dwivedi

Quantifying randomness in protein–protein interaction networks of different species: A random matrix approach

We analyze protein–protein interaction networks for six different species under the framework of random matrix theory. Nearest neighbor spacing distribution of the eigenvalues of adjacency matrices of the largest connected part of these networks emulate universal Gaussian orthogonal statistics of random matrix theory. We demonstrate that spectral rigidity, which quantifies long range correlations in eigenvalues, for all protein–protein interaction networks follow random matrix prediction up to certain ranges indicating randomness in interactions. After this range, deviation from the universality evinces underlying structural features in network.

Uncovering randomness and success in society.

An understanding of how individuals shape and impact the evolution of society is vastly limited due to the unavailability of large-scale reliable datasets that can simultaneously capture information regarding individual movements and social interactions. We believe that the popular Indian film industry, “Bollywood”, can provide a social network apt for such a study. Bollywood provides massive amounts of real, unbiased data that spans more than 100 years, and hence this network has been used as a model for the present paper. The nodes which maintain a moderate degree or widely cooperate with the other nodes of the network tend to be more fit (measured as the success of the node in the industry) in comparison to the other nodes. The analysis carried forth in the current work, using a conjoined framework of complex network theory and random matrix theory, aims to quantify the elements that determine the fitness of an individual node and the factors that contribute to the robustness of a network. The authors of this paper believe that the method of study used in the current paper can be extended to study various other industries and organizations.

Emergence of clustering: role of inhibition.

Though biological and artificial complex systems having inhibitory connections exhibit a high degree of clustering in their interaction pattern, the evolutionary origin of clustering in such systems remains a challenging problem. Using genetic algorithm we demonstrate that inhibition is required in the evolution of clique structure from primary random architecture, in which the fitness function is assigned based on the largest eigenvalue. Further, the distribution of triads over nodes of the network evolved from mixed connections reveals a negative correlation with its degree providing insight into origin of this trend observed in real networks.

Optimization of synchronizability in multiplex networks

We investigate the optimization of synchronizability in multiplex networks and demonstrate that the interlayer coupling strength is the deciding factor for the efficiency of optimization. The optimized networks have homogeneity in the degree as well as in the betweenness centrality. Additionally, the interlayer coupling strength crucially affects various properties of individual layers in the optimized multiplex networks. We provide an understanding to how the emerged network properties are shaped or affected when the evolution renders them better synchronizable.

Extreme-value statistics of brain networks: importance of balanced condition.

The importance of the balance in inhibitory and excitatory couplings in the brain has increasingly been realized. Despite the key role played by inhibitory-excitatory couplings in the functioning of brain networks, the impact of a balanced condition on the stability properties of underlying networks remains largely unknown. We investigate properties of the largest eigenvalues of networks having such couplings, and find that they follow completely different statistics when in the balanced situation. Based on numerical simulations, we demonstrate that the transition from Weibull to Fréchet via the Gumbel distribution can be controlled by the variance of the column sum of the adjacency matrix, which depends monotonically on the denseness of the underlying network. As a balanced condition is imposed, the largest real part of the eigenvalue emulates a transition to the generalized extreme value statistics, independent of the inhibitory connection probability. Furthermore, the transition to the Weibull statistics and the small-world transition occur at the same rewiring probability, reflecting a more stable system. Introduction. – The largest eigenvalue of network adjacency matrices plays a bridge between dynamical and structural properties of an underlying system. For example, the inverse of the largest eigenvalue of a network characterizes the threshold for phase transition of the virus spread [1]. Recently Goltsev et. al. have demonstrated the importance of the largest eigenvalue in determining disease spread in complex networks [2]. Furthermore, in coupled oscillators the threshold for phase transition to synchronized behaviour is determined by the inverse of the largest eigenvalue [3]. The dynamical properties of neurons have been shown to be highly influenced by a change in the spectra of underlying synaptic matrices constructed from randomly distributed numbers [4]. A remarkable, fundamental direction to analyze the stability of ecological systems was put forward by May [5], where the largest real part of the eigenvalues (Rmax) establishes a relationship between the stability and complexity of the underlying system. Later, the impact of various types of interactions was demonstrated to deduce stability criteria in terms of Rmax [6]. Mathematically, matrices obeying some constraints satisfy the stability criteria [7], but realworld systems have an underlying interaction matrix that is too complicated to obey these constraints; hence, the (a)sarika@iiti.ac.in study of fluctuations in Rmax is crucial to understanding stability of a system as well as the stability properties of an individual network in that ensemble. Recent efforts in this direction reveal the similarity of the maximal Lyapunov exponent of synaptic matrices defined for neural networks with their topological complexities [8]. A very recent work investigates the statistical properties of random matrices within the framework of extreme value theory, thereby providing an estimation about the resolution in complex dynamics for a finite system size [9]. Balanced condition and its role in stability. The balanced condition in the brain refers to a situation in which for each neuron the weight of the inhibitory signal is equal to the excitatory signal [10, 11]. Ref. [12] demonstrates that this condition forces outliers of the spectra to appear inside the bulk, leading to a stable underlying neural system. Further analysis of a dynamical model of cortical networks with the balanced condition for various ratios of inhibitory and excitatory neurons reveals a connection between the spectra of connectivity matrix and the dynamical response [13]. Balance between recurrent excitation and inhibition generates stable periods of activity [14]. There have been several discussions on how synaptic matrices in the brain achieve the balanced condition; for instance, it has been demonstrated that the balanced

Extreme-value statistics of networks with inhibitory and excitatory couplings.

Inspired by the importance of inhibitory and excitatory couplings in the brain, we analyze the largest eigenvalue statistics of random networks incorporating such features. We find that the largest real part of eigenvalues of a network, which accounts for the stability of an underlying system, decreases linearly as a function of inhibitory connection probability up to a particular threshold value, after which it exhibits rich behaviors with the distribution manifesting generalized extreme value statistics. Fluctuations in the largest eigenvalue remain somewhat robust against an increase in system size but reflect a strong dependence on the number of connections, indicating that systems having more interactions among its constituents are likely to be more unstable.

Optimization of synchronizability in multiplex networks by rewiring one layer

The mathematical framework of multiplex networks has been increasingly realized as a more suitable framework for modeling real-world complex systems. In this work, we investigate the optimization of synchronizability in multiplex networks by evolving only one layer while keeping other layers fixed. Our main finding is to show the conditions under which the efficiency of convergence to the most optimal structure is almost as good as the case where both layers are rewired during an optimization process. In particular, interlayer coupling strength responsible for the integration between the layers turns out to be a crucial factor governing the efficiency of optimization even for the cases when the layer going through the evolution has nodes interacting much more weakly than those in the fixed layer. Additionally, we investigate the dependency of synchronizability on the rewiring probability which governs the network structure from a regular lattice to the random networks. The efficiency of the optimization process preceding evolution driven by the optimization process is maximum when the fixed layer has regular architecture, whereas the optimized network is more synchronizable for the fixed layer having the rewiring probability lying between the small-world transition and the random structure.

Optimized evolution of networks for principal eigenvector localization

Network science is increasingly being developed to get new insights about behavior and properties of complex systems represented in terms of nodes and interactions. One useful approach is investigating the localization properties of eigenvectors having diverse applications including disease-spreading phenomena in underlying networks. In this work, we evolve an initial random network with an edge rewiring optimization technique considering the inverse participation ratio as a fitness function. The evolution process yields a network having a localized principal eigenvector. We analyze various properties of the optimized networks and those obtained at the intermediate stage. Our investigations reveal the existence of a few special structural features of such optimized networks, for instance, the presence of a set of edges which are necessary for localization, and rewiring only one of them leads to complete delocalization of the principal eigenvector. Furthermore, we report that principal eigenvector localization is not a consequence of changes in a single network property and, preferably, requires the collective influence of various distinct structural as well as spectral features.

Evolution of correlated multiplexity through stability maximization

Investigating the relation between various structural patterns found in real-world networks and the stability of underlying systems is crucial to understand the importance and evolutionary origin of such patterns. We evolve multiplex networks, comprising antisymmetric couplings in one layer depicting predator-prey relationship and symmetric couplings in the other depicting mutualistic (or competitive) relationship, based on stability maximization through the largest eigenvalue of the corresponding adjacency matrices. We find that there is an emergence of the correlated multiplexity between the mirror nodes as the evolution progresses. Importantly, evolved values of the correlated multiplexity exhibit a dependence on the interlayer coupling strength. Additionally, the interlayer coupling strength governs the evolution of the disassortativity property in the individual layers. We provide analytical understanding to these findings by considering starlike networks representing both the layers. The framework discussed here is useful for understanding principles governing the stability as well as the importance of various patterns in the underlying networks of real-world systems ranging from the brain to ecology which consist of multiple types of interaction behavior.

Emergence of (bi)multi-partiteness in networks having inhibitory and excitatory couplings

(Bi)multi-partite interaction patterns are commonly observed in real world systems which have inhibitory and excitatory couplings. We hypothesize these structural interaction pattern to be stable and naturally arising in the course of evolution. We demonstrate that a random structure evolves to the (bi)multi-partite structure by imposing stability criterion through minimization of the largest eigenvalue in the genetic algorithm devised on the interacting units having inhibitory and excitatory couplings. The evolved interaction patterns are robust against changes in the initial network architecture as well as fluctuations in the interaction weights.