Near linear time algorithm to detect community structures in large-scale networks

Machine learning and complex network analysis of drug effects on neuronal microelectrode biosensor data

Biosensors, such as microelectrode arrays that record in vitro neuronal activity, provide powerful platforms for studying neuroactive substances. This study presents a machine learning workflow to analyze drug-induced changes in neuronal biosensor data using complex network measures from graph theory. Microelectrode array recordings of neuronal networks exposed to bicuculline, a GABA[Formula: see text] receptor antagonist known to induce hypersynchrony, demonstrated the workflow's ability to detect and characterize pharmacological effects. The workflow integrates network-based features with synchrony, optimizing preprocessing parameters, including spike train bin sizes, segmentation window sizes, and correlation methods. It achieved high classification accuracy (AUC up to 90%) and used Shapley Additive Explanations to interpret feature importance rankings. Significant reductions in network complexity and segregation, hallmarks of epileptiform activity induced by bicuculline, were revealed. While bicuculline's effects are well established, this framework is designed to be broadly applicable for detecting both strong and subtle network alterations induced by neuroactive compounds. The results demonstrate the potential of this methodology for advancing biosensor applications in neuropharmacology and drug discovery.

EvoWeaver: large-scale prediction of gene functional associations from coevolutionary signals

The known universe of uncharacterized proteins is expanding far faster than our ability to annotate their functions through laboratory study. Computational annotation approaches rely on similarity to previously studied proteins, thereby ignoring unstudied proteins. Coevolutionary approaches hold promise for injecting new information into our knowledge of the protein universe by linking proteins through 'guilt-by-association'. However, existing coevolutionary algorithms have insufficient accuracy and scalability to connect the entire universe of proteins. We present EvoWeaver, a method that weaves together 12 signals of coevolution to quantify the degree of shared evolution between genes. EvoWeaver accurately identifies proteins involved in protein complexes or separate steps of a biochemical pathway. We show the merits of EvoWeaver by partly reconstructing known biochemical pathways without any prior knowledge other than that available from genomic sequences. Applying EvoWeaver to 1545 gene groups from 8564 genomes reveals missing connections in popular databases and potentially undiscovered links between proteins.

ReLume: Enhancing DNA storage data reconstruction with flow network and graph partitioning

DNA storage is an ideal alternative to silicon-based storage, but focusing on data writing alone cannot address the inevitable errors and durability issues. Therefore, we propose ReLume, a DNA storage data reconstruction method based on flow networks and graph partitioning technology, which can accomplish the data reconstruction task of millions of reads on a laptop with 24 GB RAM. The results show that ReLume copes well with many types of errors, more than doubles sequence recovery rates, and reduces memory usage by about 60 %. ReLume is 10 times more durable than other representative methods, meaning that data can be read without loss after 100 years. Results from the wet lab DNA storage dataset show that ReLume's sequence recovery rates of 73 % and 93.2 %, respectively, significantly outperform existing methods. In summary, ReLume effectively overcomes the accuracy and hardware limitations and provides a feasible idea for the portability of DNA storage.

Volatile organic compounds (VOCs) fingerprinting combined with complex network analysis as a forecasting tool for tracing the origin and genetic lineage of Arabica specialty coffees

Due to the globalization of coffee trade, ensuring the safety and traceability of coffee has become a critical challenge, prompting global authorities to implement new traceability systems to enhance quality identification and protect consumers from fraud. Aroma is a crucial parameter in the evaluation and differentiation of coffees, influenced by factors such as genetics, origin, post harvesting process, roast level, and brewing method. This paper provides, for the first time, a comprehensive overview of the volatile fingerprints of specialty coffees, categorized by their respective quality levels. In particular, this study aimed to evaluate the potential of volatile compounds monitored through Proton Transfer Reaction-Time of Flight-Mass Spectrometry (PTR-ToF-MS) as objective, fast, reliable and repeatable tool for tracking the quality and genetic lineage of Arabica specialty coffees. The spectra of volatile organic compounds (VOCs) were acquired from 1132 coffee samples (both specialty and non-specialty) from various varieties, origins, and processing methods. Results clearly indicate that the volatile composition of specialty coffee is predominantly influenced by its genetic lineage. Arabica coffee species belonging to Bourbon, Typica, and Ethiopian landraces showed higher total VOCs emission, while varieties related to Robusta, which are related to the Canephora one, emit less. Finally, by employing a complex network analysis approach based on headspace VOC analysis, it was possible to accurately distinguish between different categories of specialty Arabica coffee. Notably, our analysis shows that the quality of specialty coffee is not linked to the number of VOCs emitted, but rather to the level emission of some pleasant aroma compounds. These findings open new perspectives for the development of aroma profiling techniques and demonstrate the unique aroma release characteristics of specialty coffees.

Molecular hallmarks of excitatory and inhibitory neuronal resilience and resistance to Alzheimer's disease

Background

A significant proportion of individuals maintain healthy cognitive function despite having extensive Alzheimer's disease (AD) pathology, known as cognitive resilience. Understanding the molecular mechanisms that protect these individuals can identify therapeutic targets for AD dementia. This study aims to define molecular and cellular signatures of cognitive resilience, protection and resistance, by integrating genetics, bulk RNA, and single-nucleus RNA sequencing data across multiple brain regions from AD, resilient, and control individuals.

Methods

We analyzed data from the Religious Order Study and the Rush Memory and Aging Project (ROSMAP), including bulk (n=631) and multi-regional single nucleus (n=48) RNA sequencing. Subjects were categorized into AD, resilient, and control based on β-amyloid and tau pathology, and cognitive status. We identified and prioritized protected cell populations using whole genome sequencing-derived genetic variants, transcriptomic profiling, and cellular composition distribution.

Results

Transcriptomic results, supported by GWAS-derived polygenic risk scores, place cognitive resilience as an intermediate state in the AD continuum. Tissue-level analysis revealed 43 genes enriched in nucleic acid metabolism and signaling that were differentially expressed between AD and resilience. Only GFAP (upregulated) and KLF4 (downregulated) showed differential expression in resilience compared to controls. Cellular resilience involved reorganization of protein folding and degradation pathways, with downregulation of Hsp90 and selective upregulation of Hsp40, Hsp70, and Hsp110 families in excitatory neurons. Excitatory neuronal subpopulations in the entorhinal cortex (ATP8B1+ and MEF2Chigh) exhibited unique resilience signaling through neurotrophin (modulated by LINGO1) and angiopoietin (ANGPT2/TEK) pathways. We identified MEF2C, ATP8B1, and RELN as key markers of resilient excitatory neuronal populations, characterized by selective vulnerability in AD. Protective rare variant enrichment highlighted vulnerable populations, including somatostatin (SST) inhibitory interneurons, validated through immunofluorescence showing co-expression of rare variant associated RBFOX1 and KIF26B in SST+ neurons in the dorsolateral prefrontal cortex. The maintenance of excitatory-inhibitory balance emerges as a key characteristic of resilience.

Conclusions

We identified molecular and cellular hallmarks of cognitive resilience, an intermediate state in the AD continuum. Resilience mechanisms include preservation of neuronal function, maintenance of excitatory/inhibitory balance, and activation of protective signaling pathways. Specific excitatory neuronal populations appear to play a central role in mediating cognitive resilience, while a subset of vulnerable SST interneurons likely provide compensation against AD-associated dysregulation. This study offers a framework to leverage natural protective mechanisms to mitigate neurodegeneration and preserve cognition in AD.

Relating ecological diversity to genetic discontinuity across bacterial species

BACKGROUND

Genetic discontinuity represents abrupt breaks in genomic identity among species. Advances in genome sequencing have enhanced our ability to track and characterize genetic discontinuity in bacterial populations. However, exploring the degree to which bacterial diversity exists as a continuum or sorted into discrete and readily defined species remains a challenge in microbial ecology. Here, we aim to quantify the genetic discontinuity ( δ ) and investigate how this metric is related to ecology.

RESULTS

We harness a dataset comprising 210,129 genomes to systematically explore genetic discontinuity patterns across several distantly related species, finding clear breakpoints which vary depending on the taxa in question. By delving into pangenome characteristics, we uncover a significant association between pangenome saturation and genetic discontinuity. Closed pangenomes are associated with more pronounced breaks, exemplified by Mycobacterium tuberculosis. Additionally, through a machine learning approach, we detect key features such as gene conservation patterns and functional annotations that significantly impact genetic discontinuity prediction.

CONCLUSIONS

Our study clarifies bacterial genetic patterns and their ecological impacts, enhancing the delineation of species boundaries and deepening our understanding of microbial diversity.

Pairpot: a database with real-time lasso-based analysis tailored for paired single-cell and spatial transcriptomics

Paired single-cell and spatially resolved transcriptomics (SRT) data supplement each other, providing in-depth insights into biological processes and disease mechanisms. Previous SRT databases have limitations in curating sufficient single-cell and SRT pairs (SC-SP pairs) and providing real-time heuristic analysis, which hinder the effort to uncover potential biological insights. Here, we developed Pairpot (http://pairpot.bioxai.cn), a database tailored for paired single-cell and SRT data with real-time heuristic analysis. Pairpot curates 99 high-quality pairs including 1,425,656 spots from 299 datasets, and creates the association networks. It constructs the curated pairs by integrating multiple slices and establishing potential associations between single-cell and SRT data. On this basis, Pairpot adopts semi-supervised learning that enables real-time heuristic analysis for SC-SP pairs where Lasso-View refines the user-selected SRT domains within milliseconds, Pair-View infers cell proportions of spots based on user-selected cell types in real-time and Layer-View displays SRT slices using a 3D hierarchical layout. Experiments demonstrated Pairpot's efficiency in identifying heterogeneous domains and cell proportions.

Genetic Contribution to Medium-Term Disease Activity in Multiple Sclerosis

Multiple sclerosis (MS) is a complex disorder characterized by high heterogeneity in terms of phenotypic expression, prognosis and treatment response. In the present study, we aimed to explore the genetic contribution to MS disease activity at different levels: genes, pathways and tissue-specific networks. Two cohorts of relapsing-remitting MS patients who started a first-line treatment (n = 1294) were enrolled to evaluate the genetic association with disease activity after 4 years of follow-up. The analyses were performed at whole-genome SNP and gene level, followed by the construction of gene-gene interaction networks specific for brain and lymphocytes. The resulting gene modules were evaluated to highlight key players from a topological and functional perspective. We identified 23 variants and 223 genes with suggestive association to 4-years disease activity, highlighting genes like PON2 involved in oxidative stress and in mitochondria functions and other genes, like ILRUN, involved in the modulation of the immune system. Network analyses led to the identification of a brain module composed of 228 genes and a lymphocytes module composed of 287 genes. The network analysis allowed us to prioritize genes relevant for their topological properties; among them, there are MPHOSPH9 (connector hub in both brain and lymphocyte module) and OPA1 (in brain module), two genes already implicated in MS. Modules showed the enrichment of both shared and tissue-specific pathways, mainly implicated in inflammation. In conclusion, our results suggest that the processes underlying disease activity act on shared mechanisms across brain and lymphocyte tissues.

Artificial intelligence chatbots mimic human collective behaviour

Artificial Intelligence (AI) chatbots, such as ChatGPT, have been shown to mimic individual human behaviour in a wide range of psychological and economic tasks. Do groups of AI chatbots also mimic collective behaviour? If so, artificial societies of AI chatbots may aid social scientific research by simulating human collectives. To investigate this theoretical possibility, we focus on whether AI chatbots natively mimic one commonly observed collective behaviour: homophily, people's tendency to form communities with similar others. In a large simulated online society of AI chatbots powered by large language models (N = 33,299), we find that communities form over time around bots using a common language. In addition, among chatbots that predominantly use English (N = 17,746), communities emerge around bots that post similar content. These initial empirical findings suggest that AI chatbots mimic homophily, a key aspect of human collective behaviour. Thus, in addition to simulating individual human behaviour, AI-powered artificial societies may advance social science research by allowing researchers to simulate nuanced aspects of collective behaviour.

Novel artificial intelligence-based identification of drug-gene-disease interaction using protein-protein interaction

The evaluation of drug-gene-disease interactions is key for the identification of drugs effective against disease. However, at present, drugs that are effective against genes that are critical for disease are difficult to identify. Following a disease-centric approach, there is a need to identify genes critical to disease function and find drugs that are effective against them. By contrast, following a drug-centric approach comprises identifying the genes targeted by drugs, and then the diseases in which the identified genes are critical. Both of these processes are complex. Using a gene-centric approach, whereby we identify genes that are effective against the disease and can be targeted by drugs, is much easier. However, how such sets of genes can be identified without specifying either the target diseases or drugs is not known. In this study, a novel artificial intelligence-based approach that employs unsupervised methods and identifies genes without specifying neither diseases nor drugs is presented. To evaluate its feasibility, we applied tensor decomposition (TD)-based unsupervised feature extraction (FE) to perform drug repositioning from protein-protein interactions (PPI) without any other information. Proteins selected by TD-based unsupervised FE include many genes related to cancers, as well as drugs that target the selected proteins. Thus, we were able to identify cancer drugs using only PPI. Because the selected proteins had more interactions, we replaced the selected proteins with hub proteins and found that hub proteins themselves could be used for drug repositioning. In contrast to hub proteins, which can only identify cancer drugs, TD-based unsupervised FE enables the identification of drugs for other diseases. In addition, TD-based unsupervised FE can be used to identify drugs that are effective in in vivo experiments, which is difficult when hub proteins are used. In conclusion, TD-based unsupervised FE is a useful tool for drug repositioning using only PPI without other information.

scQA: A dual-perspective cell type identification model for single cell transcriptome data

Single-cell RNA sequencing technologies have been pivotal in advancing the development of algorithms for clustering heterogeneous cell populations. Existing methods for utilizing scRNA-seq data to identify cell types tend to neglect the beneficial impact of dropout events and perform clustering focusing solely on quantitative perspective. Here, we introduce a novel method named scQA, notable for its ability to concurrently identify cell types and cell type-specific key genes from both qualitative and quantitative perspectives. In contrast to other methods, scQA not only identifies cell types but also extracts key genes associated with these cell types, enabling bidirectional clustering for scRNA-seq data. Through an iterative process, our approach aims to minimize the number of landmarks to approximately a dozen while maximizing the inclusion of quasi-trend-preserved genes with dropouts both qualitatively and quantitatively. It then clusters cells by employing an ingenious label propagation strategy, obviating the requirement for a predetermined number of cell types. Validated on 20 publicly available scRNA-seq datasets, scQA consistently outperforms other salient tools. Furthermore, we confirm the effectiveness and potential biological significance of the identified key genes through both external and internal validation. In conclusion, scQA emerges as a valuable tool for investigating cell heterogeneity due to its distinctive fusion of qualitative and quantitative facets, along with bidirectional clustering capabilities. Furthermore, it can be seamlessly integrated into border scRNA-seq analyses. The source codes are publicly available at https://github.com/LD-Lyndee/scQA.

Predicting protein complexes in protein interaction networks using Mapper and graph convolution networks

Protein complexes are groups of interacting proteins that are central to multiple biological processes. Studying protein complexes can enhance our understanding of cellular functions and malfunctions and thus support the development of effective disease treatments. High-throughput experimental techniques allow the generation of large-scale protein-protein interaction datasets. Accordingly, various computational approaches to predict protein complexes from protein-protein interactions were presented in the literature. They are typically based on networks in which nodes and edges represent proteins and their interactions, respectively. State-of-the-art approaches mainly rely on clustering static networks to identify complexes. However, since protein interactions are highly dynamic in nature, recent approaches seek to model such dynamics by typically integrating gene expression data and identifying protein complexes accordingly. We propose MComplex, a method that utilizes time-series gene expression with interaction data to generate a temporal network which is passed to a generative adversarial network whose generator is a graph convolutional network. This creates embeddings which are then analyzed using a modified graph-based version of the Mapper algorithm to predict corresponding protein complexes. We test our approach on multiple benchmark datasets and compare identified complexes against gold-standard protein complex datasets. Our results show that MComplex outperforms existing methods in several evaluation aspects, namely recall and maximum matching ratio as well as a composite score covering aggregated evaluation measures. The code and data are available for free download from https://github.com/LeonardoDaou/MComplex.

Uncovering migration systems through spatio-temporal tensor co-clustering

A central problem in the study of human mobility is that of migration systems. Typically, migration systems are defined as a set of relatively stable movements of people between two or more locations over time. While these emergent systems are expected to vary over time, they ideally contain a stable underlying structure that could be discovered empirically. There have been some notable attempts to formally or informally define migration systems. However, they have been limited by being hard to operationalize and defining migration systems in ways that ignore origin/destination aspects and fail to account for migration dynamics over time. In this work, we propose to employ spatio-temporal tensor co-clustering-that stems from signal processing and machine learning theory-as a novel migration system analysis tool. Tensor co-clustering is designed to cluster entities exhibiting similar patterns across multiple modalities and thus suits our purpose of analyzing spatial migration activities across time. To demonstrate its effectiveness in describing stable migration systems, we first focus on domestic migration between counties in the US from 1990 to 2018. We conduct three case studies on domestic migration, namely, (i) US Metropolitan Areas, (ii) the state of California, and (iii) Louisiana, in which the last focuses on detecting exogenous events such as Hurricane Katrina in 2005. In addition, we also examine a case study at a larger scale, using worldwide international migration data from 200 countries between 1990 and 2015. Finally, we conclude with a discussion of this approach and its limitations.

Strainy: phasing and assembly of strain haplotypes from long-read metagenome sequencing

Bacterial species in microbial communities are often represented by mixtures of strains, distinguished by small variations in their genomes. Short-read approaches can be used to detect small-scale variation between strains but fail to phase these variants into contiguous haplotypes. Long-read metagenome assemblers can generate contiguous bacterial chromosomes but often suppress strain-level variation in favor of species-level consensus. Here we present Strainy, an algorithm for strain-level metagenome assembly and phasing from Nanopore and PacBio reads. Strainy takes a de novo metagenomic assembly as input and identifies strain variants, which are then phased and assembled into contiguous haplotypes. Using simulated and mock Nanopore and PacBio metagenome data, we show that Strainy assembles accurate and complete strain haplotypes, outperforming current Nanopore-based methods and comparable with PacBio-based algorithms in completeness and accuracy. We then use Strainy to assemble strain haplotypes of a complex environmental metagenome, revealing distinct strain distribution and mutational patterns in bacterial species.

Multiclass classification of Autism Spectrum Disorder, attention deficit hyperactivity disorder, and typically developed individuals using fMRI functional connectivity analysis

Neurodevelopmental conditions, such as Autism Spectrum Disorder (ASD) and Attention Deficit Hyperactivity Disorder (ADHD), present unique challenges due to overlapping symptoms, making an accurate diagnosis and targeted intervention difficult. Our study employs advanced machine learning techniques to analyze functional magnetic resonance imaging (fMRI) data from individuals with ASD, ADHD, and typically developed (TD) controls, totaling 120 subjects in the study. Leveraging multiclass classification (ML) algorithms, we achieve superior accuracy in distinguishing between ASD, ADHD, and TD groups, surpassing existing benchmarks with an area under the ROC curve near 98%. Our analysis reveals distinct neural signatures associated with ASD and ADHD: individuals with ADHD exhibit altered connectivity patterns of regions involved in attention and impulse control, whereas those with ASD show disruptions in brain regions critical for social and cognitive functions. The observed connectivity patterns, on which the ML classification rests, agree with established diagnostic approaches based on clinical symptoms. Furthermore, complex network analyses highlight differences in brain network integration and segregation among the three groups. Our findings pave the way for refined, ML-enhanced diagnostics in accordance with established practices, offering a promising avenue for developing trustworthy clinical decision-support systems.

Bayan algorithm: Detecting communities in networks through exact and approximate optimization of modularity

Community detection is a classic network problem with extensive applications in various fields. Its most common method is using modularity maximization heuristics which rarely return an optimal partition or anything similar. Partitions with globally optimal modularity are difficult to compute, and therefore have been underexplored. Using structurally diverse networks, we compare 30 community detection methods including our proposed algorithm that offers optimality and approximation guarantees: the Bayan algorithm. Unlike existing methods, Bayan globally maximizes modularity or approximates it within a factor. Our results show the distinctive accuracy and stability of maximum-modularity partitions in retrieving planted partitions at rates higher than most alternatives for a wide range of parameter settings in two standard benchmarks. Compared to the partitions from 29 other algorithms, maximum-modularity partitions have the best medians for description length, coverage, performance, average conductance, and well clusteredness. These advantages come at the cost of additional computations which Bayan makes possible for small networks (networks that have up to 3000 edges in their largest connected component). Bayan is several times faster than using open-source and commercial solvers for modularity maximization, making it capable of finding optimal partitions for instances that cannot be optimized by any other existing method. Our results point to a few well-performing algorithms, among which Bayan stands out as the most reliable method for small networks. A python implementation of the Bayan algorithm (bayanpy) is publicly available through the package installer for python.

Applying rearrangement distances to enable plasmid epidemiology with pling

Plasmids are a key vector of antibiotic resistance, but the current bioinformatics toolkit is not well suited to tracking them. The rapid structural changes seen in plasmid genomes present considerable challenges to evolutionary and epidemiological analysis. Typical approaches are either low resolution (replicon typing) or use shared k-mer content to define a genetic distance. However, this distance can both overestimate plasmid relatedness by ignoring rearrangements, and underestimate by over-penalizing gene gain/loss. Therefore a model is needed which captures the key components of how plasmid genomes evolve structurally - through gene/block gain or loss, and rearrangement. A secondary requirement is to prevent promiscuous transposable elements (TEs) leading to over-clustering of unrelated plasmids. We choose the 'Double Cut and Join Indel' (DCJ-Indel) model, in which plasmids are studied at a coarse level, as a sequence of signed integers (representing genes or aligned blocks), and the distance between two plasmids is the minimum number of rearrangement events or indels needed to transform one into the other. We show how this gives much more meaningful distances between plasmids. We introduce a software workflow pling (https://github.com/iqbal-lab-org/pling), which uses the DCJ-Indel model, to calculate distances between plasmids and then cluster them. In our approach, we combine containment distances and DCJ-Indel distances to build a TE-aware plasmid network. We demonstrate superior performance and interpretability to other plasmid clustering tools on the 'Russian Doll' dataset and a hospital transmission dataset.

VQGNet: An Unsupervised Defect Detection Approach for Complex Textured Steel Surfaces

Defect detection on steel surfaces with complex textures is a critical and challenging task in the industry. The limited number of defect samples and the complexity of the annotation process pose significant challenges. Moreover, performing defect segmentation based on accurate identification further increases the task's difficulty. To address this issue, we propose VQGNet, an unsupervised algorithm that can precisely recognize and segment defects simultaneously. A feature fusion method based on aggregated attention and a classification-aided module is proposed to segment defects by integrating different features in the original images and the anomaly maps, which direct the attention to the anomalous information instead of the irregular complex texture. The anomaly maps are generated more confidently using strategies for multi-scale feature fusion and neighbor feature aggregation. Moreover, an anomaly generation method suitable for grayscale images is introduced to facilitate the model's learning on the anomalous samples. The refined anomaly maps and fused features are both input into the classification-aided module for the final classification and segmentation. VQGNet achieves state-of-the-art (SOTA) performance on the industrial steel dataset, with an I-AUROC of 99.6%, I-F1 of 98.8%, P-AUROC of 97.0%, and P-F1 of 80.3%. Additionally, ViT-Query demonstrates robust generalization capabilities in generating anomaly maps based on the Kolektor Surface-Defect Dataset 2.

Location method for emergency rescue node on expressways based on spatio-temporal characteristics of vehicle operation

Expressway networks are continuously developing and emergency rescue demand is increasing proportionately. The location of expressway emergency rescue nodes needs refinement to meet changing requirements. In this study, the expressway was modeled as an expressway network. The differences in the origin destination (OD) distribution matrices for working days and major holidays were used as the bases for determining the need for temporary emergency rescue nodes. Overlapping and non-overlapping community detection algorithms were used to extract the distribution characteristics of OD during both day categories. These distributions were used to determine permanent and temporary emergency rescue sites. In this study, we considered the differences in traffic volume, distance, and impact of four vehicle types on traffic accidents to select the location of emergency rescue nodes, and allocate emergency resources. An emergency rescue node selection model for an expressway network was established based on spatio-temporal characteristics. The results based on a regional example determined that 22 permanent and 25 temporary emergency rescue nodes were appropriate. The average rescue time for traffic accidents during working days and major holidays compared to the P-center location model, was reduced by approximately 27.08% and 6.70%, respectively. The coefficient of variation of emergency rescue time was reduced by approximately 28.22% and 21.41%, respectively. The results indicated that the model satisfied the expressway emergency rescue demand requirements, and improved the rationality of the rescue center node layout.

Drug Repurposing for COVID-19 by Constructing a Comorbidity Network with Central Nervous System Disorders

In the post-COVID-19 era, treatment options for potential SARS-CoV-2 outbreaks remain limited. An increased incidence of central nervous system (CNS) disorders has been observed in long-term COVID-19 patients. Understanding the shared molecular mechanisms between these conditions may provide new insights for developing effective therapies. This study developed an integrative drug-repurposing framework for COVID-19, leveraging comorbidity data with CNS disorders, network-based modular analysis, and dynamic perturbation analysis to identify potential drug targets and candidates against SARS-CoV-2. We constructed a comorbidity network based on the literature and data collection, including COVID-19-related proteins and genes associated with Alzheimer's disease, Parkinson's disease, multiple sclerosis, and autism spectrum disorder. Functional module detection and annotation identified a module primarily involved in protein synthesis as a key target module, utilizing connectivity map drug perturbation data. Through the construction of a weighted drug-target network and dynamic network-based drug-repurposing analysis, ubiquitin-carboxy-terminal hydrolase L1 emerged as a potential drug target. Molecular dynamics simulations suggested pregnenolone and BRD-K87426499 as two drug candidates for COVID-19. This study introduces a dynamic-perturbation-network-based drug-repurposing approach to identify COVID-19 drug targets and candidates by incorporating the comorbidity conditions of CNS disorders.

Iterative embedding and reweighting of complex networks reveals community structure

Graph embeddings learn the structure of networks and represent it in low-dimensional vector spaces. Community structure is one of the features that are recognized and reproduced by embeddings. We show that an iterative procedure, in which a graph is repeatedly embedded and its links are reweighted based on the geometric proximity between the nodes, reinforces intra-community links and weakens inter-community links, making the clusters of the initial network more visible and more easily detectable. The geometric separation between the communities can become so strong that even a very simple parsing of the links may recover the communities as isolated components with surprisingly high precision. Furthermore, when used as a pre-processing step, our embedding and reweighting procedure can improve the performance of traditional community detection algorithms.

Two-stage multi-objective evolutionary algorithm for overlapping community discovery

As one of the essential topological structures in complex networks, community structure has significant theoretical and application value and has attracted the attention of researchers in many fields. In a social network, individuals may belong to different communities simultaneously, such as a workgroup and a hobby group. Therefore, overlapping community discovery can help us understand and model the network structure of these multiple relationships more accurately. This article proposes a two-stage multi-objective evolutionary algorithm for overlapping community discovery problem. First, using the initialization method to divide the central node based on node degree, combined with the cross-mutation evolution strategy of the genome matrix, the first stage of non-overlapping community division is completed on the decomposition-based multi-objective optimization framework. Then, based on the result set of the first stage, appropriate nodes are selected from each individual's community as the central node of the initial population in the second stage, and the fuzzy threshold is optimized through the fuzzy clustering method based on evolutionary calculation and the feedback model, to find reasonable overlapping nodes. Finally, tests are conducted on synthetic datasets and real datasets. The statistical results demonstrate that compared with other representative algorithms, this algorithm performs optimally on test instances and has better results.

An Automated Analysis Framework for Epidemiological Survey on COVID-19

For a long time, the prevention and control of COVID-19 has received significant attention. A crucial aspect of controlling the disease's spread is the epidemiological survey of patients and the subsequent analysis of epidemiological survey reports (case reports). However, current mainstream analysis approaches are all made manually. This manual method is time-consuming and manpower-intensive. This paper designs an automated visual epidemiological survey analysis (AVESA) framework for the epidemiological survey on COVID-19. AVESA designs a deep neural network for information extraction from case reports and automatically constructs an epidemiological knowledge graph based on predefined pattern. Moreover, a multi-dimensional knowledge reasoning model is developed for conducting knowledge reasoning in the complete COVID-19 epidemiological knowledge graph. In the entity extraction sub-task and multi-task extraction sub-task, AVESA achieved F1 scores of 85.12% and 92.29% respectively on the constructed dataset, significantly outperforming the standalone information extraction models. In full-graph computing, all three experiments align closely with manual analysis standards. In the risk analysis experiment, the weighted PageRank algorithm showed an average improvement of 11.21% in Top_Recall_n% over the standard PageRank algorithm. In the community detection experiment, the weighted Louvain algorithm showed a mere 4.34% community difference rate compared to manual analysis.

Entropy-based detection of Twitter echo chambers

Echo chambers, i.e. clusters of users exposed to news and opinions in line with their previous beliefs, were observed in many online debates on social platforms. We propose a completely unbiased entropy-based method for detecting echo chambers. The method is completely agnostic to the nature of the data. In the Italian Twitter debate about the Covid-19 vaccination, we find a limited presence of users in echo chambers (about 0.35% of all users). Nevertheless, their impact on the formation of a common discourse is strong, as users in echo chambers are responsible for nearly a third of the retweets in the original dataset. Moreover, in the case study observed, echo chambers appear to be a receptacle for disinformative content.

Identifying influential nodes based on the disassortativity and community structure of complex network

The complex networks exhibit significant heterogeneity in node connections, resulting in a few nodes playing critical roles in various scenarios, including decision-making, disease control, and population immunity. Therefore, accurately identifying these influential nodes that play crucial roles in networks is very important. Many methods have been proposed in different fields to solve this issue. This paper focuses on the different types of disassortativity existing in networks and innovatively introduces the concept of disassortativity of the node, namely, the inconsistency between the degree of a node and the degrees of its neighboring nodes, and proposes a measure of disassortativity of the node (DoN) by a step function. Furthermore, the paper analyzes and indicates that in many real-world network applications, such as online social networks, the influence of nodes within the network is often associated with disassortativity of the node and the community boundary structure of the network. Thus, the influential metric of node based on disassortativity and community structure (mDC) is proposed. Extensive experiments are conducted in synthetic and real networks, and the performance of the DoN and mDC is validated through network robustness experiments and immune experiment of disease infection. Experimental and analytical results demonstrate that compared to other state-of-the-art centrality measures, the proposed methods (DoN and mDC) exhibits superior identification performance and efficiency, particularly in non-disassortative networks and networks with clear community structures. Furthermore, we find that the DoN and mDC exhibit high stability to network noise and inaccuracies of the network data.

Sugar transporters spatially organize microbiota colonization along the longitudinal root axis of Arabidopsis

Plant roots are functionally heterogeneous in cellular architecture, transcriptome profile, metabolic state, and microbial immunity. We hypothesized that axial differentiation may also impact spatial colonization by root microbiota along the root axis. We developed two growth systems, ArtSoil and CD-Rhizotron, to grow and then dissect Arabidopsis thaliana roots into three segments. We demonstrate that distinct endospheric and rhizosphere bacterial communities colonize the segments, supporting the hypothesis of microbiota differentiation along the axis. Root metabolite profiling of each segment reveals differential metabolite enrichment and specificity. Bioinformatic analyses and GUS histochemistry indicate microbe-induced accumulation of SWEET2, 4, and 12 sugar uniporters. Profiling of root segments from sweet mutants shows altered spatial metabolic profiles and reorganization of endospheric root microbiota. This work reveals the interdependency between root metabolites and microbial colonization and the contribution of SWEETs to spatial diversity and stability of microbial ecosystem.

A Comprehensive Survey on Community Detection With Deep Learning

Detecting a community in a network is a matter of discerning the distinct features and connections of a group of members that are different from those in other communities. The ability to do this is of great significance in network analysis. However, beyond the classic spectral clustering and statistical inference methods, there have been significant developments with deep learning techniques for community detection in recent years-particularly when it comes to handling high-dimensional network data. Hence, a comprehensive review of the latest progress in community detection through deep learning is timely. To frame the survey, we have devised a new taxonomy covering different state-of-the-art methods, including deep learning models based on deep neural networks (DNNs), deep nonnegative matrix factorization, and deep sparse filtering. The main category, i.e., DNNs, is further divided into convolutional networks, graph attention networks, generative adversarial networks, and autoencoders. The popular benchmark datasets, evaluation metrics, and open-source implementations to address experimentation settings are also summarized. This is followed by a discussion on the practical applications of community detection in various domains. The survey concludes with suggestions of challenging topics that would make for fruitful future research directions in this fast-growing deep learning field.

Comparing community detection algorithms in psychometric networks: A Monte Carlo simulation

Identifying the correct number of factors in multivariate data is fundamental to psychological measurement. Factor analysis has a long tradition in the field, but it has been challenged recently by exploratory graph analysis (EGA), an approach based on network psychometrics. EGA first estimates a network and then applies the Walktrap community detection algorithm. Simulation studies have demonstrated that EGA has comparable or better accuracy for recovering the same number of communities as there are factors in the simulated data than factor analytic methods. Despite EGA's effectiveness, there has yet to be an investigation into whether other sparsity induction methods or community detection algorithms could achieve equivalent or better performance. Furthermore, unidimensional structures are fundamental to psychological measurement yet they have been sparsely studied in simulations using community detection algorithms. In the present study, we performed a Monte Carlo simulation using the zero-order correlation matrix, GLASSO, and two variants of a non-regularized partial correlation sparsity induction methods with several community detection algorithms. We examined the performance of these method-algorithm combinations in both continuous and polytomous data across a variety of conditions. The results indicate that the Fast-greedy, Louvain, and Walktrap algorithms paired with the GLASSO method were consistently among the most accurate and least-biased overall.

Community Detection via Autoencoder-Like Nonnegative Tensor Decomposition

Community detection aims at partitioning a network into several densely connected subgraphs. Recently, nonnegative matrix factorization (NMF) has been widely adopted in many successful community detection applications. However, most existing NMF-based community detection algorithms neglect the multihop network topology and the extreme sparsity of adjacency matrices. To resolve them, we propose a novel conception of adjacency tensor, which extends adjacency matrix to multihop cases. Then, we develop a novel tensor Tucker decomposition-based community detection method-autoencoder-like nonnegative tensor decomposition (ANTD), leveraging the constructed adjacency tensor. Distinct from simply applying tensor decomposition on the constructed adjacency tensor, which only works as a decoder, ANTD also introduces an encoder component to constitute an autoencoder-like architecture, which can further enhance the quality of the detected communities. We also develop an efficient alternative updating algorithm with convergence guarantee to optimize ANTD, and theoretically analyze the algorithm complexity. Moreover, we also study a graph regularized variant of ANTD. Extensive experiments on real-world benchmark networks by comparing 27 state-of-the-art methods, validate the effectiveness, efficiency, and robustness of our proposed methods.

DeepSLICEM: Clustering CryoEM particles using deep image and similarity graph representations

Finding the 3D structure of proteins and their complexes has several applications, such as developing vaccines that target viral proteins effectively. Methods such as cryogenic electron microscopy (cryo-EM) have improved in their ability to capture high-resolution images, and when applied to a purified sample containing copies of a macromolecule, they can be used to produce a high-quality snapshot of different 2D orientations of the macromolecule, which can be combined to reconstruct its 3D structure. Instead of purifying a sample so that it contains only one macromolecule, a process that can be difficult, time-consuming, and expensive, a cell sample containing multiple particles can be photographed directly and separated into its constituent particles using computational methods. Previous work, SLICEM, has separated 2D projection images of different particles into their respective groups using 2 methods, clustering a graph with edges weighted by pairwise similarities of common lines of the 2D projections. In this work, we develop DeepSLICEM, a pipeline that clusters rich representations of 2D projections, obtained by combining graphical features from a similarity graph based on common lines, with additional image features extracted from a convolutional neural network. DeepSLICEM explores 6 pretrained convolutional neural networks and one supervised Siamese CNN for image representation, 10 pretrained deep graph neural networks for similarity graph node representations, and 4 methods for clustering, along with 8 methods for directly clustering the similarity graph. On 6 synthetic and experimental datasets, the DeepSLICEM pipeline finds 92 method combinations achieving better clustering accuracy than previous methods from SLICEM. Thus, in this paper, we demonstrate that deep neural networks have great potential for accurately separating mixtures of 2D projections of different macromolecules computationally.

Uncertainty in GNN Learning Evaluations: A Comparison between Measures for Quantifying Randomness in GNN Community Detection

(1) The enhanced capability of graph neural networks (GNNs) in unsupervised community detection of clustered nodes is attributed to their capacity to encode both the connectivity and feature information spaces of graphs. The identification of latent communities holds practical significance in various domains, from social networks to genomics. Current real-world performance benchmarks are perplexing due to the multitude of decisions influencing GNN evaluations for this task. (2) Three metrics are compared to assess the consistency of algorithm rankings in the presence of randomness. The consistency and quality of performance between the results under a hyperparameter optimisation with the default hyperparameters is evaluated. (3) The results compare hyperparameter optimisation with default hyperparameters, revealing a significant performance loss when neglecting hyperparameter investigation. A comparison of metrics indicates that ties in ranks can substantially alter the quantification of randomness. (4) Ensuring adherence to the same evaluation criteria may result in notable differences in the reported performance of methods for this task. The W randomness coefficient, based on the Wasserstein distance, is identified as providing the most robust assessment of randomness.

A network community structure similarity index for weighted networks

Identification of communities in complex systems is an essential part of network analysis. Accordingly, measuring similarities between communities is a fundamental part of analysing community structure in different, yet related, networks. Commonly used methods for quantifying network community similarity fail to consider the effects of edge weights. Existing methods remain limited when the two networks being compared have different numbers of nodes. In this study, we address these issues by proposing a novel network community structure similarity index (NCSSI) based on the edit distance concept. NCSSI is proposed as a similarity index for comparing network communities. The NCSSI incorporates both community labels and edge weights. The NCSSI can also be employed to assess the similarity between two communities with varying numbers of nodes. We test the proposed method using simulated data and case-study analysis of New York Yellow Taxi flows and compare the results with that of other commonly used methods (i.e., mutual information and the Jaccard index). Our results highlight how NCSSI effectively captures the impact of both label and edge weight changes and their impacts on community structure, which are not captured in existing approaches. In conclusion, NCSSI offers a new approach that incorporates both label and weight variations for community similarity measurement in complex networks.

Using citation networks to evaluate the impact of text length on keyword extraction

The identification of key concepts within unstructured data is of paramount importance in practical applications. Despite the abundance of proposed methods for extracting primary topics, only a few works investigated the influence of text length on the performance of keyword extraction (KE) methods. Specifically, many studies lean on abstracts and titles for content extraction from papers, leaving it uncertain whether leveraging the complete content of papers can yield consistent results. Hence, in this study, we employ a network-based approach to evaluate the concordance between keywords extracted from abstracts and those from the entire papers. Community detection methods are utilized to identify interconnected papers in citation networks. Subsequently, paper clusters are formed to identify salient terms within each cluster, employing a methodology akin to the term frequency-inverse document frequency (tf-idf) approach. Once each cluster has been endowed with its distinctive set of key terms, these selected terms are employed to serve as representative keywords at the paper level. The top-ranked words at the cluster level, which also appear in the abstract, are chosen as keywords for the paper. Our findings indicate that although various community detection methods used in KE yield similar levels of accuracy. Notably, text clustering approaches outperform all citation-based methods, while all approaches yield relatively low accuracy values. We also identified a lack of concordance between keywords extracted from the abstracts and those extracted from the corresponding full-text source. Considering that citations and text clustering yield distinct outcomes, combining them in hybrid approaches could offer improved performance.

Food co-consumption network as a new approach to dietary pattern in non-alcoholic fatty liver disease

Dietary patterns strongly correlate with non-alcoholic fatty liver disease (NAFLD), which is a leading cause of chronic liver disease in developed societies. In this study, we introduce a new definition, the co-consumption network (CCN), which depicts the common consumption patterns of food groups through network analysis. We then examine the relationship between dietary patterns and NAFLD by analyzing this network. We selected 1500 individuals living in Tehran, Iran, cross-sectionally. They completed a food frequency questionnaire and underwent scanning via the FibroScan for liver stiffness, using the CAP score. The food items were categorized into 40 food groups. We reconstructed the CCN using the Spearman correlation-based connection. We then created healthy and unhealthy clusters using the label propagation algorithm. Participants were assigned to two clusters using the hypergeometric distribution. Finally, we classified participants into two healthy NAFLD networks, and reconstructed the gender and disease differential CCNs. We found that the sweet food group was the hub of the proposed CCN, with the largest cliques of size 5 associated with the unhealthy cluster. The unhealthy module members had a significantly higher CAP score (253.7 ± 47.8) compared to the healthy module members (218.0 ± 46.4) (P < 0.001). The disease differential CCN showed that in the case of NAFLD, processed meat had been co-consumed with mayonnaise and soft drinks, in contrast to the healthy participants, who had co-consumed fruits with green leafy and yellow vegetables. The CCN is a powerful method for presenting food groups, their consumption quantity, and their interactions efficiently. Moreover, it facilitates the examination of the relationship between dietary patterns and NAFLD.

A Temporal Graph Model to Predict Chemical Transformations in Complex Dissolved Organic Matter

Dissolved organic matter (DOM) is a complex mixture of thousands of natural molecules that undergo constant transformation in the environment, such as sunlight induced photochemical reactions. Despite molecular level resolution from ultrahigh resolution mass spectrometry (UHRMS), trends of mass peak intensities are currently the only way to follow photochemically induced molecular changes in DOM. Many real-world relationships and temporal processes can be intuitively modeled using graph data structures (networks). Graphs enhance the potential and value of AI applications by adding context and interconnections allowing the uncovering of hidden or unknown relationships in data sets. We use a temporal graph model and link prediction to identify transformations of DOM molecules in a photo-oxidation experiment. Our link prediction algorithm simultaneously considers educt removal and product formation for molecules linked by predefined transformation units (oxidation, decarboxylation, etc.). The transformations are further weighted by the extent of intensity change and clustered on the graph structure to identify groups of similar reactivity. The temporal graph is capable of identifying relevant molecules subject to similar reactions and enabling to study their time course. Our approach overcomes previous data evaluation limitations for mechanistic studies of DOM and leverages the potential of temporal graphs to study DOM reactivity by UHRMS.

A community partitioning algorithm for cyberspace

Community partitioning is an effective technique for cyberspace mapping. However, existing community partitioning algorithm only uses the topological structure of the network to divide the community and disregards factors such as real hierarchy, overlap, and directionality of information transmission between communities in cyberspace. Consequently, the traditional community division algorithm is not suitable for dividing cyberspace resources effectively. Based on cyberspace community structure characteristics, this study introduces an algorithm that combines an improved local fitness maximization (LFM) algorithm with the PageRank (PR) algorithm for community partitioning on cyberspace resources, called PR-LFM. First, seed nodes are determined using degree centrality, followed by local community expansion. Nodes belonging to multiple communities undergo further partitioning so that they are retained in the community where they are most important, thus preserving the community's original structure. The experimental data demonstrate good results in the resource division of cyberspace.

Robustness of community structure under edge addition

Communities often represent key structural and functional clusters in networks. To preserve such communities, it is important to understand their robustness under network perturbations. Previous work in community robustness analysis has focused on studying changes in the community structure as a response of edge rewiring and node or edge removal. However, the impact of increasing connectivity on the robustness of communities in networked systems is relatively unexplored. Studying the limits of community robustness under edge addition is crucial to better understanding the cases in which density expands or false edges erroneously appear. In this paper, we analyze the effect of edge addition on community robustness in synthetic and empirical temporal networks. We study two scenarios of edge addition: random and targeted. We use four community detection algorithms, Infomap, Label Propagation, Leiden, and Louvain, and demonstrate the results in community similarity metrics. The experiments on synthetic networks show that communities are more robust when the initial partition is stronger or the edge addition is random, and the experiments on empirical data also indicate that robustness performance can be affected by the community similarity metric. Overall, our results suggest that the communities identified by the different types of community detection algorithms exhibit different levels of robustness, and so the robustness of communities depends strongly on the choice of detection method.

LaenNet: Learning robust GCNs by propagating labels

Graph Convolutional Networks (GCNs) can be acknowledged as one of the most significant methodologies for graph representation learning, and the family of GCNs has recently achieved great success in the community. However, in real-world scenarios, the graph data may be imperfect, e.g., with noisy and sparse features or labels, which poses a great challenge to the robustness of GCNs. To meet this challenge, we propose a simple-yet-effective LAbel-ENhanced Networks (LaenNet) architecture for GCNs, where the basic spirit is to propagate labels together with features. Specifically, we add an extra LaenNet module at one hidden layer of GCNs, which propagates labels along the graph and then integrates them with the hidden representations as the inputs to the deeper layer. The proposed LaenNet can be directly generalized to the variants of GCNs. We conduct extensive experiments to verify LaenNet on semi-supervised node classification tasks under four noisy and sparse graph data scenarios, including the graphs with noisy features, sparse features, noisy labels, and sparse labels. Empirical results indicate the superiority and robustness of LaenNet compared to the state-of-the-art baseline models. The implementation code is available to ease reproducibility1.

Robust, scalable, and informative clustering for diverse biological networks

Clustering molecular data into informative groups is a primary step in extracting robust conclusions from big data. However, due to foundational issues in how they are defined and detected, such clusters are not always reliable, leading to unstable conclusions. We compare popular clustering algorithms across thousands of synthetic and real biological datasets, including a new consensus clustering algorithm-SpeakEasy2: Champagne. These tests identify trends in performance, show no single method is universally optimal, and allow us to examine factors behind variation in performance. Multiple metrics indicate SpeakEasy2 generally provides robust, scalable, and informative clusters for a range of applications.

Analysis of functional connectivity using machine learning and deep learning in different data modalities from individuals with schizophrenia

Objective. Schizophrenia(SCZ) is a severe mental disorder associated with persistent or recurrent psychosis, hallucinations, delusions, and thought disorders that affect approximately 26 million people worldwide, according to the World Health Organization. Several studies encompass machine learning (ML) and deep learning algorithms to automate the diagnosis of this mental disorder. Others study SCZ brain networks to get new insights into the dynamics of information processing in individuals suffering from the condition. In this paper, we offer a rigorous approach with ML and deep learning techniques for evaluating connectivity matrices and measures of complex networks to establish an automated diagnosis and comprehend the topology and dynamics of brain networks in SCZ individuals.Approach.For this purpose, we employed an functional magnetic resonance imaging (fMRI) and electroencephalogram (EEG) dataset. In addition, we combined EEG measures, i.e. Hjorth mobility and complexity, with complex network measurements to be analyzed in our model for the first time in the literature.Main results.When comparing the SCZ group to the control group, we found a high positive correlation between the left superior parietal lobe and the left motor cortex and a positive correlation between the left dorsal posterior cingulate cortex and the left primary motor. Regarding complex network measures, the diameter, which corresponds to the longest shortest path length in a network, may be regarded as a biomarker because it is the most crucial measure in different data modalities. Furthermore, the SCZ brain networks exhibit less segregation and a lower distribution of information. As a result, EEG measures outperformed complex networks in capturing the brain alterations associated with SCZ.Significance. Our model achieved an area under receiver operating characteristic curve (AUC) of 100% and an accuracy of 98.5% for the fMRI, an AUC of 95%, and an accuracy of 95.4% for the EEG data set. These are excellent classification results. Furthermore, we investigated the impact of specific brain connections and network measures on these results, which helped us better describe changes in the diseased brain.

Integrating chromatin conformation information in a self-supervised learning model improves metagenome binning

Metagenome binning is a key step, downstream of metagenome assembly, to group scaffolds by their genome of origin. Although accurate binning has been achieved on datasets containing multiple samples from the same community, the completeness of binning is often low in datasets with a small number of samples due to a lack of robust species co-abundance information. In this study, we exploited the chromatin conformation information obtained from Hi-C sequencing and developed a new reference-independent algorithm, Metagenome Binning with Abundance and Tetra-nucleotide frequencies-Long Range (metaBAT-LR), to improve the binning completeness of these datasets. This self-supervised algorithm builds a model from a set of high-quality genome bins to predict scaffold pairs that are likely to be derived from the same genome. Then, it applies these predictions to merge incomplete genome bins, as well as recruit unbinned scaffolds. We validated metaBAT-LR's ability to bin-merge and recruit scaffolds on both synthetic and real-world metagenome datasets of varying complexity. Benchmarking against similar software tools suggests that metaBAT-LR uncovers unique bins that were missed by all other methods. MetaBAT-LR is open-source and is available at https://bitbucket.org/project-metabat/metabat-lr.

Community-Based Matrix Factorization (CBMF) Approach for Enhancing Quality of Recommendations

Matrix factorization is a long-established method employed for analyzing and extracting valuable insight recommendations from complex networks containing user ratings. The execution time and computational resources demanded by these algorithms pose limitations when confronted with large datasets. Community detection algorithms play a crucial role in identifying groups and communities within intricate networks. To overcome the challenge of extensive computing resources with matrix factorization techniques, we present a novel framework that utilizes the inherent community information of the rating network. Our proposed approach, named Community-Based Matrix Factorization (CBMF), has the following steps: (1) Model the rating network as a complex bipartite network. (2) Divide the network into communities. (3) Extract the rating matrices pertaining only to those communities and apply MF on these matrices in parallel. (4) Merge the predicted rating matrices belonging to communities and evaluate the root mean square error (RMSE). In our experimentation, we use basic MF, SVD++, and FANMF for matrix factorization, and the Louvain algorithm is used for community division. The experimental evaluation on six datasets shows that the proposed CBMF enhances the quality of recommendations in each case. In the MovieLens 100K dataset, RMSE has been reduced to 0.21 from 1.26 using SVD++ by dividing the network into 25 communities. A similar reduction in RMSE is observed for the datasets of FilmTrust, Jester, Wikilens, Good Books, and Cell Phone.

Assembly of 43 human Y chromosomes reveals extensive complexity and variation

The prevalence of highly repetitive sequences within the human Y chromosome has prevented its complete assembly to date1 and led to its systematic omission from genomic analyses. Here we present de novo assemblies of 43 Y chromosomes spanning 182,900 years of human evolution and report considerable diversity in size and structure. Half of the male-specific euchromatic region is subject to large inversions with a greater than twofold higher recurrence rate compared with all other chromosomes2. Ampliconic sequences associated with these inversions show differing mutation rates that are sequence context dependent, and some ampliconic genes exhibit evidence for concerted evolution with the acquisition and purging of lineage-specific pseudogenes. The largest heterochromatic region in the human genome, Yq12, is composed of alternating repeat arrays that show extensive variation in the number, size and distribution, but retain a 1:1 copy-number ratio. Finally, our data suggest that the boundary between the recombining pseudoautosomal region 1 and the non-recombining portions of the X and Y chromosomes lies 500 kb away from the currently established1 boundary. The availability of fully sequence-resolved Y chromosomes from multiple individuals provides a unique opportunity for identifying new associations of traits with specific Y-chromosomal variants and garnering insights into the evolution and function of complex regions of the human genome.

Density-Based Entropy Centrality for Community Detection in Complex Networks

One of the most important problems in complex networks is the location of nodes that are essential or play a main role in the network. Nodes with main local roles are the centers of real communities. Communities are sets of nodes of complex networks and are densely connected internally. Choosing the right nodes as seeds of the communities is crucial in determining real communities. We propose a new centrality measure named density-based entropy centrality for the local identification of the most important nodes. It measures the entropy of the sum of the sizes of the maximal cliques to which each node and its neighbor nodes belong. The proposed centrality is a local measure for explaining the local influence of each node, which provides an efficient way to locally identify the most important nodes and for community detection because communities are local structures. It can be computed independently for individual vertices, for large networks, and for not well-specified networks. The use of the proposed density-based entropy centrality for community seed selection and community detection outperforms other centrality measures.

Social network structure and the spread of complex contagions from a population genetics perspective

Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a nonlinear function of the fraction of the individuals' affected neighbors, such a spreading process becomes a "complex contagion." This nonlinearity does not typically appear with physically spreading infections, but instead can emerge when the concept that is spreading is subject to game theoretical considerations (e.g., for choices of strategy or behavior) or psychological effects such as social reinforcement and other forms of peer influence (e.g., for ideas, preferences, or opinions). Here we study how the stochastic dynamics of such complex contagions are affected by the underlying network structure. Motivated by simulations of complex contagions on real social networks, we present a framework for analyzing the statistics of contagions with arbitrary nonlinear adoption probabilities based on the mathematical tools of population genetics. The central idea is to use an effective lower-dimensional diffusion process to approximate the statistics of the contagion. This leads to a tradeoff between the effects of "selection" (microscopic tendencies for an idea to spread or die out), random drift, and network structure. Our framework illustrates intuitively several key properties of complex contagions: stronger community structure and network sparsity can significantly enhance the spread, while broad degree distributions dampen the effect of selection compared to random drift. Finally, we show that some structural features can exhibit critical values that demarcate regimes where global contagions become possible for networks of arbitrary size. Our results draw parallels between the competition of genes in a population and memes in a world of minds and ideas. Our tools provide insight into the spread of information, behaviors, and ideas via social influence, and highlight the role of macroscopic network structure in determining their fate.

Implicit models, latent compression, intrinsic biases, and cheap lunches in community detection

The task of community detection, which aims to partition a network into clusters of nodes to summarize its large-scale structure, has spawned the development of many competing algorithms with varying objectives. Some community detection methods are inferential, explicitly deriving the clustering objective through a probabilistic generative model, while other methods are descriptive, dividing a network according to an objective motivated by a particular application, making it challenging to compare these methods on the same scale. Here we present a solution to this problem that associates any community detection objective, inferential or descriptive, with its corresponding implicit network generative model. This allows us to compute the description length of a network and its partition under arbitrary objectives, providing a principled measure to compare the performance of different algorithms without the need for "ground-truth" labels. Our approach also gives access to instances of the community detection problem that are optimal to any given algorithm and in this way reveals intrinsic biases in popular descriptive methods, explaining their tendency to overfit. Using our framework, we compare a number of community detection methods on artificial networks and on a corpus of over 500 structurally diverse empirical networks. We find that more expressive community detection methods exhibit consistently superior compression performance on structured data instances, without having degraded performance on a minority of situations where more specialized algorithms perform optimally. Our results undermine the implications of the "no free lunch" theorem for community detection, both conceptually and in practice, since it is confined to unstructured data instances, unlike relevant community detection problems which are structured by requirement.

Illegal Community Detection in Bitcoin Transaction Networks

Community detection is widely used in social networks to uncover groups of related vertices (nodes). In cryptocurrency transaction networks, community detection can help identify users that are most related to known illegal users. However, there are challenges in applying community detection in cryptocurrency transaction networks: (1) the use of pseudonymous addresses that are not directly linked to personal information make it difficult to interpret the detected communities; (2) on Bitcoin, a user usually owns multiple Bitcoin addresses, and nodes in transaction networks do not always represent users. Existing works on cluster analysis on Bitcoin transaction networks focus on addressing the later using different heuristics to cluster addresses that are controlled by the same user. This research focuses on illegal community detection containing one or more illegal Bitcoin addresses. We first investigate the structure of Bitcoin transaction networks and suitable community detection methods, then collect a set of illegal addresses and use them to label the detected communities. The results show that 0.06% of communities from daily transaction networks contain one or more illegal addresses when 2,313,344 illegal addresses are used to label the communities. The results also show that distance-based clustering methods and other methods depending on them, such as network representation learning, are not suitable for Bitcoin transaction networks while community quality optimization and label-propagation-based methods are the most suitable.

Disentangling transport movement patterns of trucks either transporting pigs or while empty within a swine production system before and during the COVID-19 epidemic

Transport of pigs between sites occurs frequently as part of genetic improvement and age segregation. However, a lack of transport biosecurity could have catastrophic implications if not managed properly as disease spread would be imminent. However, there is a lack of a comprehensive study of vehicle movement trends within swine systems in the Midwest. In this study, we aimed to describe and characterize vehicle movement patterns within one large Midwest swine system representative of modern pig production to understand movement trends and proxies for biosecurity compliance and identify potential risky behaviors that may result in a higher risk for infectious disease spread. Geolocation tracking devices recorded vehicle movements of a subset of trucks and trailers from a production system every 5 min and every time tracks entered a landmark between January 2019 and December 2020, before and during the COVID-19 pandemic. We described 6,213 transport records from 12 vehicles controlled by the company. In total, 114 predefined landmarks were included during the study period, representing 5 categories of farms and truck wash facilities. The results showed that trucks completed the majority (76.4%, 2,111/2,762) of the recorded movements. The seasonal distribution of incoming movements was similar across years (P > 0.05), while the 2019 winter and summer seasons showed higher incoming movements to sow farms than any other season, year, or production type (P < 0.05). More than half of the in-movements recorded occurred within the triad of sow farms, wean-to-market stage, and truck wash facilities. Overall, time spent at each landmark was 9.08% higher in 2020 than in 2019, without seasonal highlights, but with a notably higher time spent at truck wash facilities than any other type of landmark. Network analyses showed high connectivity among farms with identifiable clusters in the network. Furthermore, we observed a decrease in connectivity in 2020 compared with 2019, as indicated by the majority of network parameter values. Further network analysis will be needed to understand its impact on disease spread and control. However, the description and quantification of movement trends reported in this study provide findings that might be the basis for targeting infectious disease surveillance and control.

Arena3Dweb: interactive 3D visualization of multilayered networks supporting multiple directional information channels, clustering analysis and application integration

Arena3D^web is an interactive web tool that visualizes multi-layered networks in 3D space. In this update, Arena3D^web supports directed networks as well as up to nine different types of connections between pairs of nodes with the use of Bézier curves. It comes with different color schemes (light/gray/dark mode), custom channel coloring, four node clustering algorithms which one can run on-the-fly, visualization in VR mode and predefined layer layouts (zig-zag, star and cube). This update also includes enhanced navigation controls (mouse orbit controls, layer dragging and layer/node selection), while its newly developed API allows integration with external applications as well as saving and loading of sessions in JSON format. Finally, a dedicated Cytoscape app has been developed, through which users can automatically send their 2D networks from Cytoscape to Arena3D^web for 3D multi-layer visualization. Arena3D^web is accessible at http://arena3d.pavlopouloslab.info or http://arena3d.org.

Intermunicipal travel networks of Mexico during the COVID-19 pandemic

Human mobility networks are widely used for diverse studies in geography, sociology, and economics. In these networks, nodes usually represent places or regions and links refer to movement between them. They become essential when studying the spread of a virus, the planning of transit, or society's local and global structures. Therefore, the construction and analysis of human mobility networks are crucial for a vast number of real-life applications. This work presents a collection of networks that describe the human travel patterns between municipalities in Mexico in the 2020-2021 period. Using anonymized mobile location data, we constructed directed, weighted networks representing the volume of travels between municipalities. We analysed changes in global, local, and mesoscale network features. We observe that changes in these features are associated with factors such as COVID-19 restrictions and population size. In general, the implementation of restrictions at the start of the COVID-19 pandemic in early 2020, induced more intense changes in network features than later events, which had a less notable impact in network features. These networks will result very useful for researchers and decision-makers in the areas of transportation, infrastructure planning, epidemic control and network science at large.