Subgraph centrality in complex networks

Social Engagement is Associated with Location-based Digital Markers on a Dementia Care Unit

OBJECTIVE

Social engagement is an important contributor to quality of life and the overall health of people with dementia. There is an opportunity to develop an objective measure of social engagement by capturing factors such as the number and duration of social contacts, time in social settings, and social network metrics. The aim of this study was to examine the longitudinal relationship between clinical assessment of social engagement and digital markers of social behavior and networks derived from a clinical real-time location system (RTLS).

DESIGN

Prospective observational study.

SETTING AND PARTICIPANTS

Thirty-seven patients on a short-stay specialized dementia unit for behavioral and psychological symptoms of dementia (60-day average length of stay).

METHODS

Location data were collected using a wrist-worn clinical RTLS. Features measuring social contact, time in social spaces, and social network analyses were extracted from the location data for each morning and evening shift. The association over time between average weekly features and weekly Revised Index of Social Engagement (RISE) assessment scores was investigated using univariate panel models.

RESULTS

There was high variability within and between participants in the RTLS-derived digital markers of social behavior. Seven digital markers of social engagement were statistically associated with weekly RISE scores over time, including time spent in the dining hall, time without co-patient contact, number of contacts longer than 5 minutes in duration, and social network PageRank.

CONCLUSIONS AND IMPLICATIONS

Location data collected in residential care environments can provide insights into patterns of social engagement in people with dementia.

The evolutionary history evident in grass pollen morphology

This article is a commentary on Wei et al . (2025), 246 : 365–376 .

Neural network embedding of functional microconnectome

Our brains operate as a complex network of interconnected neurons. To gain a deeper understanding of this network architecture, it is essential to extract simple rules from its intricate structure. This study aimed to compress and simplify the architecture, with a particular focus on interpreting patterns of functional connectivity in 2.5 hr of electrical activity from a vast number of neurons in acutely sliced mouse brains. Here, we combined two distinct methods together: automatic compression and network analysis. Firstly, for automatic compression, we trained an artificial neural network named NNE (neural network embedding). This allowed us to reduce the connectivity to features, be represented only by 13% of the original neuron count. Secondly, to decipher the topology, we concentrated on the variability among the compressed features and compared them with 15 distinct network metrics. Specifically, we introduced new metrics that had not previously existed, termed as indirect-adjacent degree and neighbor hub ratio. Our results conclusively demonstrated that these new metrics could better explain approximately 40%-45% of the features. This finding highlighted the critical role of NNE in facilitating the development of innovative metrics, because some of the features extracted by NNE were not captured by the currently existed network metrics.

Deciphering population-level response under spatial drug heterogeneity on microhabitat structures

Bacteria and cancer cells live in a spatially heterogeneous environment, where migration shapes the microhabitat structures critical for colonization and metastasis. The interplay between growth, migration, and microhabitat structure complicates the prediction of population responses to drugs, such as clearance or sustained growth, posing a longstanding challenge. Here, we disentangle growth-migration dynamics and identify that population decline is determined by two decoupled terms: a spatial growth variation term and a microhabitat structure term. Notably, the microhabitat structure term can be interpreted as a dynamic-related centrality measure. For fixed spatial drug arrangements, we show that interpreting these centralities reveals how different network structures, even with identical edge densities, microhabitat numbers, and spatial heterogeneity, can lead to distinct population-level responses. Increasing edge density shifts the population response from growth to clearance, supporting an inversed centrality-connectivity relationship, and mirroring the effects of higher migration rates. Furthermore, we derive a sufficient condition for robust population decline across various spatial growth rate arrangements, regardless of spatial-temporal fluctuations induced by drugs. Additionally, we demonstrate that varying the maximum growth-to-death ratio, determined by drug-bacteria interactions, can lead to distinct population decline profiles and a minimal decline phase emerges. These findings address key challenges in predicting population-level responses and provide insights into divergent clinical outcomes under identical drug dosages. This work may offer a new method of interpreting treatment dynamics and potential approaches for optimizing spatially explicit drug dosing strategies.

Efficacy of Chlorogenic Acid in Treating Tripterygium Glycoside-Induced Asthenozoospermia in Rats and Its Possible Mechanisms

Tripterygium glycosides (TGs) are the most common form of traditional Chinese medicine, known as Tripterygium wilfordii Hook F (TWHF) [...].

Graph Curvature Flow-Based Masked Attention

Graph neural networks (GNNs) have revolutionized drug discovery in chemistry and biology, enhancing efficiency and reducing resource demands. However, classical GNNs often struggle to capture long-range dependencies due to challenges like oversmoothing and oversquashing. Graph Transformers address these issues by employing global self-attention mechanisms that allow direct information exchange between any pair of nodes, enabling the modeling of long-range interactions. Despite this, Graph Transformers often face difficulties in capturing the nuanced structural information on graphs. To overcome these challenges, we introduce the CurvFlow-Transformer, a novel graph Transformer model incorporating a curvature flow-based masked attention mechanism. By leveraging a topologically enhanced mask matrix, the attention layer can effectively detect subtle structural differences within graphs, balancing the focus between global mutual information and local structural details of molecules. The CurvFlow-Transformer demonstrates superior performance on the MoleculeNet data set, surpassing several state-of-the-art models across various tasks. Moreover, the model provides unique insights into the relationship between molecular structure and chemical properties by analyzing the attention heat coefficients of individual atoms.

ACDMBI: A deep learning model based on community division and multi-source biological information fusion predicts essential proteins

Accurately identifying essential proteins is vital for drug research and disease diagnosis. Traditional centrality methods and machine learning approaches often face challenges in accurately discerning essential proteins, primarily relying on information derived from protein-protein interaction (PPI) networks. Despite attempts by some researchers to integrate biological data and PPI networks for predicting essential proteins, designing effective integration methods remains a challenge. In response to these challenges, this paper presents the ACDMBI model, specifically designed to overcome the aforementioned issues. ACDMBI is comprised of two key modules: feature extraction and classification. In terms of capturing relevant information, we draw insights from three distinct data sources. Initially, structural features of proteins are extracted from the PPI network through community division. Subsequently, these features are further optimized using Graph Convolutional Networks (GCN) and Graph Attention Networks (GAT). Moving forward, protein features are extracted from gene expression data utilizing Bidirectional Long Short-Term Memory networks (BiLSTM) and a multi-head self-attention mechanism. Finally, protein features are derived by mapping subcellular localization data to a one-dimensional vector and processing it through fully connected layers. In the classification phase, we integrate features extracted from three different data sources, crafting a multi-layer deep neural network (DNN) for protein classification prediction. Experimental results on brewing yeast data showcase the ACDMBI model's superior performance, with AUC reaching 0.9533 and AUPR reaching 0.9153. Ablation experiments further reveal that the effective integration of features from diverse biological information significantly boosts the model's performance.

Fractal information dissemination and clustering evolution on social hypernetwork

The complexity of systems stems from the richness of the group interactions among their units. Classical networks exhibit identified limits in the study of complex systems, where links connect pairs of nodes, inability to comprehensively describe higher-order interactions in networks. Higher-order networks can enhance modeling capacities of group interaction networks and help understand and predict network dynamical behavior. This paper constructs a social hypernetwork with a group structure by analyzing a community overlapping structure and a network iterative relationship, and the overlapping relationship between communities is logically separated. Considering the different group behavior pattern and attention focus, we defined the group cognitive disparity, group credibility, group cohesion index, hyperedge strength to study the relationship between information dissemination and network evolution. This study shows that groups can alter the connected network through information propagation, and users in social networks tend to form highly connected groups or communities in information dissemination. Propagation networks with high clustering coefficients promote the fractal information dissemination, which in itself drives the fractal evolution of groups within the network. This study emphasizes the significant role of "key groups" with overlapping structures among communities in group network propagation. Real cases provide evidence for the clustering phenomenon and fractal evolution of networks.

A Novel Method for Targeted Identification of Essential Proteins by Integrating Chemical Reaction Optimization and Naive Bayes Model

Targeted identification of essential proteins is of great significance for species identification, drug manufacturing, and disease treatment. It is a challenge to analyze the binding mechanism between essential proteins and improve the identification speed while ensuring the accuracy of the identification. This paper proposes a novel method called EPCRO for identifying essential proteins, which incorporates the chemical reaction optimization (CRO) algorithm and the naive Bayes model to effectively detect essential proteins. In EPCRO, the naive Bayes model is employed to analyze the homogeneity between proteins. In order to improve the identification rate and speed of essential proteins, the protein homogeneity rate is integrated into the CRO algorithm to balance between local and global searches. EPCRO is experimentally compared with 17 existing methods (including, DC, SC, IC, EC, LAC, NC, PeC, WDC, EPD-RW, RWHN, TEGS, CFMM, BSPM, AFSO-EP, CVIM, RWEP, and EPPSO-DC) based on biological datasets. The results show that EPCRO is superior to the above methods in identification accuracy and speed.

A dandelion structure of eigenvector preferential attachment networks

In this paper we introduce a new type of preferential attachment network, the growth of which is based on the eigenvector centrality. In this network, the agents attach most probably to the nodes with larger eigenvector centrality which represents that the agent has stronger connections. A new network is presented, namely a dandelion network, which shares some properties of star-like structure and also a hierarchical network. We show that this network, having hub-and-spoke topology is not generally scale free, and shows essential differences with respect to the Barabási-Albert preferential attachment model. Most importantly, there is a super hub agent in the system (identified by a pronounced peak in the spectrum), and the other agents are classified in terms of the distance to this super-hub. We explore a plenty of statistical centralities like the nodes degree, the betweenness and the eigenvector centrality, along with various measures of structure like the community and hierarchical structures, and the clustering coefficient. Global measures like the shortest path statistics and the self-similarity are also examined.

Spatial motifs reveal patterns in cellular architecture of complex tissues

Spatial organization of cells is crucial to both proper physiological function of tissues and pathological conditions like cancer. Recent advances in spatial transcriptomics have enabled joint profiling of gene expression and spatial context of the cells. The outcome is an information rich map of the tissue where individual cells, or small regions, can be labeled based on their gene expression state. While spatial transcriptomics excels in its capacity to profile numerous genes within the same sample, most existing methods for analysis of spatial data only examine distribution of one or two labels at a time. These approaches overlook the potential for identifying higher-order associations between cell types - associations that can play a pivotal role in understanding development and function of complex tissues. In this context, we introduce a novel method for detecting motifs in spatial neighborhood graphs. Each motif represents a spatial arrangement of cell types that occurs in the tissue more frequently than expected by chance. To identify spatial motifs, we developed an algorithm for uniform sampling of paths from neighborhood graphs and combined it with a motif finding algorithm on graphs inspired by previous methods for finding motifs in DNA sequences. Using synthetic data with known ground truth, we show that our method can identify spatial motifs with high accuracy and sensitivity. Applied to spatial maps of mouse retinal bipolar cells and hypothalamic preoptic region, our method reveals previously unrecognized patterns in cell type arrangements. In some cases, cells within these spatial patterns differ in their gene expression from other cells of the same type, providing insights into the functional significance of the spatial motifs. These results suggest that our method can illuminate the substantial complexity of neural tissues, provide novel insight even in well studied models, and generate experimentally testable hypotheses.

EPI-SF: essential protein identification in protein interaction networks using sequence features

Proteins are considered indispensable for facilitating an organism's viability, reproductive capabilities, and other fundamental physiological functions. Conventional biological assays are characterized by prolonged duration, extensive labor requirements, and financial expenses in order to identify essential proteins. Therefore, it is widely accepted that employing computational methods is the most expeditious and effective approach to successfully discerning essential proteins. Despite being a popular choice in machine learning (ML) applications, the deep learning (DL) method is not suggested for this specific research work based on sequence features due to the restricted availability of high-quality training sets of positive and negative samples. However, some DL works on limited availability of data are also executed at recent times which will be our future scope of work. Conventional ML techniques are thus utilized in this work due to their superior performance compared to DL methodologies. In consideration of the aforementioned, a technique called EPI-SF is proposed here, which employs ML to identify essential proteins within the protein-protein interaction network (PPIN). The protein sequence is the primary determinant of protein structure and function. So, initially, relevant protein sequence features are extracted from the proteins within the PPIN. These features are subsequently utilized as input for various machine learning models, including XGB Boost Classifier, AdaBoost Classifier, logistic regression (LR), support vector classification (SVM), Decision Tree model (DT), Random Forest model (RF), and Naïve Bayes model (NB). The objective is to detect the essential proteins within the PPIN. The primary investigation conducted on yeast examined the performance of various ML models for yeast PPIN. Among these models, the RF model technique had the highest level of effectiveness, as indicated by its precision, recall, F1-score, and AUC values of 0.703, 0.720, 0.711, and 0.745, respectively. It is also found to be better in performance when compared to the other state-of-arts based on traditional centrality like betweenness centrality (BC), closeness centrality (CC), etc. and deep learning methods as well like DeepEP, as emphasized in the result section. As a result of its favorable performance, EPI-SF is later employed for the prediction of novel essential proteins inside the human PPIN. Due to the tendency of viruses to selectively target essential proteins involved in the transmission of diseases within human PPIN, investigations are conducted to assess the probable involvement of these proteins in COVID-19 and other related severe diseases.

Dynamic identification of important nodes in complex networks based on the KPDN-INCC method

This article focuses on the cascading failure problem and node importance evaluation method in complex networks. To address the issue of identifying important nodes in dynamic networks, the method used in static networks is introduced and the necessity of re-evaluating node status during node removal is proposed. Studies have found that the methods for identifying dynamic and static network nodes are two different directions, and most literature only uses dynamic methods to verify static methods. Therefore, it is necessary to find suitable node evaluation methods for dynamic networks. Based on this, this article proposes a method that integrates local and global correlation properties. In terms of global features, we introduce an improved k-shell method with fusion degree to improve the resolution of node ranking. In terms of local features, we introduce Solton factor and structure hole factor improved by INCC (improved network constraint coefficient), which effectively improves the algorithm's ability to identify the relationship between adjacent nodes. Through comparison with existing methods, it is found that the KPDN-INCC method proposed in this paper complements the KPDN method and can accurately identify important nodes, thereby helping to quickly disintegrate the network. Finally, the effectiveness of the proposed method in identifying important nodes in a small-world network with a random parameter less than 0.4 was verified through artificial network experiments.

A network analysis of early arthropod evolution and the potential of the primitive

It is often thought that the primitive is simpler, and that the complex is generated from the simple by some process of self-assembly or self-organization, which ultimately consists of the spontaneous and fortuitous collision of elementary units. This idea is included in the Darwinian theory of evolution, to which is added the competitive mechanism of natural selection. To test this view, we studied the early evolution of arthropods. Twelve groups of arthropods belonging to the Burgess Shale, Orsten Lagerstätte, and extant primitive groups were selected, their external morphology abstracted and codified in the language of network theory. The analysis of these networks through different network measures (network parameters, topological descriptors, complexity measures) was used to carry out a Principal Component Analysis (PCA) and a Hierarchical Cluster Analysis (HCA), which allowed us to obtain an evolutionary tree with distinctive/novel features. The analysis of centrality measures revealed that these measures decreased throughout the evolutionary process, and led to the creation of the concept of evolutionary developmental potential. This potential, which measures the capacity of a morphological unit to generate changes in its surroundings, is concomitantly reduced throughout the evolutionary process, and demonstrates that the primitive is not simple but has a potential that unfolds during this process. This means for us the first empirical evolutionary evidence of our theory of evolution as a process of unfolding.

Screening of the key response component groups and mechanism verification of Huangqi-Guizhi-Wuwu-Decoction in treating rheumatoid arthritis based on a novel computational pharmacological model

BACKGROUND

Rheumatoid arthritis (RA) is a chronic autoimmune disease characterized by the destruction of synovial tissue and articular cartilage. Huangqi-Guizhi-Wuwu-Decoction (HGWD), a formula of Traditional Chinese Medicine (TCM), has shown promising clinical efficacy in the treatment of RA. However, the synergistic effects of key response components group (KRCG) in the treatment of RA have not been well studied.

METHODS

The components and potential targets of HGWD were extracted from published databases. A novel node influence calculation model that considers both the node control force and node bridging force was designed to construct the core response space (CRS) and obtain key effector proteins. An increasing coverage coefficient (ICC) model was employed to select the KRCG. The effectiveness and potential mechanism of action of KRCG were confirmed using CCK-8, qPCR, and western blotting.

RESULTS

A total of 796 key effector proteins were identified in CRS. The Kyoto Encyclopedia of Genes and Genomes (KEGG) and Gene Ontology (GO) analyses confirmed their effectiveness and reliability. In addition, 59 components were defined as KRCG, which contributed to 85.05% of the target coverage of effective proteins. Of these, 677 targets were considered key reaction proteins, and their enriched KEGG pathways accounted for 84.89% of the pathogenic genes and 87.94% of the target genes. Finally, four components (moupinamide, 6-Paradol, hydrocinnamic acid, and protocatechuic acid) were shown to inhibit the inflammatory response in RA by synergistically targeting the cAMP, PI3K-Akt, and HIF-1α pathways.

CONCLUSIONS

We have introduced a novel model that aims to optimize and analyze the mechanisms behind herbal formulas. The model revealed the KRCG of HGWD for the treatment of RA and proposed that KRCG inhibits the inflammatory response by synergistically targeting cAMP, PI3K-Akt, and HIF-1α pathways. Overall, the novel model is plausible and reliable, offering a valuable reference for the secondary development of herbal formulas.

Potential biomarker for early detection of ADHD using phase-based brain connectivity and graph theory

This research investigates an efficient strategy for early detection and intervention of attention-deficit hyperactivity disorder (ADHD) in children. ADHD is a neurodevelopmental condition characterized by inattention and hyperactivity/impulsivity symptoms, which can significantly impact a child's daily life. This study employed two distinct brain functional connectivity measurements to assess our approach across various local graph features. Six common classifiers are employed to distinguish between children with ADHD and healthy control. Based on the phase-based analysis, the study proposes two biomarkers that differentiate children with ADHD from healthy control, with a remarkable accuracy of 99.174%. Our findings suggest that subgraph centrality of phase-lag index brain connectivity within the beta and delta frequency bands could be a promising biomarker for ADHD diagnosis. Additionally, we identify node betweenness centrality of inter-site phase clustering connectivity within the delta and theta bands as another potential biomarker that warrants further exploration. These biomarkers were validated using a t-statistical test and yielded a p-value of under 0.05, which approved their significant difference in these two groups. Suggested biomarkers have the potential to improve the accuracy of ADHD diagnosis and could help identify effective intervention strategies for children with the condition.

Essential proteins discovery based on dominance relationship and neighborhood similarity centrality

Essential proteins play a vital role in development and reproduction of cells. The identification of essential proteins helps to understand the basic survival of cells. Due to time-consuming, costly and inefficient with biological experimental methods for discovering essential proteins, computational methods have gained increasing attention. In the initial stage, essential proteins are mainly identified by the centralities based on protein-protein interaction (PPI) networks, which limit their identification rate due to many false positives in PPI networks. In this study, a purified PPI network is firstly introduced to reduce the impact of false positives in the PPI network. Secondly, by analyzing the similarity relationship between a protein and its neighbors in the PPI network, a new centrality called neighborhood similarity centrality (NSC) is proposed. Thirdly, based on the subcellular localization and orthologous data, the protein subcellular localization score and ortholog score are calculated, respectively. Fourthly, by analyzing a large number of methods based on multi-feature fusion, it is found that there is a special relationship among features, which is called dominance relationship, then, a novel model based on dominance relationship is proposed. Finally, NSC, subcellular localization score, and ortholog score are fused by the dominance relationship model, and a new method called NSO is proposed. In order to verify the performance of NSO, the seven representative methods (ION, NCCO, E_POC, SON, JDC, PeC, WDC) are compared on yeast datasets. The experimental results show that the NSO method has higher identification rate than other methods.

A seed expansion-based method to identify essential proteins by integrating protein-protein interaction sub-networks and multiple biological characteristics

BACKGROUND

The identification of essential proteins is of great significance in biology and pathology. However, protein-protein interaction (PPI) data obtained through high-throughput technology include a high number of false positives. To overcome this limitation, numerous computational algorithms based on biological characteristics and topological features have been proposed to identify essential proteins.

RESULTS

In this paper, we propose a novel method named SESN for identifying essential proteins. It is a seed expansion method based on PPI sub-networks and multiple biological characteristics. Firstly, SESN utilizes gene expression data to construct PPI sub-networks. Secondly, seed expansion is performed simultaneously in each sub-network, and the expansion process is based on the topological features of predicted essential proteins. Thirdly, the error correction mechanism is based on multiple biological characteristics and the entire PPI network. Finally, SESN analyzes the impact of each biological characteristic, including protein complex, gene expression data, GO annotations, and subcellular localization, and adopts the biological data with the best experimental results. The output of SESN is a set of predicted essential proteins.

CONCLUSIONS

The analysis of each component of SESN indicates the effectiveness of all components. We conduct comparison experiments using three datasets from two species, and the experimental results demonstrate that SESN achieves superior performance compared to other methods.

Development of the RF-GSEA Method for Identifying Disulfidptosis-Related Genes and Application in Hepatocellular Carcinoma

Disulfidptosis is a newly discovered cellular programmed cell death mode. Presently, a considerable number of genes related to disulfidptosis remain undiscovered, and its significance in hepatocellular carcinoma remains unrevealed. We have developed a powerful analytical method called RF-GSEA for identifying potential genes associated with disulfidptosis. This method draws inspiration from gene regulation networks and graph theory, and it is implemented through a combination of random forest regression model and Gene Set Enrichment Analysis. Subsequently, to validate the practical application value of this method, we applied it to hepatocellular carcinoma. Based on the RF-GSEA method, we developed a disulfidptosis-related signature. Lastly, we looked into how the disulfidptosis-related signature is connected to HCC prognosis, the tumor microenvironment, the effectiveness of immunotherapy, and the sensitivity of chemotherapy drugs. The RF-GSEA method identified a total of 220 disulfidptosis-related genes, from which 7 were selected to construct the disulfidptosis-related signature. The high-disulfidptosis-related score group had a worse prognosis compared to the low-disulfidptosis-related score group and showed lower infiltration levels of immune-promoting cells. The high-disulfidptosis-related score group had a higher likelihood of benefiting from immunotherapy compared to the low-disulfidptosis-related score group. The RF-GSEA method is a powerful tool for identifying disulfidptosis-related genes. The disulfidptosis-related signature effectively predicts HCC prognosis, immunotherapy response, and drug sensitivity.

Neural Representation of Collective Self-esteem in Resting-state Functional Connectivity and its Validation in Task-dependent Modality

INTRODUCTION

Collective self-esteem (CSE) is an important personality variable, defined as self-worth derived from membership in social groups. A study explored the neural basis of CSE using a task-based functional magnetic resonance imaging (fMRI) paradigm; however, task-independent neural basis of CSE remains to be explored, and whether the CSE neural basis of resting-state fMRI is consistent with that of task-based fMRI is unclear.

METHODS

We built support vector regression (SVR) models to predict CSE scores using topological metrics measured in the resting-state functional connectivity network (RSFC) as features. Then, to test the reliability of the SVR analysis, the activation pattern of the identified brain regions from SVR analysis was used as features to distinguish collective self-worth from other conditions by multivariate pattern classification in task-based fMRI dataset.

RESULTS

SVR analysis results showed that leverage centrality successfully decoded the individual differences in CSE. The ventromedial prefrontal cortex, anterior cingulate cortex, posterior cingulate gyrus, precuneus, orbitofrontal cortex, posterior insula, postcentral gyrus, inferior parietal lobule, temporoparietal junction, and inferior frontal gyrus, which are involved in self-referential processing, affective processing, and social cognition networks, participated in this prediction. Multivariate pattern classification analysis found that the activation pattern of the identified regions from the SVR analysis successfully distinguished collective self-worth from relational self-worth, personal self-worth and semantic control.

CONCLUSION

Our findings revealed CSE neural basis in the whole-brain RSFC network, and established the concordance between leverage centrality and the activation pattern (evoked during collective self-worth task) of the identified regions in terms of representing CSE.

Optimizing network neuroscience computation of individual differences in human spontaneous brain activity for test-retest reliability

A rapidly emerging application of network neuroscience in neuroimaging studies has provided useful tools to understand individual differences in intrinsic brain function by mapping spontaneous brain activity, namely intrinsic functional network neuroscience (ifNN). However, the variability of methodologies applied across the ifNN studies-with respect to node definition, edge construction, and graph measurements-makes it difficult to directly compare findings and also challenging for end users to select the optimal strategies for mapping individual differences in brain networks. Here, we aim to provide a benchmark for best ifNN practices by systematically comparing the measurement reliability of individual differences under different ifNN analytical strategies using the test-retest design of the Human Connectome Project. The results uncovered four essential principles to guide ifNN studies: (1) use a whole brain parcellation to define network nodes, including subcortical and cerebellar regions; (2) construct functional networks using spontaneous brain activity in multiple slow bands; and (3) optimize topological economy of networks at individual level; and (4) characterize information flow with specific metrics of integration and segregation. We built an interactive online resource of reliability assessments for future ifNN (https://ibraindata.com/research/ifNN).

Key protein identification by integrating protein complex information and multi-biological features

Identifying key proteins based on protein-protein interaction networks has emerged as a prominent area of research in bioinformatics. However, current methods exhibit certain limitations, such as the omission of subcellular localization information and the disregard for the impact of topological structure noise on the reliability of key protein identification. Moreover, the influence of proteins outside a complex but interacting with proteins inside the complex on complex participation tends to be overlooked. Addressing these shortcomings, this paper presents a novel method for key protein identification that integrates protein complex information with multiple biological features. This approach offers a comprehensive evaluation of protein importance by considering subcellular localization centrality, topological centrality weighted by gene ontology (GO) similarity and complex participation centrality. Experimental results, including traditional statistical metrics, jackknife methodology metric and key protein overlap or difference, demonstrate that the proposed method not only achieves higher accuracy in identifying key proteins compared to nine classical methods but also exhibits robustness across diverse protein-protein interaction networks.

A proposal for ranking through selective computation of centrality measures

In complex network analysis it is essential to investigate the alteration of network structures that results from the targeted removal of vertices or edges, ranked by centrality measures. Unfortunately, a sequential recalculation of centralities after each node elimination is often impractical for large networks, and computing rankings only at the beginning often does not accurately reflect the actual scenario. Here we propose a first result on the computational complexity of the sequential approach when nodes are removed from a network according to some centrality measures based on matrix functions. Moreover, we present two strategies that aim to reduce the computational impact of the sequential computation of centralities and provide theoretical results in support. Finally, we provide an application of our claims to the robustness of some synthetic and real-world networks.

A Construction Method of Dynamic Protein Interaction Networks by Using Relevant Features of Gene Expression Data

Essential proteins play an important role in various life activities and are considered to be a vital part of the organism. Gene expression data are an important dataset to construct dynamic protein-protein interaction networks (DPIN). The existing methods for the construction of DPINs generally utilize all features (or the features in a cycle) of the gene expression data. However, the features observed from successive time points tend to be highly correlated, and thus there are some redundant and irrelevant features in the gene expression data, which will influence the quality of the constructed network and the predictive performance of essential proteins. To address this problem, we propose a construction method of DPINs by using selected relevant features rather than continuous and periodic features. We adopt an improved unsupervised feature selection method based on Laplacian algorithm to remove irrelevant and redundant features from gene expression data, then integrate the chosen relevant features into the static protein-protein interaction network (SPIN) to construct a more concise and effective DPIN (FS-DPIN). To evaluate the effectiveness of the FS-DPIN, we apply 15 network-based centrality methods on the FS-DPIN and compare the results with those on the SPIN and the existing DPINs. Then the predictive performance of the 15 centrality methods is validated in terms of sensitivity, specificity, positive predictive value, negative predictive value, F-measure, accuracy, Jackknife and AUPRC. The experimental results show that the FS-DPIN is superior to the existing DPINs in the identification accuracy of essential proteins.

Identification of essential proteins based on edge features and the fusion of multiple-source biological information

BACKGROUND

A major current focus in the analysis of protein-protein interaction (PPI) data is how to identify essential proteins. As massive PPI data are available, this warrants the design of efficient computing methods for identifying essential proteins. Previous studies have achieved considerable performance. However, as a consequence of the features of high noise and structural complexity in PPIs, it is still a challenge to further upgrade the performance of the identification methods.

METHODS

This paper proposes an identification method, named CTF, which identifies essential proteins based on edge features including h-quasi-cliques and uv-triangle graphs and the fusion of multiple-source information. We first design an edge-weight function, named EWCT, for computing the topological scores of proteins based on quasi-cliques and triangle graphs. Then, we generate an edge-weighted PPI network using EWCT and dynamic PPI data. Finally, we compute the essentiality of proteins by the fusion of topological scores and three scores of biological information.

RESULTS

We evaluated the performance of the CTF method by comparison with 16 other methods, such as MON, PeC, TEGS, and LBCC, the experiment results on three datasets of Saccharomyces cerevisiae show that CTF outperforms the state-of-the-art methods. Moreover, our method indicates that the fusion of other biological information is beneficial to improve the accuracy of identification.

Reviving the Dynamics of Attacked Reservoir Computers

Physically implemented neural networks are subject to external perturbations and internal variations. Existing works focus on the adversarial attacks but seldom consider attack on the network structure and the corresponding recovery method. Inspired by the biological neural compensation mechanism and the neuromodulation technique in clinical practice, we propose a novel framework of reviving attacked reservoir computers, consisting of several strategies direct at different types of attacks on structure by adjusting only a minor fraction of edges in the reservoir. Numerical experiments demonstrate the efficacy and broad applicability of the framework and reveal inspiring insights into the mechanisms. This work provides a vehicle to improve the robustness of reservoir computers and can be generalized to broader types of neural networks.

Comparative analysis of gene ontology-based semantic similarity measurements for the application of identifying essential proteins

Identifying key proteins from protein-protein interaction (PPI) networks is one of the most fundamental and important tasks for computational biologists. However, the protein interactions obtained by high-throughput technology are characterized by a high false positive rate, which severely hinders the prediction accuracy of the current computational methods. In this paper, we propose a novel strategy to identify key proteins by constructing reliable PPI networks. Five Gene Ontology (GO)-based semantic similarity measurements (Jiang, Lin, Rel, Resnik, and Wang) are used to calculate the confidence scores for protein pairs under three annotation terms (Molecular function (MF), Biological process (BP), and Cellular component (CC)). The protein pairs with low similarity values are assumed to be low-confidence links, and the refined PPI networks are constructed by filtering the low-confidence links. Six topology-based centrality methods (the BC, DC, EC, NC, SC, and aveNC) are applied to test the performance of the measurements under the original network and refined network. We systematically compare the performance of the five semantic similarity metrics with the three GO annotation terms on four benchmark datasets, and the simulation results show that the performance of these centrality methods under refined PPI networks is relatively better than that under the original networks. Resnik with a BP annotation term performs best among all five metrics with the three annotation terms. These findings suggest the importance of semantic similarity metrics in measuring the reliability of the links between proteins and highlight the Resnik metric with the BP annotation term as a favourable choice.

Influential nodes identification in complex networks: a comprehensive literature review

Researchers have paid a lot of attention to complex networks in recent decades. Due to their rapid evolution, they turn into a major scientific and innovative field. Several studies on complex networks are carried out, and other subjects are evolving every day such as the challenge of detecting influential nodes. In this study, we provide a brief overview of complex networks, as well as several concepts key related to measurements, the structure of complex network and social influence, an important state of the art on complex networks including basic metrics on complex networks, the evolution of their topology over the years as well as the dynamic of networks. A detailed literature about influential finding approaches is also provided to indicate their strength and shortcomings. We aim that our contribution of literature can be an interesting base of information for beginners' scientists in this field. At the end of this paper, some conclusions are drawn and some future perspectives are mentioned to be studied as new directions in the future. More detailed references are provided to go further and deep in this area.

Identification of Essential Proteins Based on Local Random Walk and Adaptive Multi-View Multi-Label Learning

Accumulating evidences have indicated that essential proteins play vital roles in human physiological process. In recent years, although researches on prediction of essential proteins have been developing rapidly, there are as well various limitations such as unsatisfactory data suitability, low accuracy of predictive results and so on. In this manuscript, a novel method called RWAMVL was proposed to predict essential proteins based on the Random Walk and the Adaptive Multi-View multi-label Learning. In RWAMVL, considering that the inherent noise is ubiquitous in existing datasets of known protein-protein interactions (PPIs), a variety of different features including biological features of proteins and topological features of PPI networks were obtained by adopting adaptive multi-view multi-label learning first. And then, an improved random walk method was designed to detect essential proteins based on these different features. Finally, in order to verify the predictive performance of RWAMVL, intensive experiments were done to compare it with multiple state-of-the-art predictive methods under different expeditionary frameworks. And as a result, RWAMVL was proven that it can achieve better prediction accuracy than all those competitive methods, which demonstrated as well that RWAMVL may be a potential tool for prediction of key proteins in the future.

Developing an Automated Analytical Process for Disaster Response and Recovery in Communities Prone to Isolation

Today, unpredictable damage can result from extreme weather such as heat waves and floods. This damage makes communities that cannot respond quickly to disasters more vulnerable than cities. Thus, people living in such communities can easily become isolated, which can cause unavoidable loss of life or property. In the meantime, many disaster management studies have been conducted, but studies on effective disaster response for areas surrounded by mountains or with weak transportation infrastructure are very rare. To fill the gap, this research aimed at developing an automated analysis tool that can be directly used for disaster response and recovery by identifying in real time the communities at risk of isolation using a web-based geographic information system (GIS) application. We first developed an algorithm to automatically detect communities at risk of isolation due to disaster. Next, we developed an analytics module to identify buildings and populations within the communities and efficiently place at-risk residents in shelters. In sum, the analysis tool developed in this study can be used to support disaster response decisions regarding, for example, rescue activities and supply of materials by accurately detecting isolated areas when a disaster occurs in a mountainous area where communication and transportation infrastructure is lacking.

Inference of pan-cancer related genes by orthologs matching based on enhanced LSTM model

Many disease-related genes have been found to be associated with cancer diagnosis, which is useful for understanding the pathophysiology of cancer, generating targeted drugs, and developing new diagnostic and treatment techniques. With the development of the pan-cancer project and the ongoing expansion of sequencing technology, many scientists are focusing on mining common genes from The Cancer Genome Atlas (TCGA) across various cancer types. In this study, we attempted to infer pan-cancer associated genes by examining the microbial model organism Saccharomyces Cerevisiae (Yeast) by homology matching, which was motivated by the benefits of reverse genetics. First, a background network of protein-protein interactions and a pathogenic gene set involving several cancer types in humans and yeast were created. The homology between the human gene and yeast gene was then discovered by homology matching, and its interaction sub-network was obtained. This was undertaken following the principle that the homologous genes of the common ancestor may have similarities in expression. Then, using bidirectional long short-term memory (BiLSTM) in combination with adaptive integration of heterogeneous information, we further explored the topological characteristics of the yeast protein interaction network and presented a node representation score to evaluate the node ability in graphs. Finally, homologous mapping for human genes matched the important genes identified by ensemble classifiers for yeast, which may be thought of as genes connected to all types of cancer. One way to assess the performance of the BiLSTM model is through experiments on the database. On the other hand, enrichment analysis, survival analysis, and other outcomes can be used to confirm the biological importance of the prediction results. You may access the whole experimental protocols and programs at https://github.com/zhuyuan-cug/AI-BiLSTM/tree/master.

Dynamic Modelling of DNA Repair Pathway at the Molecular Level: A New Perspective

DNA is the genetic repository for all living organisms, and it is subject to constant changes caused by chemical and physical factors. Any change, if not repaired, erodes the genetic information and causes mutations and diseases. To ensure overall survival, robust DNA repair mechanisms and damage-bypass mechanisms have evolved to ensure that the DNA is constantly protected against potentially deleterious damage while maintaining its integrity. Not surprisingly, defects in DNA repair genes affect metabolic processes, and this can be seen in some types of cancer, where DNA repair pathways are disrupted and deregulated, resulting in genome instability. Mathematically modelling the complex network of genes and processes that make up the DNA repair network will not only provide insight into how cells recognise and react to mutations, but it may also reveal whether or not genes involved in the repair process can be controlled. Due to the complexity of this network and the need for a mathematical model and software platform to simulate different investigation scenarios, there must be an automatic way to convert this network into a mathematical model. In this paper, we present a topological analysis of one of the networks in DNA repair, specifically homologous recombination repair (HR). We propose a method for the automatic construction of a system of rate equations to describe network dynamics and present results of a numerical simulation of the model and model sensitivity analysis to the parameters. In the past, dynamic modelling and sensitivity analysis have been used to study the evolution of tumours in response to drugs in cancer medicine. However, automatic generation of a mathematical model and the study of its sensitivity to parameter have not been applied to research on the DNA repair network so far. Therefore, we present this application as an approach for medical research against cancer, since it could give insight into a possible approach with which central nodes of the networks and repair genes could be identified and controlled with the ultimate goal of aiding cancer therapy to fight the onset of cancer and its progression.

Rule-Based Pruning and In Silico Identification of Essential Proteins in Yeast PPIN

Proteins are vital for the significant cellular activities of living organisms. However, not all of them are essential. Identifying essential proteins through different biological experiments is relatively more laborious and time-consuming than the computational approaches used in recent times. However, practical implementation of conventional scientific methods sometimes becomes challenging due to poor performance impact in specific scenarios. Thus, more developed and efficient computational prediction models are required for essential protein identification. An effective methodology is proposed in this research, capable of predicting essential proteins in a refined yeast protein–protein interaction network (PPIN). The rule-based refinement is done using protein complex and local interaction density information derived from the neighborhood properties of proteins in the network. Identification and pruning of non-essential proteins are equally crucial here. In the initial phase, careful assessment is performed by applying node and edge weights to identify and discard the non-essential proteins from the interaction network. Three cut-off levels are considered for each node and edge weight for pruning the non-essential proteins. Once the PPIN has been filtered out, the second phase starts with two centralities-based approaches: (1) local interaction density (LID) and (2) local interaction density with protein complex (LIDC), which are successively implemented to identify the essential proteins in the yeast PPIN. Our proposed methodology achieves better performance in comparison to the existing state-of-the-art techniques.

Identifying essential proteins from protein-protein interaction networks based on influence maximization

BACKGROUND

Essential proteins are indispensable to the development and survival of cells. The identification of essential proteins not only is helpful for the understanding of the minimal requirements for cell survival, but also has practical significance in disease diagnosis, drug design and medical treatment. With the rapidly amassing of protein-protein interaction (PPI) data, computationally identifying essential proteins from protein-protein interaction networks (PINs) becomes more and more popular. Up to now, a number of various approaches for essential protein identification based on PINs have been developed.

RESULTS

In this paper, we propose a new and effective approach called iMEPP to identify essential proteins from PINs by fusing multiple types of biological data and applying the influence maximization mechanism to the PINs. Concretely, we first integrate PPI data, gene expression data and Gene Ontology to construct weighted PINs, to alleviate the impact of high false-positives in the raw PPI data. Then, we define the influence scores of nodes in PINs with both orthological data and PIN topological information. Finally, we develop an influence discount algorithm to identify essential proteins based on the influence maximization mechanism.

CONCLUSIONS

We applied our method to identifying essential proteins from saccharomyces cerevisiae PIN. Experiments show that our iMEPP method outperforms the existing methods, which validates its effectiveness and advantage.

A deep learning framework for identifying essential proteins based on multiple biological information

Background

Essential Proteins are demonstrated to exert vital functions on cellular processes and are indispensable for the survival and reproduction of the organism. Traditional centrality methods perform poorly on complex protein–protein interaction (PPI) networks. Machine learning approaches based on high-throughput data lack the exploitation of the temporal and spatial dimensions of biological information.

Results

We put forward a deep learning framework to predict essential proteins by integrating features obtained from the PPI network, subcellular localization, and gene expression profiles. In our model, the node2vec method is applied to learn continuous feature representations for proteins in the PPI network, which capture the diversity of connectivity patterns in the network. The concept of depthwise separable convolution is employed on gene expression profiles to extract properties and observe the trends of gene expression over time under different experimental conditions. Subcellular localization information is mapped into a long one-dimensional vector to capture its characteristics. Additionally, we use a sampling method to mitigate the impact of imbalanced learning when training the model. With experiments carried out on the data of Saccharomyces cerevisiae, results show that our model outperforms traditional centrality methods and machine learning methods. Likewise, the comparative experiments have manifested that our process of various biological information is preferable.

Conclusions

Our proposed deep learning framework effectively identifies essential proteins by integrating multiple biological data, proving a broader selection of subcellular localization information significantly improves the results of prediction and depthwise separable convolution implemented on gene expression profiles enhances the performance.

Methodology-Centered Review of Molecular Modeling, Simulation, and Prediction of SARS-CoV-2

Despite tremendous efforts in the past two years, our understanding of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), virus-host interactions, immune response, virulence, transmission, and evolution is still very limited. This limitation calls for further in-depth investigation. Computational studies have become an indispensable component in combating coronavirus disease 2019 (COVID-19) due to their low cost, their efficiency, and the fact that they are free from safety and ethical constraints. Additionally, the mechanism that governs the global evolution and transmission of SARS-CoV-2 cannot be revealed from individual experiments and was discovered by integrating genotyping of massive viral sequences, biophysical modeling of protein-protein interactions, deep mutational data, deep learning, and advanced mathematics. There exists a tsunami of literature on the molecular modeling, simulations, and predictions of SARS-CoV-2 and related developments of drugs, vaccines, antibodies, and diagnostics. To provide readers with a quick update about this literature, we present a comprehensive and systematic methodology-centered review. Aspects such as molecular biophysics, bioinformatics, cheminformatics, machine learning, and mathematics are discussed. This review will be beneficial to researchers who are looking for ways to contribute to SARS-CoV-2 studies and those who are interested in the status of the field.

Artificial intelligence in cancer target identification and drug discovery

Artificial intelligence is an advanced method to identify novel anticancer targets and discover novel drugs from biology networks because the networks can effectively preserve and quantify the interaction between components of cell systems underlying human diseases such as cancer. Here, we review and discuss how to employ artificial intelligence approaches to identify novel anticancer targets and discover drugs. First, we describe the scope of artificial intelligence biology analysis for novel anticancer target investigations. Second, we review and discuss the basic principles and theory of commonly used network-based and machine learning-based artificial intelligence algorithms. Finally, we showcase the applications of artificial intelligence approaches in cancer target identification and drug discovery. Taken together, the artificial intelligence models have provided us with a quantitative framework to study the relationship between network characteristics and cancer, thereby leading to the identification of potential anticancer targets and the discovery of novel drug candidates.

Emerging landscape of molecular interaction networks: Opportunities, challenges and prospects

Network biology finds application in interpreting molecular interaction networks and providing insightful inferences using graph theoretical analysis of biological systems. The integration of computational bio-modelling approaches with different hybrid network-based techniques provides additional information about the behaviour of complex systems. With increasing advances in high-throughput technologies in biological research, attempts have been made to incorporate this information into network structures, which has led to a continuous update of network biology approaches over time. The newly minted centrality measures accommodate the details of omics data and regulatory network structure information. The unification of graph network properties with classical mathematical and computational modelling approaches and technologically advanced approaches like machine-learning- and artificial intelligence-based algorithms leverages the potential application of these techniques. These computational advances prove beneficial and serve various applications such as essential gene prediction, identification of drug–disease interaction and gene prioritization. Hence, in this review, we have provided a comprehensive overview of the emerging landscape of molecular interaction networks using graph theoretical approaches. With the aim to provide information on the wide range of applications of network biology approaches in understanding the interaction and regulation of genes, proteins, enzymes and metabolites at different molecular levels, we have reviewed the methods that utilize network topological properties, emerging hybrid network-based approaches and applications that integrate machine learning techniques to analyse molecular interaction networks. Further, we have discussed the applications of these approaches in biomedical research with a note on future prospects.

An efficient strategy for identifying essential proteins based on homology, subcellular location and protein-protein interaction information

High throughput biological experiments are expensive and time consuming. For the past few years, many computational methods based on biological information have been proposed and widely used to understand the biological background. However, the processing of biological information data inevitably produces false positive and false negative data, such as the noise in the Protein-Protein Interaction (PPI) networks and the noise generated by the integration of a variety of biological information. How to solve these noise problems is the key role in essential protein predictions. An Identifying Essential Proteins model based on non-negative Matrix Symmetric tri-Factorization and multiple biological information (IEPMSF) is proposed in this paper, which utilizes only the PPI network proteins common neighbor characters to develop a weighted network, and uses the non-negative matrix symmetric tri-factorization method to find more potential interactions between proteins in the network so as to optimize the weighted network. Then, using the subcellular location and lineal homology information, the starting score of proteins is determined, and the random walk algorithm with restart mode is applied to the optimized network to mark and rank each protein. We tested the suggested forecasting model against current representative approaches using a public database. Experiment shows high efficiency of new method in essential proteins identification. The effectiveness of this method shows that it can dramatically solve the noise problems that existing in the multi-source biological information itself and cased by integrating them.

Comparing protein-protein interaction networks of SARS-CoV-2 and (H1N1) influenza using topological features

SARS-CoV-2 pandemic first emerged in late 2019 in China. It has since infected more than 298 million individuals and caused over 5 million deaths globally. The identification of essential proteins in a protein–protein interaction network (PPIN) is not only crucial in understanding the process of cellular life but also useful in drug discovery. There are many centrality measures to detect influential nodes in complex networks. Since SARS-CoV-2 and (H1N1) influenza PPINs pose 553 common human proteins. Analyzing influential proteins and comparing these networks together can be an effective step in helping biologists for drug-target prediction. We used 21 centrality measures on SARS-CoV-2 and (H1N1) influenza PPINs to identify essential proteins. We applied principal component analysis and unsupervised machine learning methods to reveal the most informative measures. Appealingly, some measures had a high level of contribution in comparison to others in both PPINs, namely Decay, Residual closeness, Markov, Degree, closeness (Latora), Barycenter, Closeness (Freeman), and Lin centralities. We also investigated some graph theory-based properties like the power law, exponential distribution, and robustness. Both PPINs tended to properties of scale-free networks that expose their nature of heterogeneity. Dimensionality reduction and unsupervised learning methods were so effective to uncover appropriate centrality measures.

Topological ranks reveal functional knowledge encoded in biological networks: a comparative analysis

MOTIVATION

Biological networks topology yields important insights into biological function, occurrence of diseases and drug design. In the last few years, different types of topological measures have been introduced and applied to infer the biological relevance of network components/interactions, according to their position within the network structure. Although comparisons of such measures have been previously proposed, to what extent the topology per se may lead to the extraction of novel biological knowledge has never been critically examined nor formalized in the literature.

RESULTS

We present a comparative analysis of nine outstanding topological measures, based on compact views obtained from the rank they induce on a given input biological network. The goal is to understand their ability in correctly positioning nodes/edges in the rank, according to the functional knowledge implicitly encoded in biological networks. To this aim, both internal and external (gold standard) validation criteria are taken into account, and six networks involving three different organisms (yeast, worm and human) are included in the comparison. The results show that a distinct handful of best-performing measures can be identified for each of the considered organisms, independently from the reference gold standard.

AVAILABILITY

Input files and code for the computation of the considered topological measures and K-haus distance are available at https://gitlab.com/MaryBonomo/ranking.

CONTACT

simona.rombo@unipa.it.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Briefings in Bioinformatics online.

Measuring node centrality when local and global measures overlap

Centrality metrics aim to identify the most relevant nodes in a network. In the literature, a broad set of metrics exists, measuring either local or global centrality characteristics. Nevertheless, when networks exhibit a high spectral gap, the usual global centrality measures typically do not add significant information with respect to the degree, i.e., the simplest local metric. To extract different information from this class of networks, we propose the use of the Generalized Economic Complexity index (GENEPY). Despite its original definition within the economic field, the GENEPY can be easily applied and interpreted on a wide range of networks, characterized by high spectral gap, including monopartite and bipartite network systems. Tests on synthetic and real-world networks show that the GENEPY can shed light about the node centrality, carrying information generally poorly correlated with the node number of direct connections (node degree).

Troxerutin-Mediated Complement Pathway Inhibition is a Disease-Modifying Treatment for Inflammatory Arthritis

Troxerutin (TXR) is a phytochemical reported to possess anti-inflammatory and hepatoprotective effects. In this study, we aimed to exploit the antiarthritic properties of TXR using an adjuvant-induced arthritic (AIA) rat model. AIA-induced rats showed the highest arthritis score at the disease onset and by oral administration of TXR (50, 100, and 200 mg/kg body weight), reduced to basal level in a dose-dependent manner. Isobaric tags for relative and absolute quantitative (iTRAQ) proteomics tool were employed to identify deregulated joint homogenate proteins in AIA and TXR-treated rats to decipher the probable mechanism of TXR action in arthritis. iTRAQ analysis identified a set of 434 proteins with 65 deregulated proteins (log₂ case/control≥1.5) in AIA. Expressions of a set of important proteins (AAT, T-kininogen, vimentin, desmin, and nucleophosmin) that could classify AIA from the healthy ones were validated using Western blot analysis. The Western blot data corroborated proteomics findings. In silico protein–protein interaction study of tissue-proteome revealed that complement component 9 (C9), the major building blocks of the membrane attack complex (MAC) responsible for sterile inflammation, get perturbed in AIA. Our dosimetry study suggests that a TXR dose of 200 mg/kg body weight for 15 days is sufficient to bring the arthritis score to basal levels in AIA rats. We have shown the importance of TXR as an antiarthritic agent in the AIA model and after additional investigation, its arthritic ameliorating properties could be exploited for clinical usability.

The world trade network: country centrality and the COVID-19 pandemic

International trade is based on a set of complex relationships between different countries that can be modelled as an extremely dense network of interconnected agents. On the one hand, this network might favour the economic growth of countries, but on the other, it can also favour the diffusion of diseases, such as COVID-19. In this paper, we study whether, and to what extent, the topology of the trade network can explain the rate of COVID-19 diffusion and mortality across countries. We compute the countries' centrality measures and we apply the community detection methodology based on communicability distance. We then use these measures as focal regressors in a negative binomial regression framework. In doing so, we also compare the effects of different measures of centrality. Our results show that the numbers of infections and fatalities are larger in countries with a higher centrality in the global trade network.

The Extremal Structures of r-Uniform Unicyclic Hypergraphs on the Signless Laplacian Estrada Index

SLEE has various applications in a large variety of problems. The signless Laplacian Estrada index of a hypergraph H is defined as SLEE(H)=∑i=1neλi(Q), where λ1(Q),λ2(Q),…,λn(Q) are the eigenvalues of the signless Laplacian matrix of H. In this paper, we characterize the unique r-uniform unicyclic hypergraphs with maximum and minimum SLEE.

Resting functional connectivity of the left inferior frontal gyrus with the dorsomedial prefrontal cortex and temporoparietal junction reflects the social network size for active interactions

The size of an individual active social network is a key parameter of human social behavior and is correlated with subjective well-being. However, it remains unknown how the social network size of active interactions is represented in the brain. Here, we examined whether resting-state functional magnetic resonance imaging (fMRI) connectivity is associated with the social network size of active interactions using behavioral data of a large sample (N = 222) on Twitter. Region of interest (ROI)-to-ROI analysis, graph theory analysis, seed-based analysis, and decoding analysis together provided compelling evidence that people who have a large social network size of active interactions, as measured by "reply," show higher fMRI connectivity of the left inferior frontal gyrus with the dorsomedial prefrontal cortex and temporoparietal junction, which represents the core of the theory of mind network. These results demonstrated that people who have a large social network size of active interactions maintain activity of the identified functional connectivity in daily life, possibly providing a mechanism for efficient information transmission between the brain networks related to language and theory-of-mind.