Measuring network rewiring over time.

PLoS One

Department of Agricultural Economics, Sociology, and Education, Pennsylvania State University, University Park, Pennsylvania, United States of America.

Published: March 2020

Recent years have seen tremendous advances in the scientific study of networks, as more and larger data sets of relationships among nodes have become available in many different fields. This has led to pathbreaking discoveries of near-universal network behavior over time, including the principle of preferential attachment and the emergence of scaling in complex networks. Missing from the set of network analysis methods to date is a measure that describes for each node how its relationship (or links) with other nodes changes from one period to the next. Conventional measures of network change for the most part show how the degrees of a node change; these are scalar comparisons. Our contribution is to use, for the first time, the cosine similarity to capture not just the change in degrees of a node but its relationship to other nodes. These are vector (or matrix)-based comparisons, rather than scalar, and we refer to them as "rewiring" coefficients. We apply this measure to three different networks over time to show the differences in the two types of measures. In general, bigger increases in our rewiring measure are associated with larger increases in network density, but this is not always the case.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6655784PMC
http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0220295PLOS

Publication Analysis

Top Keywords

node relationship
8
change degrees
8
degrees node
8
measuring network
4
network rewiring
4
time
4
rewiring time
4
time years
4
years tremendous
4
tremendous advances
4

Similar Publications

Single-cell multi-omics techniques, which enable the simultaneous measurement of multiple modalities such as RNA gene expression and Assay for Transposase-Accessible Chromatin (ATAC) within individual cells, have become a powerful tool for deciphering the intricate complexity of cellular systems. Most current methods rely on motif databases to establish cross-modality relationships between genes from RNA-seq data and peaks from ATAC-seq data. However, these approaches are constrained by incomplete database coverage, particularly for novel or poorly characterized relationships.

View Article and Find Full Text PDF

Ultrasound‑guided Percutaneous Radiofrequency and Microwave Ablation for Cervical Lymph Node Metastasis from Papillary Thyroid Carcinoma: A Systematic Review and Meta‑analysis of Clinical Efficacy and Safety.

Acad Radiol

January 2025

Department of Diagnostic and Therapeutic Ultrasonography, Tianjin Medical University Cancer Institute and Hospital, National Clinical Research Center for Cancer, Key Laboratory of Cancer Prevention and Therapy, Tianjin's Clinical Research Center for Cancer, Tianjin, China (A.U., L.C., L.Y., W.X.). Electronic address:

Aim: To evaluate the efficacy and safety of radiofrequency ablation (RFA) and microwave ablation (MWA) for treating cervical lymph node metastasis (CLNM) from papillary thyroid carcinoma (PTC).

Methods: Medline, EMBASE, Web of Science, and Cochrane Library were searched for studies on the efficacy and safety of thermal ablations for treating CLNM from PTC until July 2024. Among 544 papers, 11 articles were reviewed involving 233 patients and 432 CLNM cases.

View Article and Find Full Text PDF

Contrastive Graph Representation Learning with Adversarial Cross-View Reconstruction and Information Bottleneck.

Neural Netw

January 2025

School of Computer Science and Technology, Xi'an Jiaotong University, Xi'an, 710049, China; Ministry of Education Key Laboratory for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an, 710049, China. Electronic address:

Graph Neural Networks (GNNs) have received extensive research attention due to their powerful information aggregation capabilities. Despite the success of GNNs, most of them suffer from the popularity bias issue in a graph caused by a small number of popular categories. Additionally, real graph datasets always contain incorrect node labels, which hinders GNNs from learning effective node representations.

View Article and Find Full Text PDF

3D bioprinting: Advancing the future of food production layer by layer.

Food Chem

January 2025

Functional Biomaterial Research Center, Korea Research Institute of Bioscience and Biotechnology, Jeongeup 56212, Republic of Korea; Department of Applied Biotechnology, University of Science and Technology (UST), Daejeon 34113, Republic of Korea. Electronic address:

3D bioprinting is an advanced manufacturing technique that involves the precise layer-by-layer deposition of biomaterials, such as cells, growth factors, and biomimetic scaffolds, to create three-dimensional living structures. It essentially combines the complexity of biology with the principles of 3D printing, making it possible to fabricate complex biological structures with extreme control and accuracy. This review discusses how 3D bioprinting is developing as an essential step in the creation of alternative food such as cultured meat and seafood.

View Article and Find Full Text PDF

Searching to extrapolate embedding for out-of-graph node representation learning.

Neural Netw

January 2025

Department of Electronic Engineering, Tsinghua University, Beijing, China. Electronic address:

Out-of-graph node representation learning aims at learning about newly arrived nodes for a dynamic graph. It has wide applications ranging from community detection, recommendation system to malware detection. Although existing methods can be adapted for out-of-graph node representation learning, real-world challenges such as fixed in-graph node embedding and data diversity essentially limit the performance of these methods.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!