33 research outputs found

    Ranking Edges by their Impact on the Spectral Complexity of Information Diffusion over Networks

    Full text link
    Despite the numerous ways now available to quantify which parts or subsystems of a network are most important, there remains a lack of centrality measures that are related to the complexity of information flows and are derived directly from entropy measures. Here, we introduce a ranking of edges based on how each edge's removal would change a system's von Neumann entropy (VNE), which is a spectral-entropy measure that has been adapted from quantum information theory to quantify the complexity of information dynamics over networks. We show that a direct calculation of such rankings is computationally inefficient (or unfeasible) for large networks: e.g.\ the scaling is O(N3)\mathcal{O}(N^3) per edge for networks with NN nodes. To overcome this limitation, we employ spectral perturbation theory to estimate VNE perturbations and derive an approximate edge-ranking algorithm that is accurate and fast to compute, scaling as O(N)\mathcal{O}(N) per edge. Focusing on a form of VNE that is associated with a transport operator e−βLe^{-\beta{ L}}, where L{ L} is a graph Laplacian matrix and β>0\beta>0 is a diffusion timescale parameter, we apply this approach to diverse applications including a network encoding polarized voting patterns of the 117th U.S. Senate, a multimodal transportation system including roads and metro lines in London, and a multiplex brain network encoding correlated human brain activity. Our experiments highlight situations where the edges that are considered to be most important for information diffusion complexity can dramatically change as one considers short, intermediate and long timescales β\beta for diffusion.Comment: 24 pages, 7 figure

    MuxViz: A Tool for Multilayer Analysis and Visualization of Networks

    Full text link
    Multilayer relationships among entities and information about entities must be accompanied by the means to analyze, visualize, and obtain insights from such data. We present open-source software (muxViz) that contains a collection of algorithms for the analysis of multilayer networks, which are an important way to represent a large variety of complex systems throughout science and engineering. We demonstrate the ability of muxViz to analyze and interactively visualize multilayer data using empirical genetic, neuronal, and transportation networks. Our software is available at https://github.com/manlius/muxViz.Comment: 18 pages, 10 figures (text of the accepted manuscript

    The Role Of The Interaction Network In The Emergence Of Diversity Of Behavior

    Get PDF
    Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)How can systems in which individuals' inner workings are very similar to each other, as neural networks or ant colonies, produce so many qualitatively different behaviors, giving rise to roles and specialization? In this work, we bring new perspectives to this question by focusing on the underlying network that defines how individuals in these systems interact. We applied a genetic algorithm to optimize rules and connections of cellular automata in order to solve the density classification task, a classical problem used to study emergent behaviors in decentralized computational systems. The networks used were all generated by the introduction of shortcuts in an originally regular topology, following the Small-world model. Even though all cells follow the exact same rules, we observed the existence of different classes of cells' behaviors in the best cellular automata found D most cells were responsible for memory and others for integration of information. Through the analysis of structural measures and patterns of connections (motifs) in successful cellular automata, we observed that the distribution of shortcuts between distant regions and the speed in which a cell can gather information from different parts of the system seem to be the main factors for the specialization we observed, demonstrating how heterogeneity in a network can create heterogeneity of behavior.122Conselho Nacional de Desenvolvimento Cientifico e Tecnologico [142118/2010-9]Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq

    Edge manipulation techniques for complex networks with applications to communicability and triadic closure.

    Get PDF
    Complex networks are ubiquitous in our everyday life and can be used to model a wide variety of phenomena. For this reason, they have captured the interest of researchers from a wide variety of fields. In this work, we describe how to tackle two problems that have their focus on the edges of networks. Our first goal is to develop mathematically inferred, efficient methods based on some newly introduced edge centrality measures for the manipulation of links in a network. We want to make a small number of changes to the edges in order to tune its overall ability to exchange information according to certain goals. Specifically, we consider the problem of adding a few links in order to increase as much as possible this ability and that of selecting a given number of connections to be removed from the graph in order to penalize it as little as possible. Techniques to tackle these problems are developed for both undirected and directed networks. Concerning the directed case, we further discuss how to approximate certain quantities that are used to measure the importance of edges. Secondly, we consider the problem of understanding the mechanism underlying triadic closure in networks and we describe how communicability distance functions play a role in this process. Extensive numerical tests are presented to validate our approaches

    4D Nucleome of Cancer

    Full text link
    Chromosomal translocations and aneuploidy are hallmarks of cancer genomes; however, the impact of these aberrations on the nucleome (i.e., nuclear structure and gene expression) are not yet understood. This dissertation aims to understand the changes in nuclear structure and function that occur as a result of cancer, i.e., the 4D nucleome of cancer. Understanding of nuclear shape and organization and how it changes over time in both healthy cells as well as cancer cells is an area of exploration through the 4D nucleome project. First, I explore healthy cells including periodic changes in nuclear shape as fibroblasts cells grow and divide. Shape and volume changed significantly over the time series including a periodic frequency consistent with the cell cycle. Next, combined analysis of genome wide chromosome conformation capture and RNA-sequencing data identified regions with different expression or interactions in cells grown in 2D or 3D cell culture. Next, I elucidate how chromosomal aberrations affect the nucleome of cancer cells. A high copy number region is studied, and we show that around sites of translocation, chromatin accessibility more directly reflects transcription. The methods developed, including a new copy number based normalization method, were released in the 4D nucleome analysis toolbox (NAT), a publicly available MATLAB toolbox allowing others to use the tools for assessment of the nucleome. Finally, I describe continuing projects. By comparing cancer stem cells to non- stem cell like cancer cells, a bin on chromosome 8 was identified that includes two stem cell related transcription factors, POU5F1B and MYC. Then tools for evaluating allele specific expression are developed and used to measure how allele specific structure and function varies through the cell cycle. This work creates a foundation for robust analysis of chromosome conformation and provides insight into the effect of nuclear organization in cancer.PHDBioinformaticsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/140814/1/laseaman_1.pd

    Aging and Health

    Get PDF
    Aging is a major risk factor for chronic diseases, which in turn can provide information about the aging of a biological system. This publication serves as an introduction to systems biology and its application to biological aging. Key pathways and processes that impinge on aging are reviewed, and how they contribute to health and disease during aging is discussed. The evolution of this situation is analyzed, and the consequences for the study of genetic effects on aging are presented. Epigenetic programming of aging, as a continuation of development, creates an interface between the genome and the environment. New research into the gut microbiome describes how this interface may operate in practice with marked consequences for a variety of disorders. This analysis is bolstered by a view of the aging organism as a whole, with conclusions about the mechanisms underlying resilience of the organism to change, and is expanded with a discussion of circadian rhythms in aging

    Adapting Community Detection Approaches to Large, Multilayer, and Attributed Networks

    Get PDF
    Networks have become a common data mining tool to encode relational definitions between a set of entities. Whether studying biological correlations, or communication between individuals in a social network, network analysis tools enable interpretation, prediction, and visualization of patterns in the data. Community detection is a well-developed subfield of network analysis, where the objective is to cluster nodes into 'communities' based on their connectivity patterns. There are many useful and robust approaches for identifying communities in a single, moderately-sized network, but the ability to work with more complicated types of networks containing extra or a large amount of information poses challenges. In this thesis, we address three types of challenging network data and how to adapt standard community detection approaches to handle these situations. In particular, we focus on networks that are large, attributed, and multilayer. First, we present a method for identifying communities in multilayer networks, where there exist multiple relational definitions between a set of nodes. Next, we provide a pre-processing technique for reducing the size of large networks, where standard community detection approaches might have inconsistent results or be prohibitively slow. We then introduce an extension to a probabilistic model for community structure to take into account node attribute information and develop a test to quantify the extent to which connectivity and attribute information align. Finally, we demonstrate example applications of these methods in biological and social networks. This work helps to advance the understand of network clustering, network compression, and the joint modeling of node attributes and network connectivity.Doctor of Philosoph

    Edge manipulation techniques for complex networks with applications to communicability and triadic closure.

    Get PDF
    Complex networks are ubiquitous in our everyday life and can be used to model a wide variety of phenomena. For this reason, they have captured the interest of researchers from a wide variety of fields. In this work, we describe how to tackle two problems that have their focus on the edges of networks. Our first goal is to develop mathematically inferred, efficient methods based on some newly introduced edge centrality measures for the manipulation of links in a network. We want to make a small number of changes to the edges in order to tune its overall ability to exchange information according to certain goals. Specifically, we consider the problem of adding a few links in order to increase as much as possible this ability and that of selecting a given number of connections to be removed from the graph in order to penalize it as little as possible. Techniques to tackle these problems are developed for both undirected and directed networks. Concerning the directed case, we further discuss how to approximate certain quantities that are used to measure the importance of edges. Secondly, we consider the problem of understanding the mechanism underlying triadic closure in networks and we describe how communicability distance functions play a role in this process. Extensive numerical tests are presented to validate our approaches

    The metaRbolomics Toolbox in Bioconductor and beyond

    Get PDF
    Metabolomics aims to measure and characterise the complex composition of metabolites in a biological system. Metabolomics studies involve sophisticated analytical techniques such as mass spectrometry and nuclear magnetic resonance spectroscopy, and generate large amounts of high-dimensional and complex experimental data. Open source processing and analysis tools are of major interest in light of innovative, open and reproducible science. The scientific community has developed a wide range of open source software, providing freely available advanced processing and analysis approaches. The programming and statistics environment R has emerged as one of the most popular environments to process and analyse Metabolomics datasets. A major benefit of such an environment is the possibility of connecting different tools into more complex workflows. Combining reusable data processing R scripts with the experimental data thus allows for open, reproducible research. This review provides an extensive overview of existing packages in R for different steps in a typical computational metabolomics workflow, including data processing, biostatistics, metabolite annotation and identification, and biochemical network and pathway analysis. Multifunctional workflows, possible user interfaces and integration into workflow management systems are also reviewed. In total, this review summarises more than two hundred metabolomics specific packages primarily available on CRAN, Bioconductor and GitHub
    corecore