Optimal self-induced stochastic resonance in multiplex neural networks: electrical versus chemical synapses

Electrical and chemical synapses shape the dynamics of neural networks and their functional roles in information processing have been a longstanding question in neurobiology. In this paper, we investigate the role of synapses on the optimization of the phenomenon of self-induced stochastic resonance in a delayed multiplex neural network by using analytical and numerical methods. We consider a two-layer multiplex network, in which at the intra-layer level neurons are coupled either by electrical synapses or by inhibitory chemical synapses. For each isolated layer, computations indicate that weaker electrical and chemical synaptic couplings are better optimizers of self-induced stochastic resonance. In addition, regardless of the synaptic strengths, shorter electrical synaptic delays are found to be better optimizers of the phenomenon than shorter chemical synaptic delays, while longer chemical synaptic delays are better optimizers than longer electrical synaptic delays -- in both cases, the poorer optimizers are in fact worst. It is found that electrical, inhibitory, or excitatory chemical multiplexing of the two layers having only electrical synapses at the intra-layer levels can each optimize the phenomenon. And only excitatory chemical multiplexing of the two layers having only inhibitory chemical synapses at the intra-layer levels can optimize the phenomenon. These results may guide experiments aimed at establishing or confirming the mechanism of self-induced stochastic resonance in networks of artificial neural circuits, as well as in real biological neural networks.Comment: 24 pages, 7 figure

The Kuramoto model in complex networks

181 pages, 48 figures. In Press, Accepted Manuscript, Physics Reports 2015 Acknowledgments We are indebted with B. Sonnenschein, E. R. dos Santos, P. Schultz, C. Grabow, M. Ha and C. Choi for insightful and helpful discussions. T.P. acknowledges FAPESP (No. 2012/22160-7 and No. 2015/02486-3) and IRTG 1740. P.J. thanks founding from the China Scholarship Council (CSC). F.A.R. acknowledges CNPq (Grant No. 305940/2010-4) and FAPESP (Grants No. 2011/50761-2 and No. 2013/26416-9) for financial support. J.K. would like to acknowledge IRTG 1740 (DFG and FAPESP).Peer reviewedPreprin

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp