Dataset Information

Testing "efficient supply chain propositions" using topological characterization of the global supply chain network.

ABSTRACT: In this paper, we study the topological properties of the global supply chain network in terms of its degree distribution, clustering coefficient, degree-degree correlation, bow-tie structure, and community structure to test the efficient supply chain propositions proposed by E. J.S. Hearnshaw et al. The global supply chain data in the year 2017 are constructed by collecting various company data from the web site of Standard & Poor's Capital IQ platform. The in- and out-degree distributions are characterized by a power law of the form of ?in = 2.42 and ?out = 2.11. The clustering coefficient decays [Formula: see text] with an exponent ?k = 0.46. The nodal degree-degree correlations ?knn(k)? indicates the absence of assortativity. The bow-tie structure of giant weakly connected component (GWCC) reveals that the OUT component is the largest and consists 41.1% of all firms. The giant strong connected component (GSCC) is comprised of 16.4% of all firms. We observe that upstream or downstream firms are located a few steps away from the GSCC. Furthermore, we uncover the community structures of the network and characterize them according to their location and industry classification. We observe that the largest community consists of the consumer discretionary sector based mainly in the United States (US). These firms belong to the OUT component in the bow-tie structure of the global supply chain network. Finally, we confirm the validity of Hearnshaw et al.'s efficient supply chain propositions, namely Proposition S1 (short path length), Proposition S2 (power-law degree distribution), Proposition S3 (high clustering coefficient), Proposition S4 ("fit-gets-richer" growth mechanism), Proposition S5 (truncation of power-law degree distribution), and Proposition S7 (community structure with overlapping boundaries) regarding the global supply chain network. While the original propositions S1 just mentioned a short path length, we found the short path from the GSCC to IN and OUT by analyzing the bow-tie structure. Therefore, the short path length in the bow-tie structure is a conceptual addition to the original propositions of Hearnshaw.

SUBMITTER: Chakraborty A

PROVIDER: S-EPMC7529254 | biostudies-literature | 2020

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Testing "efficient supply chain propositions" using topological characterization of the global supply chain network.

Chakraborty Abhijit A Ikeda Yuichi Y

PloS one 20201001 10

In this paper, we study the topological properties of the global supply chain network in terms of its degree distribution, clustering coefficient, degree-degree correlation, bow-tie structure, and community structure to test the efficient supply chain propositions proposed by E. J.S. Hearnshaw et al. The global supply chain data in the year 2017 are constructed by collecting various company data from the web site of Standard & Poor's Capital IQ platform. The in- and out-degree distributions are ...[more]

PMID: 33002029

Similar Datasets

Project description:BackgroundThe investigation of possible interactions between two proteins in intracellular signaling is an expensive and laborious procedure in the wet-lab, therefore, several in silico approaches have been implemented to narrow down the candidates for future experimental validations. Reformulating the problem in the field of network theory, the set of proteins can be represented as the nodes of a network, while the interactions between them as the edges. The resulting protein-protein interaction (PPI) network enables the use of link prediction techniques in order to discover new probable connections. Therefore, here we aimed to offer a novel approach to the link prediction task in PPI networks, utilizing a generative machine learning model.ResultsWe created a tool that consists of two modules, the data processing framework and the machine learning model. As data processing, we used a modified breadth-first search algorithm to traverse the network and extract induced subgraphs, which served as image-like input data for our model. As machine learning, an image-to-image translation inspired conditional generative adversarial network (cGAN) model utilizing Wasserstein distance-based loss improved with gradient penalty was used, taking the combined representation from the data processing as input, and training the generator to predict the probable unknown edges in the provided induced subgraphs. Our link prediction tool was evaluated on the protein-protein interaction networks of five different species from the STRING database by calculating the area under the receiver operating characteristic, the precision-recall curves and the normalized discounted cumulative gain (AUROC, AUPRC, NDCG, respectively). Test runs yielded the averaged results of AUROC = 0.915, AUPRC = 0.176 and NDCG = 0.763 on all investigated species.ConclusionWe developed a software for the purpose of link prediction in PPI networks utilizing machine learning. The evaluation of our software serves as the first demonstration that a cGAN model, conditioned on raw topological features of the PPI network, is an applicable solution for the PPI prediction problem without requiring often unavailable molecular node attributes. The corresponding scripts are available at https://github.com/semmelweis-pharmacology/ppi_pred .

Dataset Information

Testing "efficient supply chain propositions" using topological characterization of the global supply chain network.

Publications

Testing "efficient supply chain propositions" using topological characterization of the global supply chain network.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets