Stochastic cellular automata model of neural networks

Photonic elementary cellular automata for simulation of complex phenomena

Cellular automata are a class of computational models based on simple rules and algorithms that can simulate a wide range of complex phenomena. However, when using conventional computers, these 'simple' rules are only encapsulated at the level of software. This can be taken one step further by simplifying the underlying physical hardware. Here, we propose and implement a simple photonic hardware platform for simulating complex phenomena based on cellular automata. Using this special-purpose computer, we experimentally demonstrate complex phenomena, including fractals, chaos, and solitons, which are typically associated with much more complex physical systems. The flexibility and programmability of our photonic computer present new opportunities to simulate and harness complexity for efficient, robust, and decentralized information processing using light.

Effects of degree distributions in random networks of type-I neurons

We consider large networks of theta neurons and use the Ott-Antonsen ansatz to derive degree-based mean-field equations governing the expected dynamics of the networks. Assuming random connectivity, we investigate the effects of varying the widths of the in- and out-degree distributions on the dynamics of excitatory or inhibitory synaptically coupled networks and gap junction coupled networks. For synaptically coupled networks, the dynamics are independent of the out-degree distribution. Broadening the in-degree distribution destroys oscillations in inhibitory networks and decreases the range of bistability in excitatory networks. For gap junction coupled neurons, broadening the degree distribution varies the values of parameters at which there is an onset of collective oscillations. Many of the results are shown to also occur in networks of more realistic neurons.

Efficient simulation of non-Markovian dynamics on complex networks

We study continuous-time multi-agent models, where agents interact according to a network topology. At any point in time, each agent occupies a specific local node state. Agents change their state at random through interactions with neighboring agents. The time until a transition happens can follow an arbitrary probability density. Stochastic (Monte-Carlo) simulations are often the preferred-sometimes the only feasible-approach to study the complex emerging dynamical patterns of such systems. However, each simulation run comes with high computational costs mostly due to updating the instantaneous rates of interconnected agents after each transition. This work proposes a stochastic rejection-based, event-driven simulation algorithm that scales extremely well with the size and connectivity of the underlying contact network and produces statistically correct samples. We demonstrate the effectiveness of our method on different information spreading models.

Mathematical modeling and cellular automata simulation of infectious disease dynamics: Applications to the understanding of herd immunity

The complexity associated with an epidemic defies any quantitatively reliable predictive theoretical scheme. Here, we pursue a generalized mathematical model and cellular automata simulations to study the dynamics of infectious diseases and apply it in the context of the COVID-19 spread. Our model is inspired by the theory of coupled chemical reactions to treat multiple parallel reaction pathways. We essentially ask the question: how hard could the time evolution toward the desired herd immunity (HI) be on the lives of people? We demonstrate that the answer to this question requires the study of two implicit functions, which are determined by several rate constants, which are time-dependent themselves. Implementation of different strategies to counter the spread of the disease requires a certain degree of a quantitative understanding of the time-dependence of the outcome. Here, we compartmentalize the susceptible population into two categories, (i) vulnerables and (ii) resilients (including asymptomatic carriers), and study the dynamical evolution of the disease progression. We obtain the relative fatality of these two sub-categories as a function of the percentages of the vulnerable and resilient population and the complex dependence on the rate of attainment of herd immunity. We attempt to study and quantify possible adverse effects of the progression rate of the epidemic on the recovery rates of vulnerables, in the course of attaining HI. We find the important result that slower attainment of the HI is relatively less fatal. However, slower progress toward HI could be complicated by many intervening factors.

Distinct dynamical behavior in Erdős-Rényi networks, regular random networks, ring lattices, and all-to-all neuronal networks

Neuronal network dynamics depends on network structure. In this paper we study how network topology underpins the emergence of different dynamical behaviors in neuronal networks. In particular, we consider neuronal network dynamics on Erdős-Rényi (ER) networks, regular random (RR) networks, ring lattices, and all-to-all networks. We solve analytically a neuronal network model with stochastic binary-state neurons in all the network topologies, except ring lattices. Given that apart from network structure, all four models are equivalent, this allows us to understand the role of network structure in neuronal network dynamics. While ER and RR networks are characterized by similar phase diagrams, we find strikingly different phase diagrams in the all-to-all network. Neuronal network dynamics is not only different within certain parameter ranges, but it also undergoes different bifurcations (with a richer repertoire of bifurcations in ER and RR compared to all-to-all networks). This suggests that local heterogeneity in the ratio between excitation and inhibition plays a crucial role on emergent dynamics. Furthermore, we also observe one subtle discrepancy between ER and RR networks, namely, ER networks undergo a neuronal activity jump at lower noise levels compared to RR networks, presumably due to the degree heterogeneity in ER networks that is absent in RR networks. Finally, a comparison between network oscillations in RR networks and ring lattices shows the importance of small-world properties in sustaining stable network oscillations.

Reducing Spreading Processes on Networks to Markov Population Models

Stochastic processes on complex networks, where each node is in one of several compartments, and neighboring nodes interact with each other, can be used to describe a variety of real-world spreading phenomena. However, computational analysis of such processes is hindered by the enormous size of their underlying state space.

In this work, we demonstrate that lumping can be used to reduce any epidemic model to a Markov Population Model (MPM). Therefore, we propose a novel lumping scheme based on a partitioning of the nodes. By imposing different types of counting abstractions, we obtain coarse-grained Markov models with a natural MPM representation that approximate the original systems. This makes it possible to transfer the rich pool of approximation techniques developed for MPMs to the computational analysis of complex networks’ dynamics.

We present numerical examples to investigate the relationship between the accuracy of the MPMs, the size of the lumped state space, and the type of counting abstraction.

Neuronal network model of interictal and recurrent ictal activity

We propose a neuronal network model which undergoes a saddle node on an invariant circle bifurcation as the mechanism of the transition from the interictal to the ictal (seizure) state. In the vicinity of this transition, the model captures important dynamical features of both interictal and ictal states. We study the nature of interictal spikes and early warnings of the transition predicted by this model. We further demonstrate that recurrent seizures emerge due to the interaction between two networks.

Bursting regimes in a reaction-diffusion system with action potential-dependent equilibrium

The equilibrium Nernst potential plays a critical role in neural cell dynamics. A common approximation used in studying electrical dynamics of excitable cells is that the ionic concentrations inside and outside the cell membranes act as charge reservoirs and remain effectively constant during excitation events. Research into brain electrical activity suggests that relaxing this assumption may provide a better understanding of normal and pathophysiological functioning of the brain. In this paper we explore time-dependent ionic concentrations by allowing the ion-specific Nernst potentials to vary with developing transmembrane potential. As a specific implementation, we incorporate the potential-dependent Nernst shift into a one-dimensional Morris-Lecar reaction-diffusion model. Our main findings result from a region in parameter space where self-sustaining oscillations occur without external forcing. Studying the system close to the bifurcation boundary, we explore the vulnerability of the system with respect to external stimulations which disrupt these oscillations and send the system to a stable equilibrium. We also present results for an extended, one-dimensional cable of excitable tissue tuned to this parameter regime and stimulated, giving rise to complex spatiotemporal pattern formation. Potential applications to the emergence of neuronal bursting in similar two-variable systems and to pathophysiological seizure-like activity are discussed.

Noise-enhanced nonlinear response and the role of modular structure for signal detection in neuronal networks

We show that sensory noise can enhance the nonlinear response of neuronal networks, and when delivered together with a weak signal, it improves the signal detection by the network. We reveal this phenomenon in neuronal networks that are in a dynamical state preceding a saddle-node bifurcation corresponding to the appearance of sustained network oscillations. In this state, even a weak subthreshold pulse can evoke a large-amplitude oscillation of neuronal activity. The signal-to-noise ratio reaches a maximum at an optimum level of sensory noise, manifesting stochastic resonance (SR) at the population level. We demonstrate SR by use of simulations and numerical integration of rate equations in a cortical model. Using this model, we mimic the experiments of Gluckman et al. [Phys. Rev. Lett. 77, 4098 (1996)PRLTAO0031-900710.1103/PhysRevLett.77.4098] that have given evidence of SR in mammalian brain. We also study neuronal networks in which neurons are grouped in modules and every module works in the regime of SR. We find that even a few modules can strongly enhance the reliability of signal detection in comparison with the case when a modular organization is absent.

Critical phenomena and noise-induced phase transitions in neuronal networks

We study numerically and analytically first- and second-order phase transitions in neuronal networks stimulated by shot noise (a flow of random spikes bombarding neurons). Using an exactly solvable cortical model of neuronal networks on classical random networks, we find critical phenomena accompanying the transitions and their dependence on the shot noise intensity. We show that a pattern of spontaneous neuronal activity near a critical point of a phase transition is a characteristic property that can be used to identify the bifurcation mechanism of the transition. We demonstrate that bursts and avalanches are precursors of a first-order phase transition, paroxysmal-like spikes of activity precede a second-order phase transition caused by a saddle-node bifurcation, while irregular spindle oscillations represent spontaneous activity near a second-order phase transition caused by a supercritical Hopf bifurcation. Our most interesting result is the observation of the paroxysmal-like spikes. We show that a paroxysmal-like spike is a single nonlinear event that appears instantly from a low background activity with a rapid onset, reaches a large amplitude, and ends up with an abrupt return to lower activity. These spikes are similar to single paroxysmal spikes and sharp waves observed in electroencephalographic (EEG) measurements. Our analysis shows that above the saddle-node bifurcation, sustained network oscillations appear with a large amplitude but a small frequency in contrast to network oscillations near the Hopf bifurcation that have a small amplitude but a large frequency. We discuss an amazing similarity between excitability of the cortical model stimulated by shot noise and excitability of the Morris-Lecar neuron stimulated by an applied current.

Link-based formalism for time evolution of adaptive networks

Network topology and nodal dynamics are two fundamental stones of adaptive networks. Detailed and accurate knowledge of these two ingredients is crucial for understanding the evolution and mechanism of adaptive networks. In this paper, by adopting the framework of the adaptive SIS model proposed by Gross et al. [Phys. Rev. Lett. 96, 208701 (2006)] and carefully utilizing the information of degree correlation of the network, we propose a link-based formalism for describing the system dynamics with high accuracy and subtle details. Several specific degree correlation measures are introduced to reveal the coevolution of network topology and system dynamics.

Complexity in a brain-inspired agent-based model

An agent-based model consists of a set of agents representing the components of a system. These agents interact with each other according to rules designed with knowledge of the system in mind. Although rules control the low-level interactions of agents, these models often exhibit emergent behavior at the system level. We apply the agent-based modeling framework to functional brain imaging data. In this model, agents are defined by network nodes and represent brain regions, and links representing functional connectivity between nodes dictate which agents interact. A link between two regions may be positive or negative, depending on the correlation in functional activity between the two regions. Agents are either active or inactive, and systematically update based on the activity of their immediate neighbors. Their dynamics are observed over a certain time period starting from predetermined initial configurations. While the information received by each node is limited by the number of other nodes connected to it, we have shown that this model is capable of producing emergent behavior dependent on global information transfer. Specifically, the system is capable of solving well-described test problems, such as the density classification and synchronization problems. The model is capable of producing a wide range of behaviors varying greatly in complexity, including oscillations with cycles ranging from a few steps to hundreds, and non-repeating patterns over hundreds of thousands of time steps. We believe this wide dynamic range may impart the potential for this system to produce a myriad of brain-like functional states.

High-accuracy approximation of binary-state dynamics on networks

Binary-state dynamics (such as the susceptible-infected-susceptible (SIS) model of disease spread, or Glauber spin dynamics) on random networks are accurately approximated using master equations. Standard mean-field and pairwise theories are shown to result from seeking approximate solutions of the master equations. Applications to the calculation of SIS epidemic thresholds and critical points of nonequilibrium spin models are also demonstrated.

Heterogeneous k-core versus bootstrap percolation on complex networks

We introduce the heterogeneous k-core, which generalizes the k-core, and contrast it with bootstrap percolation. Vertices have a threshold r(i), that may be different at each vertex. If a vertex has fewer than r(i) neighbors it is pruned from the network. The heterogeneous k-core is the subgraph remaining after no further vertices can be pruned. If the thresholds r(i) are 1 with probability f, or k ≥ 3 with probability 1-f, the process can be thought of as a pruning process counterpart to ordinary bootstrap percolation, which is an activation process. We show that there are two types of transitions in this heterogeneous k-core process: the giant heterogeneous k-core may appear with a continuous transition and there may be a second discontinuous hybrid transition. We compare critical phenomena, critical clusters, and avalanches at the heterogeneous k-core and bootstrap percolation transitions. We also show that the network structure has a crucial effect on these processes, with the giant heterogeneous k-core appearing immediately at a finite value for any f>0 when the degree distribution tends to a power law P(q)~q(-γ) with γ<3.

Bootstrap percolation on complex networks

We consider bootstrap percolation on uncorrelated complex networks. We obtain the phase diagram for this process with respect to two parameters: f, the fraction of vertices initially activated, and p, the fraction of undamaged vertices in the graph. We observe two transitions: the giant active component appears continuously at a first threshold. There may also be a second, discontinuous, hybrid transition at a higher threshold. Avalanches of activations increase in size as this second critical point is approached, finally diverging at this threshold. We describe the existence of a special critical point at which this second transition first appears. In networks with degree distributions whose second moment diverges (but whose first moment does not), we find a qualitatively different behavior. In this case the giant active component appears for any f>0 and p>0, and the discontinuous transition is absent. This means that the giant active component is robust to damage, and also is very easily activated. We also formulate a generalized bootstrap process in which each vertex can have an arbitrary threshold.