Leveraging network structure in centrality evaluation of large scale networks

Author(s):  
Sima Das ◽  
Sajal K. Das
2021 ◽  
Author(s):  
Sebastian Markett ◽  
David Nothdurfter ◽  
Antonia Focsa ◽  
Martin Reuter ◽  
Philippe Jawinski

Attention network theory states that attention is not a unified construct but consists of three independent systems that are supported by separable distributed networks: an alerting network to deploy attentional resources in anticipation of upcoming events, an orienting network to direct attention to a cued location, and a control network to select relevant information at the expense of concurrently available information. Ample behavioral and neuroimaging evidence supports the dissociation of the three attention domains. The strong assumption that each attentional system is realized through a separable network, however, raises the question how these networks relate to the intrinsic network structure of the brain. Our understanding of brain networks has advanced majorly in the past years due to the increasing focus on brain connectivity. It is well established that the brain is intrinsically organized into several large-scale networks whose modular structure persists across task states. Existing proposals on how the presumed attention networks relate to intrinsic networks rely mostly on anecdotal and partly contradictory arguments. We addressed this issue by mapping different attention networks with highest spatial precision at the level of cifti-grayordinates. Resulting group maps were compared to the group-level topology of 23 intrinsic networks which we reconstructed from the same participants' resting state fMRI data. We found that all attention domains recruited multiple and partly overlapping intrinsic networks and converged in the dorsal fronto-parietal and midcingulo-insular network. While we observed a preference of each attentional domain for its own set of intrinsic networks, implicated networks did not match well to those proposed in the literature. Our results indicate a necessary refinement of the attention network theory.


2021 ◽  
Author(s):  
Chaolong Ying ◽  
Jing Liu ◽  
Kai Wu ◽  
Chao Wang

Currently, the problem of uncovering complex network structure and dynamics from time series is prominent in many fields. Despite the recent progress in this area, reconstructing large-scale networks from limited data remains a tough problem. Existing works treat connections of nodes as continuous values, leaving a challenge of setting a proper cut-off value to distinguish whether the connections exist or not. Besides, their performances on large-scale networks are far from satisfactory. Considering the reconstruction error and sparsity as two objectives, this paper proposes a subspace learning based evolutionary multiobjective network reconstruction algorithm, termed as SLEMO-NR, to solve the aforementioned problems. In the evolutionary process, we assume that binary-coded individuals obey the Bernoulli distribution and can use the probability and natural parameter as the alternative representations. Moreover, our approach utilizes the logistic principal component analysis (LPCA) to learn a subspace containing the features of network structure. The offspring solutions are generated in the learned subspace and then can be mapped back to the original space via LPCA. Benefitting from the alternative representations, a preference-based local search operator is proposed to concentrate on finding solutions approximate to the true sparsity. The experimental results on synthetic networks and six real-world networks demonstrate that, due to the well-learned network structure subspace and the preference-based strategy, our approach is effective in reconstructing large-scale networks compared to six existing methods.


2018 ◽  
Vol 7 (3.2) ◽  
pp. 550
Author(s):  
Valerii Usenko ◽  
Olga Kodak ◽  
Iryna Usenko

Improving the efficiency of the functioning of the engineering networks of cities involves solving the issues of expanding and deepening the process of studying the interconnection of its components.An approximate definition of the property of the network structure's connectivity belongs to the conceptual class of diminishing the dimension of the multiplicity of system parameters. It studies the structures of networks with arbitrary reliability of its constituent parts. The reflection of the reliability values of the components of a redundant engineering network structure is appropriate for large-scale networks. The multiplicity of the network is projected onto the subspace of its parameters with variable values of the argument of the function of the integrity of the connectivity.  


2021 ◽  
Author(s):  
Chaolong Ying ◽  
Jing Liu ◽  
Kai Wu ◽  
Chao Wang

Currently, the problem of uncovering complex network structure and dynamics from time series is prominent in many fields. Despite the recent progress in this area, reconstructing large-scale networks from limited data remains a tough problem. Existing works treat connections of nodes as continuous values, leaving a challenge of setting a proper cut-off value to distinguish whether the connections exist or not. Besides, their performances on large-scale networks are far from satisfactory. Considering the reconstruction error and sparsity as two objectives, this paper proposes a subspace learning based evolutionary multiobjective network reconstruction algorithm, termed as SLEMO-NR, to solve the aforementioned problems. In the evolutionary process, we assume that binary-coded individuals obey the Bernoulli distribution and can use the probability and natural parameter as the alternative representations. Moreover, our approach utilizes the logistic principal component analysis (LPCA) to learn a subspace containing the features of network structure. The offspring solutions are generated in the learned subspace and then can be mapped back to the original space via LPCA. Benefitting from the alternative representations, a preference-based local search operator is proposed to concentrate on finding solutions approximate to the true sparsity. The experimental results on synthetic networks and six real-world networks demonstrate that, due to the well-learned network structure subspace and the preference-based strategy, our approach is effective in reconstructing large-scale networks compared to six existing methods.


2021 ◽  
Author(s):  
Miguel Dasilva ◽  
Christian Brandt ◽  
Marc Alwin Gieselmann ◽  
Claudia Distler ◽  
Alexander Thiele

Abstract Top-down attention, controlled by frontal cortical areas, is a key component of cognitive operations. How different neurotransmitters and neuromodulators flexibly change the cellular and network interactions with attention demands remains poorly understood. While acetylcholine and dopamine are critically involved, glutamatergic receptors have been proposed to play important roles. To understand their contribution to attentional signals, we investigated how ionotropic glutamatergic receptors in the frontal eye field (FEF) of male macaques contribute to neuronal excitability and attentional control signals in different cell types. Broad-spiking and narrow-spiking cells both required N-methyl-D-aspartic acid and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid receptor activation for normal excitability, thereby affecting ongoing or stimulus-driven activity. However, attentional control signals were not dependent on either glutamatergic receptor type in broad- or narrow-spiking cells. A further subdivision of cell types into different functional types using cluster-analysis based on spike waveforms and spiking characteristics did not change the conclusions. This can be explained by a model where local blockade of specific ionotropic receptors is compensated by cell embedding in large-scale networks. It sets the glutamatergic system apart from the cholinergic system in FEF and demonstrates that a reduction in excitability is not sufficient to induce a reduction in attentional control signals.


2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Siddharth Arora ◽  
Alexandra Brintrup

AbstractThe relationship between a firm and its supply chain has been well studied, however, the association between the position of firms in complex supply chain networks and their performance has not been adequately investigated. This is primarily due to insufficient availability of empirical data on large-scale networks. To addresses this gap in the literature, we investigate the relationship between embeddedness patterns of individual firms in a supply network and their performance using empirical data from the automotive industry. In this study, we devise three measures that characterize the embeddedness of individual firms in a supply network. These are namely: centrality, tier position, and triads. Our findings caution us that centrality impacts individual performance through a diminishing returns relationship. The second measure, tier position, allows us to investigate the concept of tiers in supply networks because we find that as networks emerge, the boundaries between tiers become unclear. Performance of suppliers degrade as they move away from the focal firm (i.e., Toyota). The final measure, triads, investigates the effect of buying and selling to firms that supply the same customer, portraying the level of competition and cooperation in a supplier’s network. We find that increased coopetition (i.e., cooperative competition) is a performance enhancer, however, excessive complexity resulting from being involved in both upstream and downstream coopetition results in diminishing performance. These original insights help understand the drivers of firm performance from a network perspective and provide a basis for further research.


2009 ◽  
Vol 10 (1) ◽  
pp. 19 ◽  
Author(s):  
Tatsunori B Hashimoto ◽  
Masao Nagasaki ◽  
Kaname Kojima ◽  
Satoru Miyano

Sign in / Sign up

Export Citation Format

Share Document