Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userBacktracking activation impacts the criticality of excitable networks
161
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Networks of excitable elements are widely used to model real-world biological and social systems. The dynamic range of an excitable network quantifies the range of stimulus intensities that can be robustly distinguished by the network response, and is maximized at the critical state. In this study, we examine the impacts of backtracking activation on system criticality in excitable networks consisting of both excitatory and inhibitory units. We find that, for dynamics with refractory states that prohibit backtracking activation, the critical state occurs when the largest eigenvalue of the weighted non-backtracking (WNB) matrix for excitatory units, $lambda^E_{NB}$, is close to one, regardless of the strength of inhibition. In contrast, for dynamics without refractory state in which backtracking activation is allowed, the strength of inhibition affects the critical condition through suppression of backtracking activation. As inhibitory strength increases, backtracking activation is gradually suppressed. Accordingly, the system shifts continuously along a continuum between two extreme regimes -- from one where the criticality is determined by the largest eigenvalue of the weighted adjacency matrix for excitatory units, $lambda^E_W$, to the other where the critical state is reached when $lambda_{NB}^E$ is close to one. For systems in between, we find that $lambda^E_{NB}<1$ and $lambda^E_W>1$ at the critical state. These findings, confirmed by numerical simulations using both random and synthetic neural networks, indicate that backtracking activation impacts the criticality of excitable networks.
rate research
Read More
We study the strategy to optimally maximize the dynamic range of excitable networks by removing the minimal number of links. A network of excitable elements can distinguish a broad range of stimulus intensities and has its dynamic range maximized at criticality. In this study, we formulate the activation propagation in excitable networks as a message passing process in which the critical state is reached when the largest eigenvalue of the weighted non-backtracking (WNB) matrix is exactly one. By considering the impact of single link removal on the largest eigenvalue, we develop an efficient algorithm that aims to identify the optimal set of links whose removal will drive the system to the critical state. Comparisons with other competing heuristics on both synthetic and real-world networks indicate that the proposed method can maximize the dynamic range by removing the smallest number of links, and at the same time maintain the largest size of the giant connected component.
Population bursts in a large ensemble of coupled elements result from the interplay between the local excitable properties of the nodes and the global network topology. Here collective excitability and self-sustained bursting oscillations are shown to spontaneously emerge in adaptive networks of globally coupled non-excitable units. The ingredients to observe collective excitability are the coexistence of states with different degree of synchronizaton joined to a global feedback acting, on a slow timescale, against the synchronization (desynchronization) of the oscillators. These regimes are illustrated for two paradigmatic classes of coupled rotators: namely, the Kuramoto model with and without inertia. For the bimodal Kuramoto model we analytically show that the macroscopic evolution originates from the existence of a critical manifold organizing the fast collective dynamics on a slow timescale. Our results provide evidence that adaptation can induce excitability by maintaining a network permanently out-of-equilibrium.
In self-organized criticality (SOC) models, as well as in standard phase transitions, criticality is only present for vanishing driving external fields $h rightarrow 0$. Considering that this is rarely the case for natural systems, such a restriction poses a challenge to the explanatory power of these models. Besides that, in models of dissipative systems like earthquakes, forest fires and neuronal networks, there is no true critical behavior, as expressed in clean power laws obeying finite-size scaling, but a scenario called dirty criticality or self-organized quasi-criticality (SOqC). Here, we propose simple homeostatic mechanisms which promote self-organization of coupling strengths, gains, and firing thresholds in neuronal networks. We show that near criticality can be reached and sustained even in the presence of external inputs because the firing thresholds adapt to and cancel the inputs, a phenomenon similar to perfect adaptation in sensory systems. Similar mechanisms can be proposed for the couplings and local thresholds in spin systems and cellular automata, which could lead to applications in earthquake, forest fire, stellar flare, voting and epidemic modeling.
Small-world networks describe many important practical systems among which neural networks consisting of excitable nodes are the most typical ones. In this paper we study self-sustained oscillations of target waves in excitable small-world networks. A novel dominant phase-advanced driving (DPAD) method, which is generally applicable for analyzing all oscillatory complex networks consisting of nonoscillatory nodes, is proposed to reveal the self-organized structures supporting this type of oscillations. The DPAD method explicitly explores the oscillation sources and wave propagation paths of the systems, which are otherwise deeply hidden in the complicated patterns of randomly distributed target groups. Based on the understanding of the self-organized structure, the oscillatory patterns can be controlled with extremely high efficiency.
It has been proposed that adaptation in complex systems is optimized at the critical boundary between ordered and disordered dynamical regimes. Here, we review models of evolving dynamical networks that lead to self-organization of network topology based on a local coupling between a dynamical order parameter and rewiring of network connectivity, with convergence towards criticality in the limit of large network size $N$. In particular, two adaptive schemes are discussed and compared in the context of Boolean Networks and Threshold Networks: 1) Active nodes loose links, frozen nodes aquire new links, 2) Nodes with correlated activity connect, de-correlated nodes disconnect. These simple local adaptive rules lead to co-evolution of network topology and -dynamics. Adaptive networks are strikingly different from random networks: They evolve inhomogeneous topologies and broad plateaus of homeostatic regulation, dynamical activity exhibits $1/f$ noise and attractor periods obey a scale-free distribution. The proposed co-evolutionary mechanism of topological self-organization is robust against noise and does not depend on the details of dynamical transition rules. Using finite-size scaling, it is shown that networks converge to a self-organized critical state in the thermodynamic limit. Finally, we discuss open questions and directions for future research, and outline possible applications of these models to adaptive systems in diverse areas.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
