Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userInterplay of inhibition and multiplexing : Largest eigenvalue statistics
93
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The largest eigenvalue of a network provides understanding to various dynamical as well as stability properties of the underlying system. We investigate an interplay of inhibition and multiplexing on the largest eigenvalue statistics of networks. Using numerical experiments, we demonstrate that presence of the inhibitory coupling may lead to a very different behaviour of the largest eigenvalue statistics of multiplex networks than those of the isolated networks depending upon network architecture of the individual layer. We demonstrate that there is a transition from the Weibull to the Gumbel or to the Frechet distribution as networks are multiplexed. Furthermore, for denser networks, there is a convergence to the Gumbel distribution as network size increases indicating higher stability of larger systems.
rate research
Read More
The chimera state with co-existing coherent-incoherent dynamics has recently attracted a lot of attention due to its wide applicability. We investigate non-locally coupled identical chaotic maps with delayed interactions in the multiplex network framework and find that an interplay of delay and multiplexing brings about an enhanced or suppressed appearance of chimera state depending on the distribution as well as the parity of delay values in the layers. Additionally, we report a layer chimera state with an existence of one layer displaying coherent and another layer demonstrating incoherent dynamical evolution. The rich variety of dynamical behavior demonstrated here can be used to gain further insight into the real-world networks which inherently possess such multi-layer architecture with delayed interactions.
The study of correlated time-series is ubiquitous in statistical analysis, and the matrix decomposition of the cross-correlations between time series is a universal tool to extract the principal patterns of behavior in a wide range of complex systems. Despite this fact, no general result is known for the statistics of eigenvectors of the cross-correlations of correlated time-series. Here we use supersymmetric theory to provide novel analytical results that will serve as a benchmark for the study of correlated signals for a vast community of researchers.
We prove localization and probabilistic bounds on the minimum level spacing for the Anderson tight-binding model on the lattice in any dimension, with single-site potential having a discrete distribution taking N values, with N large.
We present a model that takes into account the coupling between evolutionary game dynamics and social influence. Importantly, social influence and game dynamics take place in different domains, which we model as different layers of a multiplex network. We show that the coupling between these dynamical processes can lead to cooperation in scenarios where the pure game dynamics predicts defection. In addition, we show that the structure of the network layers and the relation between them can further increase cooperation. Remarkably, if the layers are related in a certain way, the system can reach a polarized metastable state.These findings could explain the prevalence of polarization observed in many social dilemmas.
We consider a Gaussian rotationally invariant ensemble of random real totally symmetric tensors with independent normally distributed entries, and estimate the largest eigenvalue of a typical tensor in this ensemble by examining the rate of growth of a random initial vector under successive applications of a nonlinear map defined by the random tensor. In the limit of a large number of dimensions, we observe that a simple form of melonic dominance holds, and the quantity we study is effectively determined by a single Feynman diagram arising from the Gaussian average over the tensor components. This computation suggests that the largest tensor eigenvalue in our ensemble in the limit of a large number of dimensions is proportional to the square root of the number of dimensions, as it is for random real symmetric matrices.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
