15
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Parvalbumin + interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Parvalbumin-positive (PV +) GABAergic interneurons in hippocampal microcircuits are thought to play a key role in several higher network functions, such as feedforward and feedback inhibition, network oscillations, and pattern separation. Fast lateral inhibition mediated by GABAergic interneurons may implement a winner-takes-all mechanism in the hippocampal input layer. However, it is not clear whether the functional connectivity rules of granule cells (GCs) and interneurons in the dentate gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings from up to seven GCs and up to four PV + interneurons in the dentate gyrus, we find that connectivity is structured in space, synapse-specific, and enriched in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV + interneuron) is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits itself). Thus, unique connectivity rules may enable the dentate gyrus to perform specific higher-order computations.

          Abstract

          GABAergic interneurons are known to provide inhibition to allow computational function of neuronal network. Here, Espinoza and colleagues show that connectivity of granule cells and interneurons in the dentate gyrus of mouse hippocampus are consistent with the circuit architecture capable of performing a winners-take-all mechanism.

          Related collections

          Most cited references61

          • Record: found
          • Abstract: not found
          • Article: not found

          Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing

            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Emergence of scaling in random networks

            Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites. A model based on these two ingredients reproduces the observed stationary scale-free distributions, indicating that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Error and attack tolerance of complex networks

              Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. In this paper we demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks. We find that scale-free networks, describing a number of systems, such as the World Wide Web, Internet, social networks or a cell, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected by even unrealistically high failure rates. However, error tolerance comes at a high price: these networks are extremely vulnerable to attacks, i.e. to the selection and removal of a few nodes that play the most important role in assuring the network's connectivity.
                Bookmark

                Author and article information

                Contributors
                peter.jonas@ist.ac.at
                Journal
                Nat Commun
                Nat Commun
                Nature Communications
                Nature Publishing Group UK (London )
                2041-1723
                2 November 2018
                2 November 2018
                2018
                : 9
                : 4605
                Affiliations
                [1 ]ISNI 0000000404312247, GRID grid.33565.36, IST Austria (Institute of Science and Technology Austria), ; Am Campus 1, 3400 Klosterneuburg, Austria
                [2 ]ISNI 0000 0001 0008 2788, GRID grid.417521.4, Present Address: Institute for Molecular Biotechnology (IMBA), ; Dr. Bohr-Gasse 3, 1030 Wien, Austria
                Author information
                http://orcid.org/0000-0003-4710-2082
                http://orcid.org/0000-0003-2209-5242
                http://orcid.org/0000-0001-5001-4804
                Article
                6899
                10.1038/s41467-018-06899-3
                6214995
                30389916
                1fa00574-b0ed-4d3d-b27e-e4e863066da5
                © The Author(s) 2018

                Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.

                History
                : 11 August 2018
                : 2 October 2018
                Funding
                Funded by: FundRef https://doi.org/10.13039/501100000781, EC | European Research Council (ERC);
                Award ID: 692692
                Award Recipient :
                Funded by: FundRef https://doi.org/10.13039/501100002428, Austrian Science Fund (FWF Der Wissenschaftsfonds);
                Award ID: Z 312-B27
                Award Recipient :
                Categories
                Article
                Custom metadata
                © The Author(s) 2018

                Uncategorized
                Uncategorized

                Comments

                Comment on this article