Browse
Submit Data
Databases
API
Help

Dataset Information

31 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Oscillations and filtering networks support flexible routing of information.

ABSTRACT: The mammalian brain exhibits profuse interregional connectivity. How information flow is rapidly and flexibly switched among connected areas remains poorly understood. Task-dependent changes in the power and interregion coherence of network oscillations suggest that such oscillations play a role in signal routing. We show that switching one of several convergent pathways from an asynchronous to an oscillatory state allows accurate selective transmission of population-coded information, which can be extracted even when other convergent pathways fire asynchronously at comparable rates. We further show that the band-pass filtering required to perform this information extraction can be implemented in a simple spiking network model with a single feed-forward interneuron layer. This constitutes a mechanism for flexible signal routing in neural circuits, which exploits sparsely synchronized network oscillations and temporal filtering by feed-forward inhibition.

SUBMITTER: Akam T

PROVIDER: S-EPMC3125699 | biostudies-literature | 2010 Jul

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Oscillations and filtering networks support flexible routing of information.

Akam Thomas T Kullmann Dimitri M DM

Neuron 20100701 2

The mammalian brain exhibits profuse interregional connectivity. How information flow is rapidly and flexibly switched among connected areas remains poorly understood. Task-dependent changes in the power and interregion coherence of network oscillations suggest that such oscillations play a role in signal routing. We show that switching one of several convergent pathways from an asynchronous to an oscillatory state allows accurate selective transmission of population-coded information, which can ...[more]

PMID: 20670837

Similar Datasets

Dynamic information routing in complex networks.

Project description:Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function.

| S-EPMC4832059 | biostudies-literature

Information filtering on coupled social networks.

Project description:In this paper, based on the coupled social networks (CSN), we propose a hybrid algorithm to nonlinearly integrate both social and behavior information of online users. Filtering algorithm, based on the coupled social networks, considers the effects of both social similarity and personalized preference. Experimental results based on two real datasets, Epinions and Friendfeed, show that the hybrid pattern can not only provide more accurate recommendations, but also enlarge the recommendation coverage while adopting global metric. Further empirical analyses demonstrate that the mutual reinforcement and rich-club phenomenon can also be found in coupled social networks where the identical individuals occupy the core position of the online system. This work may shed some light on the in-depth understanding of the structure and function of coupled social networks.

| S-EPMC4086959 | biostudies-literature

Information Filtering via Heterogeneous Diffusion in Online Bipartite Networks.

Project description:The rapid expansion of Internet brings us overwhelming online information, which is impossible for an individual to go through all of it. Therefore, recommender systems were created to help people dig through this abundance of information. In networks composed by users and objects, recommender algorithms based on diffusion have been proven to be one of the best performing methods. Previous works considered the diffusion process from user to object, and from object to user to be equivalent. We show in this work that it is not the case and we improve the quality of the recommendation by taking into account the asymmetrical nature of this process. We apply this idea to modify the state-of-the-art recommendation methods. The simulation results show that the new methods can outperform these existing methods in both recommendation accuracy and diversity. Finally, this modification is checked to be able to improve the recommendation in a realistic case.

| S-EPMC4488376 | biostudies-literature

A Topological Criterion for Filtering Information in Complex Brain Networks.

Project description:In many biological systems, the network of interactions between the elements can only be inferred from experimental measurements. In neuroscience, non-invasive imaging tools are extensively used to derive either structural or functional brain networks in-vivo. As a result of the inference process, we obtain a matrix of values corresponding to a fully connected and weighted network. To turn this into a useful sparse network, thresholding is typically adopted to cancel a percentage of the weakest connections. The structural properties of the resulting network depend on how much of the inferred connectivity is eventually retained. However, how to objectively fix this threshold is still an open issue. We introduce a criterion, the efficiency cost optimization (ECO), to select a threshold based on the optimization of the trade-off between the efficiency of a network and its wiring cost. We prove analytically and we confirm through numerical simulations that the connection density maximizing this trade-off emphasizes the intrinsic properties of a given network, while preserving its sparsity. Moreover, this density threshold can be determined a-priori, since the number of connections to filter only depends on the network size according to a power-law. We validate this result on several brain networks, from micro- to macro-scales, obtained with different imaging modalities. Finally, we test the potential of ECO in discriminating brain states with respect to alternative filtering methods. ECO advances our ability to analyze and compare biological networks, inferred from experimental data, in a fast and principled way.

| S-EPMC5268647 | biostudies-literature

A Polya urn approach to information filtering in complex networks.

Project description:The increasing availability of data demands for techniques to filter information in large complex networks of interactions. A number of approaches have been proposed to extract network backbones by assessing the statistical significance of links against null hypotheses of random interaction. Yet, it is well known that the growth of most real-world networks is non-random, as past interactions between nodes typically increase the likelihood of further interaction. Here, we propose a filtering methodology inspired by the Pólya urn, a combinatorial model driven by a self-reinforcement mechanism, which relies on a family of null hypotheses that can be calibrated to assess which links are statistically significant with respect to a given network's own heterogeneity. We provide a full characterization of the filter, and show that it selects links based on a non-trivial interplay between their local importance and the importance of the nodes they belong to.

| S-EPMC6375975 | biostudies-literature

Entanglement-Gradient Routing for Quantum Networks.

Project description:We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

| S-EPMC5660278 | biostudies-literature

Robust information routing by dorsal subiculum neurons.

Project description:The dorsal hippocampus conveys various information associated with spatial navigation; however, how the information is distributed to multiple downstream areas remains unknown. We investigated this by identifying axonal projections using optogenetics during large-scale recordings from the rat subiculum, the major hippocampal output structure. Subicular neurons demonstrated a noise-resistant representation of place, speed, and trajectory, which was as accurate as or even more accurate than that of hippocampal CA1 neurons. Speed- and trajectory-dependent firings were most prominent in neurons projecting to the retrosplenial cortex and nucleus accumbens, respectively. Place-related firing was uniformly observed in neurons targeting the retrosplenial cortex, nucleus accumbens, anteroventral thalamus, and medial mammillary body. Theta oscillations and sharp-wave/ripples tightly controlled the firing of projection neurons in a target region-specific manner. In conclusion, the dorsal subiculum robustly routes diverse navigation-associated information to downstream areas.

| S-EPMC7946376 | biostudies-literature

What Information Works Best?: A Comparison of Routing Methods.

Project description:There are many item selection methods proposed for computerized adaptive testing (CAT) applications. However, not all of them have been used in computerized multistage testing (ca-MST). This study uses some item selection methods as a routing method in ca-MST framework. These are maximum Fisher information (MFI), maximum likelihood weighted information (MLWI), maximum posterior weighted information (MPWI), Kullback-Leibler (KL), and posterior Kullback-Leibler (KLP). The main purpose of this study is to examine the performance of these methods when they are used as a routing method in ca-MST applications. These five information methods under four ca-MST panel designs and two test lengths (30 items and 60 items) were tested using the parameters of a real item bank. Results were evaluated with overall findings (mean bias, root mean square error, correlation between true and estimated thetas, and module exposure rates) and conditional findings (conditional absolute bias, standard error of measurement, and root mean square error). It was found that test length affected the outcomes much more than other study conditions. Under 30-item conditions, 1-3 designs outperformed other panel designs. Under 60-item conditions, 1-3-3 designs were better than other panel designs. Each routing method performed well under particular conditions; there was no clear best method in the studied conditions. The recommendations for routing methods in any particular condition were provided for researchers and practitioners as well as the limitations of these results.

| S-EPMC6373851 | biostudies-literature

A spectrum of routing strategies for brain networks.

Project description:Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally "cheap" but inefficient. We introduce a stochastic model for network communication that combines local and global information about the network topology to generate biased random walks on the network. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communication processes at the limiting extremes. We implement the model on two cohorts of human connectome networks and investigate the effects of varying the global information bias on the network's communication cost. We identify routing strategies that approach a (highly efficient) shortest-path communication process with a relatively small global information bias on the system's dynamics. Moreover, we show that the cost of routing messages from and to hub nodes varies as a function of the global information bias driving the system's dynamics. Finally, we implement the model to identify individual subject differences from a communication dynamics point of view. The present framework departs from the classical shortest paths vs. diffusion dichotomy, unifying both models under a single family of dynamical processes that differ by the extent to which global information about the network topology influences the routing patterns of neural signals traversing the network.

| S-EPMC6426276 | biostudies-literature

Caring in the Information Age: Personal Online Networks to Improve Caregiver Support.

Project description:It is becoming increasingly important to find ways for caregivers and service providers to collaborate. This study explored the potential for improving care and social support through shared online network use by family caregivers and service providers in home care.This qualitative study was guided by Rogers' Theory of Diffusion of Innovations [NY: Free Press; 1995], and involved focus group and individual interviews of service providers (n = 31) and family caregivers (n = 4). Interview transcriptions were analyzed using descriptive, topic, and analytic coding, followed by thematic analysis.The network was identified as presenting an opportunity to fill communication gaps presented by other modes of communication and further enhance engagement with families. Barriers included time limitations and policy-related restrictions, privacy, security, and information ownership.Online networks may help address longstanding home-care issues around communication and information-sharing. The success of online networks in home care requires support from care partners. Future research should pilot the use of online networks in home care using barrier and facilitator considerations from this study.

| S-EPMC5495540 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data