3,613 research outputs found

    Locally embedded presages of global network bursts

    Full text link
    Spontaneous, synchronous bursting of neural population is a widely observed phenomenon in nervous networks, which is considered important for functions and dysfunctions of the brain. However, how the global synchrony across a large number of neurons emerges from an initially non-bursting network state is not fully understood. In this study, we develop a new state-space reconstruction method combined with high-resolution recordings of cultured neurons. This method extracts deterministic signatures of upcoming global bursts in "local" dynamics of individual neurons during non-bursting periods. We find that local information within a single-cell time series can compare with or even outperform the global mean field activity for predicting future global bursts. Moreover, the inter-cell variability in the burst predictability is found to reflect the network structure realized in the non-bursting periods. These findings demonstrate the deterministic mechanisms underlying the locally concentrated early-warnings of the global state transition in self-organized networks

    Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity

    Full text link
    The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents. However, the theory for nonlinear agents using probing inputs is less developed and relies on dynamics linearization. We use global convergence properties of the network, which can be assured using passivity theory, to present a network identification method for nonlinear agents. We do so by linearizing the steady-state equations rather than the dynamics, achieving a sub-cubic time algorithm for network identification. We also study the problem of network identification from a complexity theory standpoint, showing that the presented algorithms are optimal in terms of time complexity. We also demonstrate the presented algorithm in two case studies.Comment: 12 pages, 3 figure
    • …
    corecore