skip to main content


Title: Finding influential nodes for integration in brain networks using optimal percolation theory
Abstract

Global integration of information in the brain results from complex interactions of segregated brain networks. Identifying the most influential neuronal populations that efficiently bind these networks is a fundamental problem of systems neuroscience. Here, we apply optimal percolation theory and pharmacogenetic interventions in vivo to predict and subsequently target nodes that are essential for global integration of a memory network in rodents. The theory predicts that integration in the memory network is mediated by a set of low-degree nodes located in the nucleus accumbens. This result is confirmed with pharmacogenetic inactivation of the nucleus accumbens, which eliminates the formation of the memory network, while inactivations of other brain areas leave the network intact. Thus, optimal percolation theory predicts essential nodes in brain networks. This could be used to identify targets of interventions to modulate brain function.

 
more » « less
NSF-PAR ID:
10154352
Author(s) / Creator(s):
; ; ; ; ; ; ; ; ;
Publisher / Repository:
Nature Publishing Group
Date Published:
Journal Name:
Nature Communications
Volume:
9
Issue:
1
ISSN:
2041-1723
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    Quantum networks describe communication networks that are based on quantum entanglement. A concurrence percolation theory has been recently developed to determine the required entanglement to enable communication between two distant stations in an arbitrary quantum network. Unfortunately, concurrence percolation has been calculated only for very small networks or large networks without loops. Here, we develop a set of mathematical tools for approximating the concurrence percolation threshold for unprecedented large-scale quantum networks by estimating the path-length distribution, under the assumption that all paths between a given pair of nodes have no overlap. We show that our approximate method agrees closely with analytical results from concurrence percolation theory. The numerical results we present include 2D square lattices of 2002nodes and complex networks of up to 104nodes. The entanglement percolation threshold of a quantum network is a crucial parameter for constructing a real-world communication network based on entanglement, and our method offers a significant speed-up for the intensive computations involved.

     
    more » « less
  2. Abstract

    The integrity and functionality of many real-world complex systems hinge on a small set of pivotal nodes, or influencers. In different contexts, these influencers are defined as either structurally important nodes that maintain the connectivity of networks, or dynamically crucial units that can disproportionately impact certain dynamical processes. In practice, identification of the optimal set of influencers in a given system has profound implications in a variety of disciplines. In this review, we survey recent advances in the study of influencer identification developed from different perspectives, and present state-of-the-art solutions designed for different objectives. In particular, we first discuss the problem of finding the minimal number of nodes whose removal would breakdown the network (i.e. the optimal percolation or network dismantle problem), and then survey methods to locate the essential nodes that are capable of shaping global dynamics with either continuous (e.g. independent cascading models) or discontinuous phase transitions (e.g. threshold models). We conclude the review with a summary and an outlook.

     
    more » « less
  3. null (Ed.)
    Abstract Recent advances in network science, control theory, and fractional calculus provide us with mathematical tools necessary for modeling and controlling complex dynamical networks (CDNs) that exhibit long-term memory. Selecting the minimum number of driven nodes such that the network is steered to a prescribed state is a key problem to guarantee that complex networks have a desirable behavior. Therefore, in this paper, we study the effects of long-term memory and of the topological properties on the minimum number of driven nodes and the required control energy. To this end, we introduce Gramian-based methods for optimal driven node selection for complex dynamical networks with long-term memory and by leveraging the structure of the cost function, we design a greedy algorithm to obtain near-optimal approximations in a computationally efficiently manner. We investigate how the memory and topological properties influence the control effort by considering Erdős–Rényi, Barabási–Albert and Watts–Strogatz networks whose temporal dynamics follow a fractional order state equation. We provide evidence that scale-free and small-world networks are easier to control in terms of both the number of required actuators and the average control energy. Additionally, we show how our method could be applied to control complex networks originating from the human brain and we discover that certain brain cortex regions have a stronger impact on the controllability of network than others. 
    more » « less
  4. Quantum networks have experienced rapid advancements in both theoretical and experimental domains over the last decade, making it increasingly important to understand their large-scale features from the viewpoint of statistical physics. This review paper discusses a fundamental question: how can entanglement be effectively and indirectly (e.g., through intermediate nodes) distributed between distant nodes in an imperfect quantum network, where the connections are only partially entangled and subject to quantum noise? We survey recent studies addressing this issue by drawing exact or approximate mappings to percolation theory, a branch of statistical physics centered on network connectivity. Notably, we show that the classical percolation frameworks do not uniquely define the network’s indirect connectivity. This realization leads to the emergence of an alternative theory called “concurrence percolation”, which uncovers a previously unrecognized quantum advantage that emerges at large scales, suggesting that quantum networks are more resilient than initially assumed within classical percolation contexts, offering refreshing insights into future quantum network design.

     
    more » « less
  5. Abstract

    Percolation theory is often proposed as a framework for understanding flow and transport through fractured rock, yet the applicability of percolation theory to natural systems remains uncertain. Experimental verification of the predictions of percolation theory are challenging because of the difficulty in systematically creating 3D crack networks in crystalline materials. Using ice as a model for rock, we experimentally test the prediction of percolation theory that for a sufficiently large sample, the onset of percolation is isotropic even when the crack network is anisotropic. Consistent with theory, experimentally we find that in strongly anisotropic crack networks induced by uniaxial loading at a sufficiently high strain rate, the onset of percolation is nearly isotropic in samples where the dimension of the sample is about an order of magnitude greater than the length of the largest crack. The onset of percolation is isotropic even though nearly 90% of the induced cracks are oriented within about 10° of the direction of applied compression. A similitude analysis indicates that for typical geotherms and geologic strain rates, crack networks consistent with the predictions of percolation theory are only possible within the upper several tens of km of a nonsubducting granite slab and to depths of several hundreds of km in subducting slabs of gabbro.

     
    more » « less