Comparing methods for comparing networks

An embedding-based distance for temporal graphs

Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at different time points. However, quantifying the similarity between temporal graphs as a whole is an open problem. Here, we use embeddings based on time-respecting random walks to introduce a new notion of distance between temporal graphs. This distance is well-defined for pairs of temporal graphs with different numbers of nodes and different time spans. We study the case of a matched pair of graphs, when a known relation exists between their nodes, and the case of unmatched graphs, when such a relation is unavailable and the graphs may be of different sizes. We use empirical and synthetic temporal network data to show that the distance we introduce discriminates graphs with different topological and temporal properties. We provide an efficient implementation of the distance computation suitable for large-scale temporal graphs.

Distinguishable topology of the task-evoked functional genome networks in HIV-1 reservoirs

HIV-1 reservoirs display a heterogeneous nature, lodging both intact and defective proviruses. To deepen our understanding of such heterogeneous HIV-1 reservoirs and their functional implications, we integrated basic concepts of graph theory to characterize the composition of HIV-1 reservoirs. Our analysis revealed noticeable topological properties in networks, featuring immunologic signatures enriched by genes harboring intact and defective proviruses, when comparing antiretroviral therapy (ART)-treated HIV-1-infected individuals and elite controllers. The key variable, the rich factor, played a pivotal role in classifying distinct topological properties in networks. The host gene expression strengthened the accuracy of classification between elite controllers and ART-treated patients. Markov chain modeling for the simulation of different graph networks demonstrated the presence of an intrinsic barrier between elite controllers and non-elite controllers. Overall, our work provides a prime example of leveraging genomic approaches alongside mathematical tools to unravel the complexities of HIV-1 reservoirs.

Approaches for Benchmarking Single-Cell Gene Regulatory Network Methods

Gene regulatory networks are powerful tools for modeling genetic interactions that control the expression of genes driving cell differentiation, and single-cell sequencing offers a unique opportunity to build these networks with high-resolution genomic data. There are many proposed computational methods to build these networks using single-cell data, and different approaches are used to benchmark these methods. However, a comprehensive discussion specifically focusing on benchmarking approaches is missing. In this article, we lay the GRN terminology, present an overview of common gold-standard studies and data sets, and define the performance metrics for benchmarking network construction methodologies. We also point out the advantages and limitations of different benchmarking approaches, suggest alternative ground truth data sets that can be used for benchmarking, and specify additional considerations in this context.

Altered functional connectivity in preterm neonates with intraventricular hemorrhage assessed using functional near-infrared spectroscopy

Intraventricular hemorrhage (IVH) is a common neurological injury following very preterm birth. Resting-state functional connectivity (RSFC) using functional magnetic resonance imaging (fMRI) is associated with injury severity; yet, fMRI is impractical for use in intensive care settings. Functional near-infrared spectroscopy (fNIRS) measures RSFC through cerebral hemodynamics and has greater bedside accessibility than fMRI. We evaluated RSFC in preterm neonates with IVH using fNIRS and fMRI at term-equivalent age, and compared fNIRS connectivity between healthy newborns and those with IVH. Sixteen very preterm born neonates were scanned with fMRI and fNIRS. Additionally, fifteen healthy newborns were scanned with fNIRS. In preterms with IVH, fNIRS and fMRI connectivity maps were compared using Euclidean and Jaccard distances. The severity of IVH in relation to fNIRS-RSFC strength was examined using generalized linear models. fNIRS and fMRI RSFC maps showed good correspondence. Connectivity strength was significantly lower in healthy newborns (p-value = 0.023) and preterm infants with mild IVH (p-value = 0.026) compared to infants with moderate/severe IVH. fNIRS has potential to be a new bedside tool for assessing brain injury and monitoring cerebral hemodynamics, as well as a promising biomarker for IVH severity in very preterm born infants.

Intrinsic dimension as a multi-scale summary statistics in network modeling

Complex networks are powerful mathematical tools for modelling and understanding the behaviour of highly interconnected systems. However, existing methods for analyzing these networks focus on local properties (e.g. degree distribution, clustering coefficient) or global properties (e.g. diameter, modularity) and fail to characterize the network structure across multiple scales. In this paper, we introduce a rigorous method for calculating the intrinsic dimension of unweighted networks. The intrinsic dimension is a feature that describes the network structure at all scales, from local to global. We propose using this measure as a summary statistic within an Approximate Bayesian Computation framework to infer the parameters of flexible and multi-purpose mechanistic models that generate complex networks. Furthermore, we present a new mechanistic model that can reproduce the intrinsic dimension of networks with large diameters, a task that has been challenging for existing models.

A hyper-distance-based method for hypernetwork comparison

Hypernetwork is a useful way to depict multiple connections between nodes, making it an ideal tool for representing complex relationships in network science. In recent years, there has been a marked increase in studies on hypernetworks; however, the comparison of the difference between two hypernetworks has received less attention. This paper proposes a hyper-distance (HD)-based method for comparing hypernetworks. The method is based on higher-order information, i.e, the higher-order distance between nodes and Jensen-Shannon divergence. Experiments carried out on synthetic hypernetworks have shown that HD is capable of distinguishing between hypernetworks generated with different parameters, and it is successful in the classification of hypernetworks. Furthermore, HD outperforms current state-of-the-art baselines to distinguish empirical hypernetworks when hyperedges are randomly perturbed.

Incorporating prior information in gene expression network-based cancer heterogeneity analysis

Cancer is molecularly heterogeneous, with seemingly similar patients having different molecular landscapes and accordingly different clinical behaviors. In recent studies, gene expression networks have been shown as more effective/informative for cancer heterogeneity analysis than some simpler measures. Gene interconnections can be classified as "direct" and "indirect," where the latter can be caused by shared genomic regulators (such as transcription factors, microRNAs, and other regulatory molecules) and other mechanisms. It has been suggested that incorporating the regulators of gene expressions in network analysis and focusing on the direct interconnections can lead to a deeper understanding of the more essential gene interconnections. Such analysis can be seriously challenged by the large number of parameters (jointly caused by network analysis, incorporation of regulators, and heterogeneity) and often weak signals. To effectively tackle this problem, we propose incorporating prior information contained in the published literature. A key challenge is that such prior information can be partial or even wrong. We develop a two-step procedure that can flexibly accommodate different levels of prior information quality. Simulation demonstrates the effectiveness of the proposed approach and its superiority over relevant competitors. In the analysis of a breast cancer dataset, findings different from the alternatives are made, and the identified sample subgroups have important clinical differences.

Augmenting bacterial similarity measures using a graph-based genome representation

Relationships between bacterial taxa are traditionally defined using 16S rRNA nucleotide similarity or average nucleotide identity. Improvements in sequencing technology provide additional pairwise information on genome sequences, which may provide valuable information on genomic relationships. Mapping orthologous gene locations between genome pairs, known as synteny, is typically implemented in the discovery of new species and has not been systematically applied to bacterial genomes. Using a data set of 378 bacterial genomes, we developed and tested a new measure of synteny similarity between a pair of genomes, which was scaled onto 16S rRNA distance using covariance matrices. Based on the input gene functions used (i.e., core, antibiotic resistance, and virulence), we observed varying topological arrangements of bacterial relationship networks by applying (i) complete linkage hierarchical clustering and (ii) K-nearest neighbor graph structures to synteny-scaled 16S data. Our metric improved clustering quality comparatively to state-of-the-art average nucleotide identity metrics while preserving clustering assignments for the highest similarity relationships. Our findings indicate that syntenic relationships provide more granular and interpretable relationships for within-genera taxa compared to pairwise similarity measures, particularly in functional contexts.

IMPORTANCE

Given the prevalence and necessity of the 16S rRNA measure in bacterial identification and analysis, this additional analysis adds a functional and synteny-based layer to the identification of relatives and clustering of bacteria genomes. It is also of computational interest to model the bacterial genome as a graph structure, which presents new avenues of genomic analysis for bacteria and their closely related strains and species.

Gaze-based attention network analysis in a virtual reality classroom

This article provides a step-by-step guideline for measuring and analyzing visual attention in 3D virtual reality (VR) environments based on eye-tracking data. We propose a solution to the challenges of obtaining relevant eye-tracking information in a dynamic 3D virtual environment and calculating interpretable indicators of learning and social behavior. With a method called "gaze-ray casting," we simulated 3D-gaze movements to obtain information about the gazed objects. This information was used to create graphical models of visual attention, establishing attention networks. These networks represented participants' gaze transitions between different entities in the VR environment over time. Measures of centrality, distribution, and interconnectedness of the networks were calculated to describe the network structure. The measures, derived from graph theory, allowed for statistical inference testing and the interpretation of participants' visual attention in 3D VR environments. Our method provides useful insights when analyzing students' learning in a VR classroom, as reported in a corresponding evaluation article with N = 274 participants. •Guidelines on implementing gaze-ray casting in VR using the Unreal Engine and the HTC VIVE Pro Eye.•Creating gaze-based attention networks and analyzing their network structure.•Implementation tutorials and the Open Source software code are provided via OSF: https://osf.io/pxjrc/?view_only=1b6da45eb93e4f9eb7a138697b941198.

Dissimilarity in flea and host assemblages and their interaction networks along a spatial distance gradient: different patterns revealed by different network dissimilarity metrics

We investigated the distance-decay pattern (an increase in dissimilarity with increasing geographic distance) in regional assemblages of fleas and their small mammalian hosts, as well as their interaction networks, in four biogeographic realms. Dissimilarity of assemblages (βtotal) was partitioned into species richness differences (βrich) and species replacement (βrepl) components. Dissimilarity of networks was assessed using two metrics: (a) whole network dissimilarity (βWN) partitioned into species replacement (βST) and interaction rewiring (βOS) components and (b) D statistics, measuring dissimilarity in the pure structure of the networks, without using information on species identities and calculated for hosts-shared-by-fleas networks (Dh) and fleas-shared-by-hosts networks (Df). We asked whether the distance-decay pattern (a) occurs among interactor assemblages or their interaction networks; (b) depends on the network dissimilarity metric used; and (c) differs between realms. The βtotal and βrepl of flea and host assemblages increased with distance in all realms except for host assemblages in the Afrotropics. βrich for flea and host assemblages increased with distance in the Nearctic only. In networks, βWN and βST demonstrated a distance-decay pattern, whereas βOS was mainly spatially invariant except in the Neotropics. Correlations of Dh or Df and geographic distance were mostly non-significant. We conclude that investigations of dissimilarity in interaction networks should include both types of dissimilarity metrics (those that consider partner identities and those that consider the pure structure of networks). This will allow elucidating the predictability of some facets of network dissimilarity and the unpredictability of other facets.

Quantifying synergy and redundancy between networks

Understanding how different networks relate to each other is key for understanding complex systems. We introduce an intuitive yet powerful framework to disentangle different ways in which networks can be (dis)similar and complementary to each other. We decompose the shortest paths between nodes as uniquely contributed by one source network, or redundantly by either, or synergistically by both together. Our approach considers the networks' full topology, providing insights at multiple levels of resolution: from global statistics to individual paths. Our framework is widely applicable across scientific domains, from public transport to brain networks. In humans and 124 other species, we demonstrate the prevalence of unique contributions by long-range white-matter fibers in structural brain networks. Across species, efficient communication also relies on significantly greater synergy between long-range and short-range fibers than expected by chance. Our framework could find applications for designing network systems or evaluating existing ones.

Altered resting-state functional connectivity in newborns with hypoxic ischemic encephalopathy assessed using high-density functional near-infrared spectroscopy

Hypoxic-ischemic encephalopathy (HIE) results from a lack of oxygen to the brain during the perinatal period. HIE can lead to mortality and various acute and long-term morbidities. Improved bedside monitoring methods are needed to identify biomarkers of brain health. Functional near-infrared spectroscopy (fNIRS) can assess resting-state functional connectivity (RSFC) at the bedside. We acquired resting-state fNIRS data from 21 neonates with HIE (postmenstrual age [PMA] = 39.96), in 19 neonates the scans were acquired post-therapeutic hypothermia (TH), and from 20 term-born healthy newborns (PMA = 39.93). Twelve HIE neonates also underwent resting-state functional magnetic resonance imaging (fMRI) post-TH. RSFC was calculated as correlation coefficients amongst the time courses for fNIRS and fMRI data, respectively. The fNIRS and fMRI RSFC maps were comparable. RSFC patterns were then measured with graph theory metrics and compared between HIE infants and healthy controls. HIE newborns showed significantly increased clustering coefficients, network efficiency and modularity compared to controls. Using a support vector machine algorithm, RSFC features demonstrated good performance in classifying the HIE and healthy newborns in separate groups. Our results indicate the utility of fNIRS-connectivity patterns as potential biomarkers for HIE and fNIRS as a new bedside tool for newborns with HIE.

Directed Network Comparison Using Motifs

Analyzing and characterizing the differences between networks is a fundamental and challenging problem in network science. Most previous network comparison methods that rely on topological properties have been restricted to measuring differences between two undirected networks. However, many networks, such as biological networks, social networks, and transportation networks, exhibit inherent directionality and higher-order attributes that should not be ignored when comparing networks. Therefore, we propose a motif-based directed network comparison method that captures local, global, and higher-order differences between two directed networks. Specifically, we first construct a motif distribution vector for each node, which captures the information of a node's involvement in different directed motifs. Then, the dissimilarity between two directed networks is defined on the basis of a matrix, which is composed of the motif distribution vector of every node and the Jensen-Shannon divergence. The performance of our method is evaluated via the comparison of six real directed networks with their null models, as well as their perturbed networks based on edge perturbation. Our method is superior to the state-of-the-art baselines and is robust with different parameter settings.

Graph embedding and geometric deep learning relevance to network biology and structural chemistry

Graphs are used as a model of complex relationships among data in biological science since the advent of systems biology in the early 2000. In particular, graph data analysis and graph data mining play an important role in biology interaction networks, where recent techniques of artificial intelligence, usually employed in other type of networks (e.g., social, citations, and trademark networks) aim to implement various data mining tasks including classification, clustering, recommendation, anomaly detection, and link prediction. The commitment and efforts of artificial intelligence research in network biology are motivated by the fact that machine learning techniques are often prohibitively computational demanding, low parallelizable, and ultimately inapplicable, since biological network of realistic size is a large system, which is characterised by a high density of interactions and often with a non-linear dynamics and a non-Euclidean latent geometry. Currently, graph embedding emerges as the new learning paradigm that shifts the tasks of building complex models for classification, clustering, and link prediction to learning an informative representation of the graph data in a vector space so that many graph mining and learning tasks can be more easily performed by employing efficient non-iterative traditional models (e.g., a linear support vector machine for the classification task). The great potential of graph embedding is the main reason of the flourishing of studies in this area and, in particular, the artificial intelligence learning techniques. In this mini review, we give a comprehensive summary of the main graph embedding algorithms in light of the recent burgeoning interest in geometric deep learning.

Is the type and/or co-existence of degenerative spinal pathology associated with the occurrence of degenerative cervical myelopathy? A single centre retrospective analysis of individuals with MRI defined cervical cord compression

BACKGROUND

Degenerative cervical myelopathy (DCM) arises from spinal degenerative changes injuring the cervical spinal cord. Most cord compression is incidental, referred to as asymptomatic spinal cord compression (ASCC). How and why ASCC differs from DCM is poorly understood. In this paper, we study a local cohort to identify specific types and groups of degenerative pathology more likely associated with DCM than ASCC.

METHODS

This study was a retrospective cohort analysis (IRB Approval ID: PRN10455). The frequency of degenerative findings between those with ASCC and DCM patients were compared using network analysis, hierarchical clustering, and comparison to existing literature to identify potential subgroups in a local cohort (N = 155) with MRI-defined cervical spinal cord compression. Quantitative measures of spinal cord compression (MSCC and MCC) were used to confirm their relevance.

RESULTS

ELF (8.7 %, 95 % CI 3.8-13.6 % vs 35.7 %, 95 % CI 27.4-44.0 %) Congenital Stenosis (3.9 %, 95 % CI 0.6-7.3 % vs 25.0 %, 95 % CI 17.5-32.5 %), and OPLL (0.0 %, 95 % CI 0.0-0.0 % vs 3.6 %, 95 % CI 0.3-6.8 %) were more likely in patients with DCM. Comparative network analysis indicated loss of lordosis was associated with ASCC, whilst ELF with DCM. Hierarchical Cluster Analysis indicated four sub-groups: multi-level disc disease with ELF, single-level disc disease without loss of lordosis and OPLL with DCM, and single-level disc disease with loss of lordosis with ASCC. Quantitative measures of cord compression were higher in groups associated with DCM, but similar in patients with single-level disc disease and loss of lordosis.

CONCLUSIONS

This study identified four subgroups based on degenerative pathology requiring further investigation.

Comparative study of encoded and alignment-based methods for virus taxonomy classification

The emergence of viruses and their variants has made virus taxonomy more important than ever before in controlling the spread of diseases. The creation of efficient treatments and cures that target particular virus properties can be aided by understanding virus taxonomy. Alignment-based methods are commonly used for this task, but are computationally expensive and time-consuming, especially when dealing with large datasets or when detecting new virus variants is time sensitive. An alternative approach, the encoded method, has been developed that does not require prior sequence alignment and provides faster results. However, each encoded method has its own claimed accuracy. Therefore, careful evaluation and comparison of the performance of different encoded methods are essential to identify the most accurate and reliable approach for virus taxonomy classification. This study aims to address this issue by providing a comprehensive and comparative analysis of the potential of encoded methods for virus classification and phylogenetics. We compared the vectors generated for each encoded method using distance metrics to determine their similarity to alignment-based methods. The results and their validation show that K-merNV followed by CgrDft encoded methods, perform similarly to state-of-the-art multi-sequence alignment methods. This is the first study to incorporate and compare encoded methods that will facilitate future research in making more informed decisions regarding selection of a suitable method for virus taxonomy.

Metrics for network comparison using egonet feature distributions

Identifying networks with similar characteristics in a given ensemble, or detecting pattern discontinuities in a temporal sequence of networks, are two examples of tasks that require an effective metric capable of quantifying network (dis)similarity. Here we propose a method based on a global portrait of graph properties built by processing local nodes features. More precisely, a set of dissimilarity measures is defined by elaborating the distributions, over the network, of a few egonet features, namely the degree, the clustering coefficient, and the egonet persistence. The method, which does not require the alignment of the two networks being compared, exploits the statistics of the three features to define one- or multi-dimensional distribution functions, which are then compared to define a distance between the networks. The effectiveness of the method is evaluated using a standard classification test, i.e., recognizing the graphs originating from the same synthetic model. Overall, the proposed distances have performances comparable to the best state-of-the-art techniques (graphlet-based methods) with similar computational requirements. Given its simplicity and flexibility, the method is proposed as a viable approach for network comparison tasks.

Comorbidity network analysis using graphical models for electronic health records

Importance

The comorbidity network represents multiple diseases and their relationships in a graph. Understanding comorbidity networks among critical care unit (CCU) patients can help doctors diagnose patients faster, minimize missed diagnoses, and potentially decrease morbidity and mortality.

Objective

The main objective of this study was to identify the comorbidity network among CCU patients using a novel application of a machine learning method (graphical modeling method). The second objective was to compare the machine learning method with a traditional pairwise method in simulation.

Method

This cross-sectional study used CCU patients' data from Medical Information Mart for the Intensive Care-3 (MIMIC-3) dataset, an electronic health record (EHR) of patients with CCU hospitalizations within Beth Israel Deaconess Hospital from 2001 to 2012. A machine learning method (graphical modeling method) was applied to identify the comorbidity network of 654 diagnosis categories among 46,511 patients.

Results

Out of the 654 diagnosis categories, the graphical modeling method identified a comorbidity network of 2,806 associations in 510 diagnosis categories. Two medical professionals reviewed the comorbidity network and confirmed that the associations were consistent with current medical understanding. Moreover, the strongest association in our network was between "poisoning by psychotropic agents" and "accidental poisoning by tranquilizers" (logOR 8.16), and the most connected diagnosis was "disorders of fluid, electrolyte, and acid-base balance" (63 associated diagnosis categories). Our method outperformed traditional pairwise comorbidity network methods in simulation studies. Some strongest associations between diagnosis categories were also identified, for example, "diagnoses of mitral and aortic valve" and "other rheumatic heart disease" (logOR: 5.15). Furthermore, our method identified diagnosis categories that were connected with most other diagnosis categories, for example, "disorders of fluid, electrolyte, and acid-base balance" was associated with 63 other diagnosis categories. Additionally, using a data-driven approach, our method partitioned the diagnosis categories into 14 modularity classes.

Conclusion and relevance

Our graphical modeling method inferred a logical comorbidity network whose associations were consistent with current medical understanding and outperformed traditional network methods in simulation. Our comorbidity network method can potentially assist CCU doctors in diagnosing patients faster and minimizing missed diagnoses.

Comparison of the Strengths and Weaknesses of Machine Learning Algorithms and Feature Selection on KEGG Database Microbial Gene Pathway Annotation and Its Effects on Reconstructed Network Topology

The development of tools for the annotation of genes from newly sequenced species has not evolved much from homologous alignment to prior annotated species. While the quality of gene annotations continues to decline as we sequence and assemble more evolutionary distant gut microbiome species, machine learning presents a high quality alternative to traditional techniques. In this study, we investigate the relative performance of common classical and nonclassical machine learning algorithms in the problem of gene annotation using human microbiome-associated species genes from the KEGG database. The majority of the ensemble, clustering, and deep learning algorithms that we investigated showed higher prediction accuracy than CD-Hit in predicting partial KEGG function. Motif-based, machine-learning methods of annotation in new species were faster and had higher precision-recall than methods of homologous alignment or orthologous gene clustering. Gradient boosted ensemble methods and neural networks also predicted higher connectivity in reconstructed KEGG pathways, finding twice as many new pathway interactions than blast alignment. The use of motif-based, machine-learning algorithms in annotation software will allow researchers to develop powerful tools to interact with bacterial microbiomes in ways previously unachievable through homologous sequence alignment alone.

A perturbation-based approach to identifying potentially superfluous network constituents

Constructing networks from empirical time-series data is often faced with the as yet unsolved issue of how to avoid potentially superfluous network constituents. Such constituents can result, e.g., from spatial and temporal oversampling of the system's dynamics, and neglecting them can lead to severe misinterpretations of network characteristics ranging from global to local scale. We derive a perturbation-based method to identify potentially superfluous network constituents that makes use of vertex and edge centrality concepts. We investigate the suitability of our approach through analyses of weighted small-world, scale-free, random, and complete networks.

Modular architecture and resilience of structural covariance networks in first-episode antipsychotic-naive psychoses

Structural covariance network (SCN) studies on first-episode antipsychotic-naïve psychosis (FEAP) have examined less granular parcellations on one morphometric feature reporting lower network resilience among other findings. We examined SCNs of volume, cortical thickness, and surface area using the Human Connectome Project atlas-based parcellation (n = 358 regions) from 79 FEAP and 68 controls to comprehensively characterize the networks using a descriptive and perturbational network neuroscience approach. Using graph theoretical methods, we examined network integration, segregation, centrality, community structure, and hub distribution across the small-worldness threshold range and correlated them with psychopathology severity. We used simulated nodal "attacks" (removal of nodes and all their edges) to investigate network resilience, calculated DeltaCon similarity scores, and contrasted the removed nodes to characterize the impact of simulated attacks. Compared to controls, FEAP SCN showed higher betweenness centrality (BC) and lower degree in all three morphometric features and disintegrated with fewer attacks with no change in global efficiency. SCNs showed higher similarity score at the first point of disintegration with ≈ 54% top-ranked BC nodes attacked. FEAP communities consisted of fewer prefrontal, auditory and visual regions. Lower BC, and higher clustering and degree, were associated with greater positive and negative symptom severity. Negative symptoms required twice the changes in these metrics. Globally sparse but locally dense network with more nodes of higher centrality in FEAP could result in higher communication cost compared to controls. FEAP network disintegration with fewer attacks suggests lower resilience without impacting efficiency. Greater network disarray underlying negative symptom severity possibly explains the therapeutic challenge.

Models of similarity in complex networks

The analysis of networks describing many social, economic, technological, biological and other systems has attracted a lot of attention last decades. Since most of these complex systems evolve over time, there is a need to investigate the changes, which appear in the system, in order to assess the sustainability of the network and to identify stable periods. In the literature, there have been developed a large number of models that measure the similarity among the networks. There also exist some surveys, which consider a limited number of similarity measures and then perform their correlation analysis, discuss their properties or assess their performances on synthetic benchmarks or real networks. The aim of the article is to extend these studies. The article considers 39 graph distance measures and compares them on simple graphs, random graph models and real networks. The author also evaluates the performance of the models in order to identify which of them can be applied to large networks. The results of the study reveal some important aspects of existing similarity models and provide a better understanding of their advantages and disadvantages. The major finding of the work is that many graph similarity measures of different nature are well correlated and that some comprehensive methods are well agreed with simple models. Such information can be used for the choice of appropriate similarity measure as well as for further development of new models for similarity assessment in network structures.

Shortcomings of reusing species interaction networks created by different sets of researchers

Given the requisite cost associated with observing species interactions, ecologists often reuse species interaction networks created by different sets of researchers to test their hypotheses regarding how ecological processes drive network topology. Yet, topological properties identified across these networks may not be sufficiently attributable to ecological processes alone as often assumed. Instead, much of the totality of topological differences between networks-topological heterogeneity-could be due to variations in research designs and approaches that different researchers use to create each species interaction network. To evaluate the degree to which this topological heterogeneity is present in available ecological networks, we first compared the amount of topological heterogeneity across 723 species interaction networks created by different sets of researchers with the amount quantified from non-ecological networks known to be constructed following more consistent approaches. Then, to further test whether the topological heterogeneity was due to differences in study designs, and not only to inherent variation within ecological networks, we compared the amount of topological heterogeneity between species interaction networks created by the same sets of researchers (i.e., networks from the same publication) with the amount quantified between networks that were each from a unique publication source. We found that species interaction networks are highly topologically heterogeneous: while species interaction networks from the same publication are much more topologically similar to each other than interaction networks that are from a unique publication, they still show at least twice as much heterogeneity as any category of non-ecological networks that we tested. Altogether, our findings suggest that extra care is necessary to effectively analyze species interaction networks created by different researchers, perhaps by controlling for the publication source of each network.

MitoTNT: Mitochondrial Temporal Network Tracking for 4D live-cell fluorescence microscopy data

Mitochondria form a network in the cell that rapidly changes through fission, fusion, and motility. Dysregulation of this four-dimensional (4D: x,y,z,time) network is implicated in numerous diseases ranging from cancer to neurodegeneration. While lattice light-sheet microscopy has recently made it possible to image mitochondria in 4D, quantitative analysis methods for the resulting datasets have been lacking. Here we present MitoTNT, the first-in-class software for Mitochondrial Temporal Network Tracking in 4D live-cell fluorescence microscopy data. MitoTNT uses spatial proximity and network topology to compute an optimal tracking assignment. To validate the accuracy of tracking, we created a reaction-diffusion simulation to model mitochondrial network motion and remodeling events. We found that our tracking is >90% accurate for ground-truth simulations and agrees well with published motility results for experimental data. We used MitoTNT to quantify 4D mitochondrial networks from human induced pluripotent stem cells. First, we characterized sub-fragment motility and analyzed network branch motion patterns. We revealed that the skeleton node motion is correlated along branch nodes and is uncorrelated in time. Second, we identified fission and fusion events with high spatiotemporal resolution. We found that mitochondrial skeleton nodes near the fission/fusion sites move nearly twice as fast as random skeleton nodes and that microtubules play a role in mediating selective fission/fusion. Finally, we developed graph-based transport simulations that model how material would distribute on experimentally measured mitochondrial temporal networks. We showed that pharmacological perturbations increase network reachability but decrease network resilience through a combination of altered mitochondrial fission/fusion dynamics and motility. MitoTNT's easy-to-use tracking module, interactive 4D visualization capability, and powerful post-tracking analyses aim at making temporal network tracking accessible to the wider mitochondria research community.

Generative network modeling reveals quantitative definitions of bilateral symmetry exhibited by a whole insect brain connectome

Comparing connectomes can help explain how neural connectivity is related to genetics, disease, development, learning, and behavior. However, making statistical inferences about the significance and nature of differences between two networks is an open problem, and such analysis has not been extensively applied to nanoscale connectomes. Here, we investigate this problem via a case study on the bilateral symmetry of a larval Drosophila brain connectome. We translate notions of 'bilateral symmetry' to generative models of the network structure of the left and right hemispheres, allowing us to test and refine our understanding of symmetry. We find significant differences in connection probabilities both across the entire left and right networks and between specific cell types. By rescaling connection probabilities or removing certain edges based on weight, we also present adjusted definitions of bilateral symmetry exhibited by this connectome. This work shows how statistical inferences from networks can inform the study of connectomes, facilitating future comparisons of neural structures.

netANOVA: novel graph clustering technique with significance assessment via hierarchical ANOVA

Many problems in life sciences can be brought back to a comparison of graphs. Even though a multitude of such techniques exist, often, these assume prior knowledge about the partitioning or the number of clusters and fail to provide statistical significance of observed between-network heterogeneity. Addressing these issues, we developed an unsupervised workflow to identify groups of graphs from reliable network-based statistics. In particular, we first compute the similarity between networks via appropriate distance measures between graphs and use them in an unsupervised hierarchical algorithm to identify classes of similar networks. Then, to determine the optimal number of clusters, we recursively test for distances between two groups of networks. The test itself finds its inspiration in distance-wise ANOVA algorithms. Finally, we assess significance via the permutation of between-object distance matrices. Notably, the approach, which we will call netANOVA, is flexible since users can choose multiple options to adapt to specific contexts and network types. We demonstrate the benefits and pitfalls of our approach via extensive simulations and an application to two real-life datasets. NetANOVA achieved high performance in many simulation scenarios while controlling type I error. On non-synthetic data, comparison against state-of-the-art methods showed that netANOVA is often among the top performers. There are many application fields, including precision medicine, for which identifying disease subtypes via individual-level biological networks improves prevention programs, diagnosis and disease monitoring.

Graphlet correlation distance to compare small graphs

Graph models are standard for representing mutual relationships between sets of entities. Often, graphs deal with a large number of entities with a small number of connections (e.g. social media relationships, infectious disease spread). The distances or similarities between such large graphs are known to be well established by the Graphlet Correlation Distance (GCD). This paper deals with small graphs (with potentially high densities of connections) that have been somewhat neglected in the literature but that concern important fora like sociology, ecology and fisheries, to mention some examples. First, based on numerical experiments, we study the conditions under which Erdős-Rényi, Fitness Scale-Free, Watts-Strogatz small-world and geometric graphs can be distinguished by a specific GCD measure based on 11 orbits, the GCD11. This is done with respect to the density and the order (i.e. the number of nodes) of the graphs when comparing graphs with the same and different orders. Second, we develop a randomization statistical test based on the GCD11 to compare empirical graphs to the four possible null models used in this analysis and apply it to a fishing case study where graphs represent pairwise proximity between fishing vessels. The statistical test rules out independent pairing within the fleet studied which is a standard assumption in fisheries. It also illustrates the difficulty to identify similarities between real-world small graphs and graph models.

Connectome topology of mammalian brains and its relationship to taxonomy and phylogeny

Network models of anatomical connections allow for the extraction of quantitative features describing brain organization, and their comparison across brains from different species. Such comparisons can inform our understanding of between-species differences in brain architecture and can be compared to existing taxonomies and phylogenies. Here we performed a quantitative comparative analysis using the MaMI database (Tel Aviv University), a collection of brain networks reconstructed from ex vivo diffusion MRI spanning 125 species and 12 taxonomic orders or superorders. We used a broad range of metrics to measure between-mammal distances and compare these estimates to the separation of species as derived from taxonomy and phylogeny. We found that within-taxonomy order network distances are significantly closer than between-taxonomy network distances, and this relation holds for several measures of network distance. Furthermore, to estimate the evolutionary divergence between species, we obtained phylogenetic distances across 10,000 plausible phylogenetic trees. The anatomical network distances were rank-correlated with phylogenetic distances 10,000 times, creating a distribution of coefficients that demonstrate significantly positive correlations between network and phylogenetic distances. Collectively, these analyses demonstrate species-level organization across scales and informational sources: we relate brain networks distances, derived from MRI, with evolutionary distances, derived from genotyping data.

Generating mobility networks with generative adversarial networks

The increasingly crucial role of human displacements in complex societal phenomena, such as traffic congestion, segregation, and the diffusion of epidemics, is attracting the interest of scientists from several disciplines. In this article, we address mobility network generation, i.e., generating a city's entire mobility network, a weighted directed graph in which nodes are geographic locations and weighted edges represent people's movements between those locations, thus describing the entire mobility set flows within a city. Our solution is MoGAN, a model based on Generative Adversarial Networks (GANs) to generate realistic mobility networks. We conduct extensive experiments on public datasets of bike and taxi rides to show that MoGAN outperforms the classical Gravity and Radiation models regarding the realism of the generated networks. Our model can be used for data augmentation and performing simulations and what-if analysis.

Functional Connectome of the Human Brain with Total Correlation

Recent studies proposed the use of Total Correlation to describe functional connectivity among brain regions as a multivariate alternative to conventional pairwise measures such as correlation or mutual information. In this work, we build on this idea to infer a large-scale (whole-brain) connectivity network based on Total Correlation and show the possibility of using this kind of network as biomarkers of brain alterations. In particular, this work uses Correlation Explanation (CorEx) to estimate Total Correlation. First, we prove that CorEx estimates of Total Correlation and clustering results are trustable compared to ground truth values. Second, the inferred large-scale connectivity network extracted from the more extensive open fMRI datasets is consistent with existing neuroscience studies, but, interestingly, can estimate additional relations beyond pairwise regions. And finally, we show how the connectivity graphs based on Total Correlation can also be an effective tool to aid in the discovery of brain diseases.

Ensembles of realistic power distribution networks

The power grid is going through significant changes with the introduction of renewable energy sources and the incorporation of smart grid technologies. These rapid advancements necessitate new models and analyses to keep up with the various emergent phenomena they induce. A major prerequisite of such work is the acquisition of well-constructed and accurate network datasets for the power grid infrastructure. In this paper, we propose a robust, scalable framework to synthesize power distribution networks that resemble their physical counterparts for a given region. We use openly available information about interdependent road and building infrastructures to construct the networks. In contrast to prior work based on network statistics, we incorporate engineering and economic constraints to create the networks. Additionally, we provide a framework to create ensembles of power distribution networks to generate multiple possible instances of the network for a given region. The comprehensive dataset consists of nodes with attributes, such as geocoordinates; type of node (residence, transformer, or substation); and edges with attributes, such as geometry, type of line (feeder lines, primary or secondary), and line parameters. For validation, we provide detailed comparisons of the generated networks with actual distribution networks. The generated datasets represent realistic test systems (as compared with standard test cases published by Institute of Electrical and Electronics Engineers (IEEE)) that can be used by network scientists to analyze complex events in power grids and to perform detailed sensitivity and statistical analyses over ensembles of networks.

Network Comparison with Interpretable Contrastive Network Representation Learning

Identifying unique characteristics in a network through comparison with another network is an essential network analysis task. For example, with networks of protein interactions obtained from normal and cancer tissues, we can discover unique types of interactions in cancer tissues. This analysis task could be greatly assisted by contrastive learning, which is an emerging analysis approach to discover salient patterns in one dataset relative to another. However, existing contrastive learning methods cannot be directly applied to networks as they are designed only for high-dimensional data analysis. To address this problem, we introduce a new analysis approach called contrastive network representation learning (cNRL). By integrating two machine learning schemes, network representation learning and contrastive learning, cNRL enables embedding of network nodes into a low-dimensional representation that reveals the uniqueness of one network compared to another. Within this approach, we also design a method, named i-cNRL, which offers interpretability in the learned results, allowing for understanding which specific patterns are only found in one network. We demonstrate the effectiveness of i-cNRL for network comparison with multiple network models and real-world datasets. Furthermore, we compare i-cNRL and other potential cNRL algorithm designs through quantitative and qualitative evaluations.

Graph Properties of Mass-Difference Networks for Profiling and Discrimination in Untargeted Metabolomics

Untargeted metabolomics seeks to identify and quantify most metabolites in a biological system. In general, metabolomics results are represented by numerical matrices containing data that represent the intensities of the detected variables. These matrices are subsequently analyzed by methods that seek to extract significant biological information from the data. In mass spectrometry-based metabolomics, if mass is detected with sufficient accuracy, below 1 ppm, it is possible to derive mass-difference networks, which have spectral features as nodes and chemical changes as edges. These networks have previously been used as means to assist formula annotation and to rank the importance of chemical transformations. In this work, we propose a novel role for such networks in untargeted metabolomics data analysis: we demonstrate that their properties as graphs can also be used as signatures for metabolic profiling and class discrimination. For several benchmark examples, we computed six graph properties and we found that the degree profile was consistently the property that allowed for the best performance of several clustering and classification methods, reaching levels that are competitive with the performance using intensity data matrices and traditional pretreatment procedures. Furthermore, we propose two new metrics for the ranking of chemical transformations derived from network properties, which can be applied to sample comparison or clustering. These metrics illustrate how the graph properties of mass-difference networks can highlight the aspects of the information contained in data that are complementary to the information extracted from intensity-based data analysis.

A Mean-Field Game Control for Large-Scale Swarm Formation Flight in Dense Environments

As an important part of cyberphysical systems (CPSs), multiple aerial drone systems are widely used in various scenarios, and research scenarios are becoming increasingly complex. However, planning strategies for the formation flying of aerial swarms in dense environments typically lack the capability of large-scale breakthrough because the amount of communication and computation required for swarm control grows exponentially with scale. To address this deficiency, we present a mean-field game (MFG) control-based method that ensures collision-free trajectory generation for the formation flight of a large-scale swarm. In this paper, two types of differentiable mean-field terms are proposed to quantify the overall similarity distance between large-scale 3-D formations and the potential energy value of dense 3-D obstacles, respectively. We then formulate these two terms into a mean-field game control framework, which minimizes energy cost, formation similarity error, and collision penalty under the dynamical constraints, so as to achieve spatiotemporal planning for the desired trajectory. The classical task of a distributed large-scale aerial swarm system is simulated by numerical examples, and the feasibility and effectiveness of our method are verified and analyzed. The comparison with baseline methods shows the advanced nature of our method.

Abundance, diversity, and host assignment of total, intracellular, and extracellular antibiotic resistance genes in riverbed sediments

Human health risk assessment for environmental antibiotic resistant microbes requires not only quantifying the abundance of antibiotic resistance genes (ARGs) in environmental matrices, but also understanding their hosts and genetic context. Further, differentiating ARGs in intracellular and extracellular DNA (iDNA and eDNA) fractions may help refine our understanding of ARG transferability. The objectives of this study were to understand the (O1) abundance and diversity of extracellular, intracellular, and total ARGs along a land use gradient and (O2) impact of bioinformatics pipeline on the assignment of putative hosts for the ARGs observed in the different DNA fractions. Sediment samples were collected along a land use gradient in the Raritan River, New Jersey, USA. DNA was extracted to separate eDNA and iDNA and qPCR was performed for select ARGs and the 16S rRNA gene. Shotgun metagenomic sequencing was performed on DNA extracts for the different DNA fractions. ARG hosts were assigned via two different bioinformatic pipelines: network analysis of raw reads versus assembly. Results of the two pipelines were compared to evaluate their performance in terms of number and diversity of linkages and accuracy of in silico matrix spike host assignments. No differences were observed in the 16S rRNA gene normalized sul1 concentrations between the DNA fractions. The overall microbial community structure was more similar for iDNA and total DNA compared to eDNA and generally clustered by sampling site. ARGs associated with mobile genetic elements increased in iDNA for the downstream sites. Regarding host assignment, the raw reads pipeline via network analysis identified 247 ARG hosts as compared to 53 hosts identified by assembly pipeline. Other comparisons between the pipelines were made including ARG assignment to taxa containing waterborne pathogens and practical considerations regarding processing time.

Within-person Relations between Domains of Socio-emotional Development during Childhood and Adolescence

Adolescence is a critical period in the development of mental health with nearly 1 in 5 adolescents suffering from mental health problems and more than 40 percent of these experiencing at least one co-occurring mental health disorder. This study investigates whether there are differences in the relations between key dimensions of child and adolescent mental health in adolescence compared to childhood. Mental health and related socio-emotional traits were measured longitudinally at ages 4, 7, 8, 9, 11, 13, and 16 in the Avon Longitudinal Study of Parents and Children (N = 11279) using the Strengths and Difficulties Questionnaires. Graphical Vector Autoregression models were used to analyse the temporal within-person relations between conduct problems, emotional problems, hyperactivity/inattention, peer problems and prosociality across childhood (ages 4 to 9) and adolescence (11 to 16). Results suggest that adolescence is characterised by an increase in the number and strength of temporal relations between socio-emotional difficulties. In particular, in adolescence there were bidirectional connections between peer problems and emotional problems, between conduct problems and hyperactivity/inattention and between prosociality and conduct problems as well as hyperactivity/inattention. In childhood, conduct problems and prosociality were reciprocally related. Results also suggested peer problems as a potential mediating factor between conduct and emotional problems in childhood. Overall, this study suggests that different domains of socio-emotional development influence each other over development. Adolescence is characterised by an increase in temporal connections, which may be one factor underlying the increased vulnerability to the onset of mental health problems during that period.

Network subgraph-based approach for analyzing and comparing molecular networks

Molecular networks are built up from genetic elements that exhibit feedback interactions. Here, we studied the problem of measuring the similarity of directed networks by proposing a novel alignment-free approach: the network subgraph-based approach. Our approach does not make use of randomized networks to determine modular patterns embedded in a network, and this method differs from the network motif and graphlet methods. Network similarity was quantified by gauging the difference between the subgraph frequency distributions of two networks using Jensen-Shannon entropy. We applied the subgraph approach to study three types of molecular networks, i.e., cancer networks, signal transduction networks, and cellular process networks, which exhibit diverse molecular functions. We compared the performance of our subgraph detection algorithm with other algorithms, and the results were consistent, but other algorithms could not address the issue of subgraphs/motifs embedded within a subgraph/motif. To evaluate the effectiveness of the subgraph-based method, we applied the method along with the Jensen-Shannon entropy to classify six network models, and it achieves a 100% accuracy of classification. The proposed information-theoretic approach allows us to determine the structural similarity of two networks regardless of node identity and network size. We demonstrated the effectiveness of the subgraph approach to cluster molecular networks that exhibit similar regulatory interaction topologies. As an illustration, our method can identify (i) common subgraph-mediated signal transduction and/or cellular processes in AML and pancreatic cancer, and (ii) scaffold proteins in gastric cancer and hepatocellular carcinoma; thus, the results suggested that there are common regulation modules for cancer formation. We also found that the underlying substructures of the molecular networks are dominated by irreducible subgraphs; this feature is valid for the three classes of molecular networks we studied. The subgraph-based approach provides a systematic scenario for analyzing, compare and classifying molecular networks with diverse functionalities.

Mathematical models to study the biology of pathogens and the infectious diseases they cause

Mathematical models have many applications in infectious diseases: epidemiologists use them to forecast outbreaks and design containment strategies; systems biologists use them to study complex processes sustaining pathogens, from the metabolic networks empowering microbial cells to ecological networks in the microbiome that protects its host. Here, we (1) review important models relevant to infectious diseases, (2) draw parallels among models ranging widely in scale. We end by discussing a minimal set of information for a model to promote its use by others and to enable predictions that help us better fight pathogens and the diseases they cause.

Sustainable development goals: conceptualization, communication and achievement synergies in a complex network framework

In this work we use a network-based approach to investigate the complex system of interactions among the 17 Sustainable Development Goals (SDGs), that constitute the structure of the United Nations 2030 Agenda for a sustainable future. We construct a three-layer multiplex, in which SDGs represent nodes, and their connections in each layer are determined by similarity definitions based on conceptualization, communication, and achievement, respectively. In each layer of the multiplex, we investigate the presence of nodes with high centrality, corresponding to strategic SDGs. We then compare the networks to establish whether and to which extent similar patterns emerge. Interestingly, we observe a significant relation between the SDG similarity patterns determined by their achievement and their communication and perception, revealed by social network data. The proposed framework represents an instrument to unveil new and nontrivial aspects of sustainability, laying the foundation of a decision support system to define and implement SDG achievement strategies.

Comparative Agent-Based Simulations on Levels of Multiplicity Using a Network Regression: A Mobile Dating Use-Case

We demonstrate the use of agent-based models to simulate the interactions of two mobile dating applications that possess divergent interaction features. We reproduce several expected outcomes when compared to extant literature. We also demonstrate the use of a standard social network analysis technique—the network regression, Multiple Regression Quadratic Assignment Procedure—in conducting a principled and interpretable comparison between the two models with strong results. This combined approach is novel and allows complex system modelers who utilize agent-based models to reduce their reliance on idealized network structures (small world, scale-free, erdos-renyi) when applying underlying network interactions to agent-based models that can often skew results and mislead from a full picture of system-level properties. This work serves as a proof-of-concept in the integration of classical social network analysis methods and contemporary agent-based modeling to compare software designs and to enhance the policy-generation process of online social networks.

Complex networks analysis reinforces centrality hematological role on aerobic-anaerobic performances of the Brazilian Paralympic endurance team after altitude training

This study investigated the 30-days altitude training (2500 m, LHTH-live and training high) on hematological responses and aerobic–anaerobic performances parameters of high-level Paralympic athletes. Aerobic capacity was assessed by 3000 m run, and anaerobic variables (velocity, force and mechanical power) by a maximal 30-s semi-tethered running test (AO30). These assessments were carried out at low altitude before (PRE) and after LHTH (5–6 and 15–16 days, POST1 and POST2, respectively). During LHTH, hematological analyzes were performed on days 1, 12, 20 and 30. After LHTH, aerobic performance decreased 1.7% in POST1, but showed an amazing increase in POST2 (15.4 s reduction in the 3000 m test, 2.8%). Regarding anaerobic parameters, athletes showed a reduction in velocity, force and power in POST1, but velocity and power returned to their initial conditions in POST2. In addition, all participants had higher hemoglobin (Hb) values at the end of LHTH (30 days), but at POST2 these results were close to those of PRE. The centrality metrics obtained by complex networks (pondered degree, pagerank and betweenness) in the PRE and POST2 scenarios highlighted hemoglobin, hematocrit (Hct) and minimum force, velocity and power, suggesting these variables on the way to increasing endurance performance. The Jaccard’s distance metrics showed dissimilarity between the PRE and POST2 graphs, and Hb and Hct as more prominent nodes for all centrality metrics. These results indicate that adaptive process from LHTH was highlighted by the complex networks, which can help understanding the better aerobic performance at low altitude after 16 days in Paralympic athletes.

The COVID-19 Infection Diffusion in the US and Japan: A Graph-Theoretical Approach

Simple Summary

In this study, we conducted a quantitative assessment and compared the COVID-19 pandemic spread in two countries based on selected methods from the graph theory domain. The results indicate that while the applied experimental procedures are useful, we could draw limited conclusions about the dynamic nature of infection diffusion. We discussed the possible reasons for the above and used them to formulate research hypotheses that could serve the scientific community in future research efforts.

Abstract

Coronavirus disease 2019 (COVID-19) was first discovered in China; within several months, it spread worldwide and became a pandemic. Although the virus has spread throughout the globe, its effects have differed. The pandemic diffusion network dynamics (PDND) approach was proposed to better understand the spreading behavior of COVID-19 in the US and Japan. We used daily confirmed cases of COVID-19 from 5 January 2020 to 31 July 2021, for all states (prefectures) of the US and Japan. By applying the pandemic diffusion network dynamics (PDND) approach to COVID-19 time series data, we developed diffusion graphs for the US and Japan. In these graphs, nodes represent states and prefectures (regions), and edges represent connections between regions based on the synchrony of COVID-19 time series data. To compare the pandemic spreading dynamics in the US and Japan, we used graph theory metrics, which targeted the characterization of COVID-19 bedhavior that could not be explained through linear methods. These metrics included path length, global and local efficiency, clustering coefficient, assortativity, modularity, network density, and degree centrality. Application of the proposed approach resulted in the discovery of mostly minor differences between analyzed countries. In light of these findings, we focused on analyzing the reasons and defining research hypotheses that, upon addressing, could shed more light on the complex phenomena of COVID-19 virus spread and the proposed PDND methodology.

Differential Network Testing Reveals Diverging Dynamics of Organ System Interactions for Survivors and Non-survivors in Intensive Care Medicine

Statistical network analyses have become popular in many scientific disciplines, where an important task is to test for differences between two networks. We describe an overall framework for differential network testing procedures that vary regarding (1) the network estimation method, typically based on specific concepts of association, and (2) the network characteristic employed to measure the difference. Using permutation-based tests, our approach is general and applicable to various overall, node-specific or edge-specific network difference characteristics. The methods are implemented in our freely available R software package DNT, along with an R Shiny application. In a study in intensive care medicine, we compare networks based on parameters representing main organ systems to evaluate the prognosis of critically ill patients in the intensive care unit (ICU), using data from the surgical ICU of the University Medical Centre Mannheim, Germany. We specifically consider both cross-sectional comparisons between a non-survivor and a survivor group and longitudinal comparisons at two clinically relevant time points during the ICU stay: first, at admission, and second, at an event stage prior to death in non-survivors or a matching time point in survivors. The non-survivor and the survivor networks do not significantly differ at the admission stage. However, the organ system interactions of the survivors then stabilize at the event stage, revealing significantly more network edges, whereas those of the non-survivors do not. In particular, the liver appears to play a central role for the observed increased connectivity in the survivor network at the event stage.

Improving Analysis and Annotation of Microarray Data with Protein Interactions

Gene expression microarrays are one of the most widely used high-throughput technologies in molecular biology, with applications such as identification of disease mechanisms and development of diagnostic and prognostic gene signatures. However, the success of these tasks is often limited because microarray analysis does not account for the complex relationships among genes, their products, and overall signaling and regulatory cascades. Incorporating protein-protein interaction data into microarray analysis can help address these challenges. This chapter reviews how protein-protein interactions can help with microarray analysis, leading to benefits such as better explanations of disease mechanisms, more complete gene annotations, improved prioritization of genes for future experiments, and gene signatures that generalize better to new data.

Do social identity and cognitive diversity correlate in environmental stakeholders? A novel approach to measuring cognitive distance within and between groups

Groups with higher cognitive diversity, i.e. variations in how people think and solve problems, are thought to contribute to improved performance in complex problem-solving. However, embracing or even engineering adequate cognitive diversity is not straightforward and may even jeopardize social inclusion. In response, those that want to promote cognitive diversity might make a simplified assumption that there exists a link between identity diversity, i.e. range of social characteristics, and variations in how people perceive and solve problems. If this assumption holds true, incorporating diverse identities may concurrently achieve cognitive diversity to the extent essential for complex problem-solving, while social inclusion is explicitly acknowledged. However, currently there is a lack of empirical evidence to support this hypothesis in the context of complex social-ecological systems-a system wherein human and environmental dimensions are interdependent, where common-pool resources are used or managed by multiple types of stakeholders. Using a fisheries example, we examine the relationship between resource stakeholders' identities and their cognitive diversity. We used cognitive mapping techniques in conjunction with network analysis to measure cognitive distances within and between stakeholders of various social types (i.e., identities). Our results empirically show that groups with higher identity diversity also demonstrate more cognitive diversity, evidenced by disparate characteristics of their cognitive maps that represent their understanding of fishery dynamics. These findings have important implications for sustainable management of common-pool resources, where the inclusion of diverse stakeholders is routine, while our study shows it may also achieve higher cognitive coverage that can potentially lead to more complete, accurate, and innovative understanding of complex resource dynamics.

Assessing information-sharing networks within small-scale fisheries and the implications for conservation interventions

The effectiveness of behavioural interventions in conservation often depends on local resource users' underlying social interactions. However, it remains unclear to what extent differences in related topics of information shared between resource users can alter network structure-holding implications for information flows and the spread of behaviours. Here, we explore the differences in nine subtopics of fishing information related to the planned expansion of a community co-management scheme aiming to reduce sea turtle bycatch at a small-scale fishery in Peru. We show that the general network structure detailing information sharing about sea turtle bycatch is dissimilar from other fishing information sharing. Specifically, no significant degree assortativity (degree homophily) was identified, and the variance in node eccentricity was lower than expected under our null models. We also demonstrate that patterns of information sharing between fishers related to sea turtle bycatch are more similar to information sharing about fishing regulations, and vessel technology and maintenance, than to information sharing about weather, fishing activity, finances and crew management. Our findings highlight the importance of assessing information-sharing networks in contexts directly relevant to the desired intervention and demonstrate the identification of social contexts that might be more or less appropriate for information sharing related to planned conservation actions.

Symptom networks in major depression do not diverge across sex, familial risk, and environmental risk

BACKGROUND

Major depression (MD) is a heterogeneous disorder in terms of its symptoms. Symptoms vary by presence of risk factors such as female sex, familial risk, and environmental adversity. However, it is unclear if these factors also influence interactions between symptoms. This study investigates if symptom networks diverge across sex, familial risk, and adversity.

METHODS

We included 9713 subjects from the general population who reported a lifetime episode of MD based on DSM-IV criteria. The survey assessed a wide set of symptoms, both from within the DSM criteria as well as other symptoms commonly experienced in MD. We compared symptom endorsement rates across sex, age at onset, family history and environmental adversity. We used the Network Comparison Test to test for symptom network differences across risk factors.

RESULTS

We found differences in symptom endorsement between groups. For instance, participants with an early onset of MD reported suicidal ideation nearly twice as often compared to participants with a later onset. We did not find any robust differences in symptom networks, which suggests that symptom networks do not diverge across sex, familial risk, and adversity.

LIMITATIONS

We estimated symptom networks of individuals during their worst lifetime episode of MD. Network differences might exist in a prodromal stage, while disappearing in full-blown MD (equifinality). Furthermore, as we used retrospective reports, results could be prone to recall bias.

CONCLUSIONS

Despite MD's heterogeneous symptomatology, interactions between symptoms are stable across risk factors and sex.