Multiscale Community Structure Research Articles

Influential factors of intercity patient mobility and its network structure in China

Intercity patient mobility reflects the geographic mismatch between healthcare resources and the population, and has rarely been studied with big data at large spatial scales. In this paper, we investigated the patterns of intercity patient mobility and factors influencing this behavior based on >4 million hospitalization records of patients with chronic kidney disease in China. To provide practical policy recommendations, a role identification framework informed by complex network theory was proposed considering the strength and distribution of connections of cities in mobility networks. Such a mobility network features multiscale community structure with “universal administrative constraints and a few boundary breaches”. We discovered that cross-module visits which accounted for only 20 % of total visits, accounted for >50 % of the total travel distance. The explainable machine learning modeling results revealed that distance has a power-law-like effect on flow volume, and high-quality healthcare resources are an important driving factor. This paper provides not only a methodological reference for patient mobility studies but also valuable insights into public health policies. • More than 4 million multi-year mobility records from a national database were investigated. • The distribution of travel distance of patients differs from the results of general human mobility studies. • The network features multiscale community structure with “universal administrative constraints and a few boundary breaches”. • An identification framework was proposed to understand cities’ roles in the mobility network. • The explainable AI model revealed that distance and high-quality healthcare resources are two critical factors.

The architecture of co-morbidity networks of physical and mental health conditions in military veterans.

Co-morbidity between medical and psychiatric conditions is commonly considered between individual pairs of conditions. However, an important alternative is to consider all conditions as part of a co-morbidity network, which encompasses all interactions between patients and a healthcare system. Analysis of co-morbidity networks could detect and quantify general tendencies not observed by smaller-scale studies. Here, we investigate the co-morbidity network derived from longitudinal healthcare records from approximately 1 million United States military veterans, a population disproportionately impacted by psychiatric morbidity and psychological trauma. Network analyses revealed marked and heterogenous patterns of co-morbidity, including a multi-scale community structure composed of groups of commonly co-morbid conditions. Psychiatric conditions including posttraumatic stress disorder were strong predictors of future medical morbidity. Neurological conditions and conditions associated with chronic pain were particularly highly co-morbid with psychiatric conditions. Across conditions, the degree of co-morbidity was positively associated with mortality. Co-morbidity was modified by biological sex and could be used to predict future diagnostic status, with out-of-sample prediction accuracy of 90-92%. Understanding complex patterns of disease co-morbidity has the potential to lead to improved designs of systems of care and the development of targeted interventions that consider the broader context of mental and physical health.

Network topology of the marmoset connectome.

The brain is a complex network of interconnected and interacting neuronal populations. Global efforts to understand the emergence of behavior and the effect of perturbations depend on accurate reconstruction of white matter pathways, both in humans and in model organisms. An emerging animal model for next-generation applied neuroscience is the common marmoset (Callithrix jacchus). A recent open respository of retrograde and anterograde tract tracing presents an opportunity to systematically study the network architecture of the marmoset brain (Marmoset Brain Architecture Project; http://www.marmosetbrain.org). Here we comprehensively chart the topological organization of the mesoscale marmoset cortico-cortical connectome. The network possesses multiple nonrandom attributes that promote a balance between segregation and integration, including near-minimal path length, multiscale community structure, a connective core, a unique motif composition, and multiple cavities. Altogether, these structural attributes suggest a link between network architecture and function. Our findings are consistent with previous reports across a range of species, scales, and reconstruction technologies, suggesting a small set of organizational principles universal across phylogeny. Collectively, these results provide a foundation for future anatomical, functional, and behavioral studies in this model organism.

From free text to clusters of content in health records: an unsupervised graph partitioning approach

Electronic healthcare records contain large volumes of unstructured data in different forms. Free text constitutes a large portion of such data, yet this source of richly detailed information often remains under-used in practice because of a lack of suitable methodologies to extract interpretable content in a timely manner. Here we apply network-theoretical tools to the analysis of free text in Hospital Patient Incident reports in the English National Health Service, to find clusters of reports in an unsupervised manner and at different levels of resolution based directly on the free text descriptions contained within them. To do so, we combine recently developed deep neural network text-embedding methodologies based on paragraph vectors with multi-scale Markov Stability community detection applied to a similarity graph of documents obtained from sparsified text vector similarities. We showcase the approach with the analysis of incident reports submitted in Imperial College Healthcare NHS Trust, London. The multiscale community structure reveals levels of meaning with different resolution in the topics of the dataset, as shown by relevant descriptive terms extracted from the groups of records, as well as by comparing a posteriori against hand-coded categories assigned by healthcare personnel. Our content communities exhibit good correspondence with well-defined hand-coded categories, yet our results also provide further medical detail in certain areas as well as revealing complementary descriptors of incidents beyond the external classification. We also discuss how the method can be used to monitor reports over time and across different healthcare providers, and to detect emerging trends that fall outside of pre-existing categories.

Inter-subject FDG PET Brain Networks Exhibit Multi-scale Community Structure with Different Normalization Techniques.

Inter-subject networks are used to model correlations between brain regions and are particularly useful for metabolic imaging techniques, like 18F-2-deoxy-2-(18F)fluoro-D-glucose (FDG) positron emission tomography (PET). Since FDG PET typically produces a single image, correlations cannot be calculated over time. Little focus has been placed on the basic properties of inter-subject networks and if they are affected by group size and image normalization. FDG PET images were acquired from rats (n = 18), normalized by whole brain, visual cortex, or cerebellar FDG uptake, and used to construct correlation matrices. Group size effects on network stability were investigated by systematically adding rats and evaluating local network connectivity (node strength and clustering coefficient). Modularity and community structure were also evaluated in the differently normalized networks to assess meso-scale network relationships. Local network properties are stable regardless of normalization region for groups of at least 10. Whole brain-normalized networks are more modular than visual cortex- or cerebellum-normalized network (p < 0.00001); however, community structure is similar at network resolutions where modularity differs most between brain and randomized networks. Hierarchical analysis reveals consistent modules at different scales and clustering of spatially-proximate brain regions. Findings suggest inter-subject FDG PET networks are stable for reasonable group sizes and exhibit multi-scale modularity.

Improving resolution of dynamic communities in human brain networks through targeted node removal.

Current approaches to dynamic community detection in complex networks can fail to identify multi-scale community structure, or to resolve key features of community dynamics. We propose a targeted node removal technique to improve the resolution of community detection. Using synthetic oscillator networks with well-defined “ground truth” communities, we quantify the community detection performance of a common modularity maximization algorithm. We show that the performance of the algorithm on communities of a given size deteriorates when these communities are embedded in multi-scale networks with communities of different sizes, compared to the performance in a single-scale network. We demonstrate that targeted node removal during community detection improves performance on multi-scale networks, particularly when removing the most functionally cohesive nodes. Applying this approach to network neuroscience, we compare dynamic functional brain networks derived from fMRI data taken during both repetitive single-task and varied multi-task experiments. After the removal of regions in visual cortex, the most coherent functional brain area during the tasks, community detection is better able to resolve known functional brain systems into communities. In addition, node removal enables the algorithm to distinguish clear differences in brain network dynamics between these experiments, revealing task-switching behavior that was not identified with the visual regions present in the network. These results indicate that targeted node removal can improve spatial and temporal resolution in community detection, and they demonstrate a promising approach for comparison of network dynamics between neuroscientific data sets with different resolution parameters.

Detecting Multi-Scale Community Structure in Complex Networks

Multiple-scale community of complex networks has attracted much attention. For the problem, previous methods can not investigate multiple-scale property of community. To address this, we propose a novel algorithm (h_LPA) to detect multiple-scale structure of community. The algorithm is a heuristic label propagation algorithm associated with spectral analysis of complex networks. Label updating strategy of h_LPA is combined with heuristic function from the perspective of networks dynamics. The heuristic function further improves the dynamic efficiency of h_LPA. Extensive tests on artificial networks and real world networks give excellent results.

Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks

Most methods proposed to uncover communities in complex networks rely on combinatorial graph properties. Usually an edge-counting quality function, such as modularity, is optimized over all partitions of the graph compared against a null random graph model. Here we introduce a systematic dynamical framework to design and analyze a wide variety of quality functions for community detection. The quality of a partition is measured by its Markov Stability, a time-parametrized function defined in terms of the statistical properties of a Markov process taking place on the graph. The Markov process provides a dynamical sweeping across all scales in the graph, and the time scale is an intrinsic parameter that uncovers communities at different resolutions. This dynamic-based community detection leads to a compound optimization, which favours communities of comparable centrality (as defined by the stationary distribution), and provides a unifying framework for spectral algorithms, as well as different heuristics for community detection, including versions of modularity and Potts model. Our dynamic framework creates a systematic link between different stochastic dynamics and their corresponding notions of optimal communities under distinct (node and edge) centralities. We show that the Markov Stability can be computed efficiently to find multi-scale community structure in large networks.

Bootstrapping on undirected binary networks via statistical mechanics.

We propose a new method inspired from statistical mechanics for extracting geometric information from undirected binary networks and generating random networks that conform to this geometry. In this method an undirected binary network is perceived as a thermodynamic system with a collection of permuted adjacency matrices as its states. The task of extracting information from the network is then reformulated as a discrete combinatorial optimization problem of searching for its ground state. To solve this problem, we apply multiple ensembles of temperature regulated Markov chains to establish an ultrametric geometry on the network. This geometry is equipped with a tree hierarchy that captures the multiscale community structure of the network. We translate this geometry into a Parisi adjacency matrix, which has a relative low energy level and is in the vicinity of the ground state. The Parisi adjacency matrix is then further optimized by making block permutations subject to the ultrametric geometry. The optimal matrix corresponds to the macrostate of the original network. An ensemble of random networks is then generated such that each of these networks conforms to this macrostate; the corresponding algorithm also provides an estimate of the size of this ensemble. By repeating this procedure at different scales of the ultrametric geometry of the network, it is possible to compute its evolution entropy, i.e. to estimate the evolution of its complexity as we move from a coarse to a ne description of its geometric structure. We demonstrate the performance of this method on simulated as well as real data networks.

Multi-scale community organization of the human structural connectome and its relationship with resting-state functional connectivity

AbstractThe human connectome has been widely studied over the past decade. A principal finding is that it can be decomposed into communities of densely interconnected brain regions. Past studies have often used single-scale modularity measures in order to infer the connectome's community structure, possibly overlooking interesting structure at other organizational scales. In this report, we used the partition stability framework, which defines communities in terms of a Markov process (random walk), to infer the connectome's multi-scale community structure. Comparing the community structure to observed resting-state functional connectivity revealed communities across a broad range of scales that were closely related to functional connectivity. This result suggests a mapping between communities in structural networks, models of influence-spreading and diffusion, and brain function. It further suggests that the spread of influence among brain regions may not be limited to a single characteristic scale.

A Dimensionality Reduction Framework for Detection of Multiscale Structure in Heterogeneous Networks

Graph clustering has been widely applied in exploring regularities emerging in relational data. Recently, the rapid development of network theory correlates graph clustering with the detection of community structure, a common and important topological characteristic of networks. Most existing methods investigate the community structure at a single topological scale. However, as shown by empirical studies, the community structure of real world networks often exhibits multiple topological descriptions, corresponding to the clustering at different resolutions. Furthermore, the detection of multiscale community structure is heavily affected by the heterogeneous distribution of node degree. It is very challenging to detect multiscale community structure in heterogeneous networks. In this paper, we propose a novel, unified framework for detecting community structure from the perspective of dimensionality reduction. Based on the framework, we first prove that the well-known Laplacian matrix for network partition and the widely-used modularity matrix for community detection are two kinds of covariance matrices used in dimensionality reduction. We then propose a novel method to detect communities at multiple topological scales within our framework. We further show that existing algorithms fail to deal with heterogeneous node degrees. We develop a novel method to handle heterogeneity of networks by introducing a rescaling transformation into the covariance matrices in our framework. Extensive tests on real world and artificial networks demonstrate that the proposed correlation matrices significantly outperform Laplacian and modularity matrices in terms of their ability to identify multiscale community structure in heterogeneous networks.

Covariance, correlation matrix, and the multiscale community structure of networks

Empirical studies show that real world networks often exhibit multiple scales of topological descriptions. However, it is still an open problem how to identify the intrinsic multiple scales of networks. In this paper, we consider detecting the multiscale community structure of network from the perspective of dimension reduction. According to this perspective, a covariance matrix of network is defined to uncover the multiscale community structure through the translation and rotation transformations. It is proved that the covariance matrix is the unbiased version of the well-known modularity matrix. We then point out that the translation and rotation transformations fail to deal with the heterogeneous network, which is very common in nature and society. To address this problem, a correlation matrix is proposed through introducing the rescaling transformation into the covariance matrix. Extensive tests on real world and artificial networks demonstrate that the correlation matrix significantly outperforms the covariance matrix, identically the modularity matrix, as regards identifying the multiscale community structure of network. This work provides a novel perspective to the identification of community structure and thus various dimension reduction methods might be used for the identification of community structure. Through introducing the correlation matrix, we further conclude that the rescaling transformation is crucial to identify the multiscale community structure of network, as well as the translation and rotation transformations.