Yuhan Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yuhan Chen has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Changsong Zhou
Department of Physics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, China
4 shared publications Bambi Hu
Department of Physics, Centre for Nonlinear Studies, and The Beijing-Hong Kong-Singapore Joint Centre for Nonlinear and Complex Systems (Hong Kong), Hong Kong Baptist University, Kowloon Tong, Hong Kong
1 shared publicationBing-Hong Wang
1 shared publication- Bing-Hong Wang
Department of Modern Physics University of Science and Technology of China 230026 Hefei P. R. China
1 shared publication - Claus Christian Hilgetag
Institute of Computational Neuroscience, University Medical Center Hamburg-Eppendorf, Hamburg, Germany
1 shared publication Li-Chao Zhao
1 shared publication
Latest Publications
- 21 December 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 118 (1)
Association of aerobic glycolysis with the structural connectome reveals a benefit–risk balancing mechanism in the human brain
Significance: Aerobic glycolysis (AG) is the nonoxidative metabolism of glucose despite abundant oxygen. High AG is critical for various biological processes in the brain, such as biosynthesis and rapid ATP production, but also identifies regions most vulnerable to amyloid-β deposition. Currently, the wiring mechanisms underlying the metabolic benefits and risks of AG are largely unknown. Using advanced neuroimaging techniques and computational modelling, we systematically examined the relationship between AG and the connectome. Our results delineate large yet optimized wiring costs in high-AG regions (e.g., default-mode and prefrontal cortices), revealing a balancing mechanism that satisfies metabolic demand while reducing vulnerability risk. This research highlights wiring rules in high-AG regions and deepens our understanding of the relationship between brain metabolism and the connectome.
- 21 December 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 118 (1)
Association of aerobic glycolysis with the structural connectome reveals a benefit–risk balancing mechanism in the human brain
Significance: Aerobic glycolysis (AG) is the nonoxidative metabolism of glucose despite abundant oxygen. High AG is critical for various biological processes in the brain, such as biosynthesis and rapid ATP production, but also identifies regions most vulnerable to amyloid-β deposition. Currently, the wiring mechanisms underlying the metabolic benefits and risks of AG are largely unknown. Using advanced neuroimaging techniques and computational modelling, we systematically examined the relationship between AG and the connectome. Our results delineate large yet optimized wiring costs in high-AG regions (e.g., default-mode and prefrontal cortices), revealing a balancing mechanism that satisfies metabolic demand while reducing vulnerability risk. This research highlights wiring rules in high-AG regions and deepens our understanding of the relationship between brain metabolism and the connectome.
- Open Access
- 7 March 2013
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 9 (3) , e1002937
Trade-off between Multiple Constraints Enables Simultaneous Formation of Modules and Hubs in Neural Systems
The formation of the complex network architecture of neural systems is subject to multiple structural and functional constraints. Two obvious but apparently contradictory constraints are low wiring cost and high processing efficiency, characterized by short overall wiring length and a small average number of processing steps, respectively. Growing evidence shows that neural networks are results from a trade-off between physical cost and functional value of the topology. However, the relationship between these competing constraints and complex topology is not well understood quantitatively. We explored this relationship systematically by reconstructing two known neural networks, Macaque cortical connectivity and C. elegans neuronal connections, from combinatory optimization of wiring cost and processing efficiency constraints, using a control parameter , and comparing the reconstructed networks to the real networks. We found that in both neural systems, the reconstructed networks derived from the two constraints can reveal some important relations between the spatial layout of nodes and the topological connectivity, and match several properties of the real networks. The reconstructed and real networks had a similar modular organization in a broad range of , resulting from spatial clustering of network nodes. Hubs emerged due to the competition of the two constraints, and their positions were close to, and partly coincided, with the real hubs in a range of values. The degree of nodes was correlated with the density of nodes in their spatial neighborhood in both reconstructed and real networks. Generally, the rebuilt network matched a significant portion of real links, especially short-distant ones. These findings provide clear evidence to support the hypothesis of trade-off between multiple constraints on brain networks. The two constraints of wiring cost and processing efficiency, however, cannot explain all salient features in the real networks. The discrepancy suggests that there are further relevant factors that are not yet captured here. What are essential relationships between fundamental physical constraints and the architecture of neural systems? Most existing investigations have considered a single constraint, either wiring cost or processing path efficiency, and little is known about how characteristic neural network features, such as the simultaneous existence of modules and hubs, are related to the constraints from multiple requirements. Here we emphasized the competition between the global wiring cost and an important functional requirement, path efficiency, as factors in forming Macaque cortical connectivity and C. elegans neuronal connections. By comparing real to reconstructed networks using optimization under multiple constraints, we found that several network features are related to the competition of these two constraints, in particular the simultaneous formation of network modules and hubs. However, not all the properties of the real networks could be attributed to these two constraints, suggesting that, likely, there exists additional structural or functional requirements.
- 7 March 2013
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 9 (3) , e1002937
Open AccessTrade-off between Multiple Constraints Enables Simultaneous Formation of Modules and Hubs in Neural Systems
The formation of the complex network architecture of neural systems is subject to multiple structural and functional constraints. Two obvious but apparently contradictory constraints are low wiring cost and high processing efficiency, characterized by short overall wiring length and a small average number of processing steps, respectively. Growing evidence shows that neural networks are results from a trade-off between physical cost and functional value of the topology. However, the relationship between these competing constraints and complex topology is not well understood quantitatively. We explored this relationship systematically by reconstructing two known neural networks, Macaque cortical connectivity and C. elegans neuronal connections, from combinatory optimization of wiring cost and processing efficiency constraints, using a control parameter , and comparing the reconstructed networks to the real networks. We found that in both neural systems, the reconstructed networks derived from the two constraints can reveal some important relations between the spatial layout of nodes and the topological connectivity, and match several properties of the real networks. The reconstructed and real networks had a similar modular organization in a broad range of , resulting from spatial clustering of network nodes. Hubs emerged due to the competition of the two constraints, and their positions were close to, and partly coincided, with the real hubs in a range of values. The degree of nodes was correlated with the density of nodes in their spatial neighborhood in both reconstructed and real networks. Generally, the rebuilt network matched a significant portion of real links, especially short-distant ones. These findings provide clear evidence to support the hypothesis of trade-off between multiple constraints on brain networks. The two constraints of wiring cost and processing efficiency, however, cannot explain all salient features in the real networks. The discrepancy suggests that there are further relevant factors that are not yet captured here. What are essential relationships between fundamental physical constraints and the architecture of neural systems? Most existing investigations have considered a single constraint, either wiring cost or processing path efficiency, and little is known about how characteristic neural network features, such as the simultaneous existence of modules and hubs, are related to the constraints from multiple requirements. Here we emphasized the competition between the global wiring cost and an important functional requirement, path efficiency, as factors in forming Macaque cortical connectivity and C. elegans neuronal connections. By comparing real to reconstructed networks using optimization under multiple constraints, we found that several network features are related to the competition of these two constraints, in particular the simultaneous formation of network modules and hubs. However, not all the properties of the real networks could be attributed to these two constraints, suggesting that, likely, there exists additional structural or functional requirements.
- 28 October 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 82 (4) , 046225
Complexity versus modularity and heterogeneity in oscillatory networks: Combining segregation and integration in neural systems
Normal functioning in many realistic complex dynamical systems, such as neural networks, requires coherence and synchronization for collective actions of network components. However, strong synchronization of the whole network is often related to pathological situations. A regime in between enabling both segregation in subsystems and integration as a whole is thus desirable. Here, we characterize this regime by complexity of synchronization patterns and study its relationship to heterogeneous and modular architecture in complex network of oscillators. We show that these networks possess a broad range of high complexity associated with the formation of dynamical clusters and the coordination between the clusters. In realistic networks of C. elegans and cat cortex, the complexity is reduced when the original network is rewired in various ways, reflecting that the neural systems are organized to provide a combination of segregation and integration with the coexistence of various complex network features, especially modularity and heterogeneity. Our work can stimulate further studies on structure-function relationships in neural systems through the inquiry of the specific functional roles of the intermediate dynamical regime.
- 28 October 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 82 (4) , 046225
Complexity versus modularity and heterogeneity in oscillatory networks: Combining segregation and integration in neural systems
Normal functioning in many realistic complex dynamical systems, such as neural networks, requires coherence and synchronization for collective actions of network components. However, strong synchronization of the whole network is often related to pathological situations. A regime in between enabling both segregation in subsystems and integration as a whole is thus desirable. Here, we characterize this regime by complexity of synchronization patterns and study its relationship to heterogeneous and modular architecture in complex network of oscillators. We show that these networks possess a broad range of high complexity associated with the formation of dynamical clusters and the coordination between the clusters. In realistic networks of C. elegans and cat cortex, the complexity is reduced when the original network is rewired in various ways, reflecting that the neural systems are organized to provide a combination of segregation and integration with the coexistence of various complex network features, especially modularity and heterogeneity. Our work can stimulate further studies on structure-function relationships in neural systems through the inquiry of the specific functional roles of the intermediate dynamical regime.
- 4 June 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 81 (6) , 066105
Optimal transport on supply-demand networks
In the literature, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grids and supply chain networks, show a far different scenario in which nodes are classified into two categories: supply nodes provide some kinds of services, while demand nodes require them. In this paper, we propose a general transport model for these supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogeneous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the near optimal configuration of supply nodes, which remarkably enhances the transport capacity compared with a random configuration and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.
- 4 June 2010
- Published by American Physical Society (APS) in Physical Review E
- Vol. 81 (6) , 066105
Optimal transport on supply-demand networks
In the literature, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grids and supply chain networks, show a far different scenario in which nodes are classified into two categories: supply nodes provide some kinds of services, while demand nodes require them. In this paper, we propose a general transport model for these supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogeneous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the near optimal configuration of supply nodes, which remarkably enhances the transport capacity compared with a random configuration and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.