scholarly journals A Parallel Algorithm for Computing Shortest Paths In Large-Scale Networks

2005 ◽  
pp. 975-978
Author(s):  
Guozhen Tan ◽  
Xiaohui Ping
Keyword(s):  
Parallel Algorithm ◽  
Large Scale ◽  
Shortest Paths ◽  
Large Scale Networks

scholarly journals Identifying Node Importance in a Complex Network Based on Node Bridging Feature

2018 ◽  
Vol 8 (10) ◽  
pp. 1914 ◽  
Author(s):  
Lincheng Jiang ◽  
Yumei Jing ◽  
Shengze Hu ◽  
Bin Ge ◽  
Weidong Xiao
Keyword(s):  
Complex Networks ◽  
Large Scale ◽  
Shortest Paths ◽  
Evaluation Criteria ◽  
Local Network ◽  
Network Efficiency ◽  
Network Attack ◽  
Node Importance ◽  
Pass Through ◽  
Large Scale Networks

Identifying node importance in complex networks is of great significance to improve the network damage resistance and robustness. In the era of big data, the size of the network is huge and the network structure tends to change dynamically over time. Due to the high complexity, the algorithm based on the global information of the network is not suitable for the analysis of large-scale networks. Taking into account the bridging feature of nodes in the local network, this paper proposes a simple and efficient ranking algorithm to identify node importance in complex networks. In the algorithm, if there are more numbers of node pairs whose shortest paths pass through the target node and there are less numbers of shortest paths in its neighborhood, the bridging function of the node between its neighborhood nodes is more obvious, and its ranking score is also higher. The algorithm takes only local information of the target nodes, thereby greatly improving the efficiency of the algorithm. Experiments performed on real and synthetic networks show that the proposed algorithm is more effective than benchmark algorithms on the evaluation criteria of the maximum connectivity coefficient and the decline rate of network efficiency, no matter in the static or dynamic attack manner. Especially in the initial stage of attack, the advantage is more obvious, which makes the proposed algorithm applicable in the background of limited network attack cost.

A parallel algorithm for analysis of large-scale networks

1996 ◽  
Vol 31 (1-2) ◽  
pp. 375-378
Author(s):  
A. Edwin Alexander ◽  
Adel L. Ali
Keyword(s):  
Parallel Algorithm ◽  
Large Scale ◽  
Large Scale Networks

scholarly journals Approximation Algorithm for Shortest Path in Large Social Networks

Algorithms ◽  
2020 ◽  
Vol 13 (2) ◽  
pp. 36 ◽  
Author(s):  
Dennis Nii Ayeh Mensah ◽  
Hui Gao ◽  
Liang Wei Yang
Keyword(s):  
Approximation Algorithm ◽  
Large Scale ◽  
High Efficiency ◽  
Shortest Paths ◽  
Real Life ◽  
Original Network ◽  
Hierarchical Networks ◽  
Life Data ◽  
Real Life Data ◽  
Large Scale Networks

Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost. We propose an efficient and a more accurate approximation algorithm that is applicable to large scale networks. Our algorithm iteratively constructs levels of hierarchical networks by a node condensing procedure to construct hierarchical graphs until threshold. The shortest paths between nodes in the original network are approximated by considering their corresponding shortest paths in the highest hierarchy. Experiments on real life data show that our algorithm records high efficiency and accuracy compared with other algorithms.

scholarly journals Contribution of Ionotropic Glutamatergic Receptors to Excitability and Attentional Signals in Macaque Frontal Eye Field

2021 ◽  
Author(s):  
Miguel Dasilva ◽  
Christian Brandt ◽  
Marc Alwin Gieselmann ◽  
Claudia Distler ◽  
Alexander Thiele
Keyword(s):  
Attentional Control ◽  
Large Scale ◽  
Neuronal Excitability ◽  
Cell Types ◽  
Receptor Activation ◽  
Frontal Eye Field ◽  
Control Signals ◽  
Cognitive Operations ◽  
Eye Field ◽  
Large Scale Networks

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.

scholarly journals How does the position of firms in the supply chain affect their performance? An empirical study

2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Siddharth Arora ◽  
Alexandra Brintrup
Keyword(s):  
Supply Chain ◽  
Empirical Data ◽  
Large Scale ◽  
Individual Performance ◽  
Supply Network ◽  
Supply Chain Networks ◽  
Focal Firm ◽  
Cooperative Competition ◽  
Large Scale Networks ◽  
The Relationship

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.

Sign in / Sign up

Export Citation Format

Share Document