Multisensory Oddity Detection as Bayesian Inference

A key goal for the perceptual system is to optimally combine information from all the senses that may be available in order to develop the most accurate and unified picture possible of the outside world. The contemporary theoretical framework of ideal observer maximum likelihood integration (MLI) has been highly successful in modelling how the human brain combines information from a variety of different sensory modalities. However, in various recent experiments involving multisensory stimuli of uncertain correspondence, MLI breaks down as a successful model of sensory combination. Within the paradigm of direct stimulus estimation, perceptual models which use Bayesian inference to resolve correspondence have recently been shown to generalize successfully to these cases where MLI fails. This approach has been known variously as model inference, causal inference or structure inference. In this paper, we examine causal uncertainty in another important class of multi-sensory perception paradigm – that of oddity detection and demonstrate how a Bayesian ideal observer also treats oddity detection as a structure inference problem. We validate this approach by showing that it provides an intuitive and quantitative explanation of an important pair of multi-sensory oddity detection experiments – involving cues across and within modalities – for which MLI previously failed dramatically, allowing a novel unifying treatment of within and cross modal multisensory perception. Our successful application of structure inference models to the new ‘oddity detection’ paradigm, and the resultant unified explanation of across and within modality cases provide further evidence to suggest that structure inference may be a commonly evolved principle for combining perceptual information in the brain.     

Reliability of regulatory networks and its evolution

The problem of reliability of the dynamics in biological regulatory networks is studied in the framework of a generalized Boolean network model with continuous timing and noise. Using well-known artificial genetic networks such as the repressilator, we discuss concepts of reliability of rhythmic attractors. In a simple evolution process we investigate how overall network structure affects the reliability of the dynamics. In the course of the evolution, networks are selected for reliable dynamics. We find that most networks can be easily evolved towards reliable functioning while preserving the original function.     

Biological network design strategies: discovery through dynamic optimization

An important challenge in systems biology is the inherent complexity of biological network models, which complicates the task of relating network structure to function and of understanding the conceptual design principles by which a given network operates. Here we investigate an approach to analyze the relationship between a network structure and its function using the framework of optimization. A common feature found in a variety of biochemical networks involves the opposition of a pair of enzymatic chemical modification reactions such as phosphorylation-dephosphorylation or methylation-demethylation. The modification pair frequently adjusts biochemical properties of its target, such as activating and deactivating function. We applied optimization methodology to study a reversible modification network unit commonly found in signal transduction systems, and we explored the use of this methodology to discover design principles. The results demonstrate that different sets of rate constants used to parameterize the same network topology represent different compromises made in the resulting network operating characteristics. Moreover, the same topology can be used to encode different strategies for achieving performance goals. The ability to adopt multiple strategies may lead to significantly improved performance across a range of conditions through rate modulation or evolutionary processes. The optimization framework explored here is a practical approach to support the discovery of design principles in biological networks.     

A Multivariate Granger Causality Concept towards Full Brain Functional Connectivity

Detecting changes of spatially high-resolution functional connectivity patterns in the brain is crucial for improving the fundamental understanding of brain function in both health and disease, yet still poses one of the biggest challenges in computational neuroscience. Currently, classical multivariate Granger Causality analyses of directed interactions between single process components in coupled systems are commonly restricted to spatially low- dimensional data, which requires a pre-selection or aggregation of time series as a preprocessing step. In this paper we propose a new fully multivariate Granger Causality approach with embedded dimension reduction that makes it possible to obtain a representation of functional connectivity for spatially high-dimensional data. The resulting functional connectivity networks may consist of several thousand vertices and thus contain more detailed information compared to connectivity networks obtained from approaches based on particular regions of interest. Our large scale Granger Causality approach is applied to synthetic and resting state fMRI data with a focus on how well network community structure, which represents a functional segmentation of the network, is preserved. It is demonstrated that a number of different community detection algorithms, which utilize a variety of algorithmic strategies and exploit topological features differently, reveal meaningful information on the underlying network module structure.     

Microbial Communities Can Be Described by Metabolic Structure: A General Framework and Application to a Seasonally Variable,Depth-Stratified Microbial Community from the Coastal West Antarctic Peninsula

Taxonomic marker gene studies, such as the 16S rRNA gene, have been used to successfully explore microbial diversity in a variety of marine, terrestrial, and host environments. For some of these environments long term sampling programs are beginning to build a historical record of microbial community structure. Although these 16S rRNA gene datasets do not intrinsically provide information on microbial metabolism or ecosystem function, this information can be developed by identifying metabolisms associated with related, phenotyped strains. Here we introduce the concept of metabolic inference; the systematic prediction of metabolism from phylogeny, and describe a complete pipeline for predicting the metabolic pathways likely to be found in a collection of 16S rRNA gene phylotypes. This framework includes a mechanism for assigning confidence to each metabolic inference that is based on a novel method for evaluating genomic plasticity. We applied this framework to 16S rRNA gene libraries from the West Antarctic Peninsula marine environment, including surface and deep summer samples and surface winter samples. Using statistical methods commonly applied to community ecology data we found that metabolic structure differed between summer surface and winter and deep samples, comparable to an analysis of community structure by 16S rRNA gene phylotypes. While taxonomic variance between samples was primarily driven by low abundance taxa, metabolic variance was attributable to both high and low abundance pathways. This suggests that clades with a high degree of functional redundancy can occupy distinct adjacent niches. Overall our findings demonstrate that inferred metabolism can be used in place of taxonomy to describe the structure of microbial communities. Coupling metabolic inference with targeted metagenomics and an improved collection of completed genomes could be a powerful way to analyze microbial communities in a high-throughput manner that provides direct access to metabolic and ecosystem function.     

A general modeling framework for describing spatially structured population dynamics

Variation in movement across time and space fundamentally shapes the abundance and distribution of populations. Although a variety of approaches model structured population dynamics, they are limited to specific types of spatially structured populations and lack a unifying framework. Here, we propose a unified network‐based framework sufficiently novel in its flexibility to capture a wide variety of spatiotemporal processes including metapopulations and a range of migratory patterns. It can accommodate different kinds of age structures, forms of population growth, dispersal, nomadism and migration, and alternative life‐history strategies. Our objective was to link three general elements common to all spatially structured populations (space, time and movement) under a single mathematical framework. To do this, we adopt a network modeling approach. The spatial structure of a population is represented by a weighted and directed network. Each node and each edge has a set of attributes which vary through time. The dynamics of our network‐based population is modeled with discrete time steps. Using both theoretical and real‐world examples, we show how common elements recur across species with disparate movement strategies and how they can be combined under a unified mathematical framework. We illustrate how metapopulations, various migratory patterns, and nomadism can be represented with this modeling approach. We also apply our network‐based framework to four organisms spanning a wide range of life histories, movement patterns, and carrying capacities. General computer code to implement our framework is provided, which can be applied to almost any spatially structured population. This framework contributes to our theoretical understanding of population dynamics and has practical management applications, including understanding the impact of perturbations on population size, distribution, and movement patterns. By working within a common framework, there is less chance that comparative analyses are colored by model details rather than general principles.     

Evolutionary Triplet Models of Structured RNA

The reconstruction and synthesis of ancestral RNAs is a feasible goal for paleogenetics. This will require new bioinformatics methods, including a robust statistical framework for reconstructing histories of substitutions, indels and structural changes. We describe a “transducer composition” algorithm for extending pairwise probabilistic models of RNA structural evolution to models of multiple sequences related by a phylogenetic tree. This algorithm draws on formal models of computational linguistics as well as the 1985 protosequence algorithm of David Sankoff. The output of the composition algorithm is a multiple-sequence stochastic context-free grammar. We describe dynamic programming algorithms, which are robust to null cycles and empty bifurcations, for parsing this grammar. Example applications include structural alignment of non-coding RNAs, propagation of structural information from an experimentally-characterized sequence to its homologs, and inference of the ancestral structure of a set of diverged RNAs. We implemented the above algorithms for a simple model of pairwise RNA structural evolution; in particular, the algorithms for maximum likelihood (ML) alignment of three known RNA structures and a known phylogeny and inference of the common ancestral structure. We compared this ML algorithm to a variety of related, but simpler, techniques, including ML alignment algorithms for simpler models that omitted various aspects of the full model and also a posterior-decoding alignment algorithm for one of the simpler models. In our tests, incorporation of basepair structure was the most important factor for accurate alignment inference; appropriate use of posterior-decoding was next; and fine details of the model were least important. Posterior-decoding heuristics can be substantially faster than exact phylogenetic inference, so this motivates the use of sum-over-pairs heuristics where possible (and approximate sum-over-pairs). For more exact probabilistic inference, we discuss the use of transducer composition for ML (or MCMC) inference on phylogenies, including possible ways to make the core operations tractable.     

Cliques and cavities in the human connectome

Encoding brain regions and their connections as a network of nodes and edges captures many of the possible paths along which information can be transmitted as humans process and perform complex behaviors. Because cognitive processes involve large, distributed networks of brain areas, principled examinations of multi-node routes within larger connection patterns can offer fundamental insights into the complexities of brain function. Here, we investigate both densely connected groups of nodes that could perform local computations as well as larger patterns of interactions that would allow for parallel processing. Finding such structures necessitates that we move from considering exclusively pairwise interactions to capturing higher order relations, concepts naturally expressed in the language of algebraic topology. These tools can be used to study mesoscale network structures that arise from the arrangement of densely connected substructures called cliques in otherwise sparsely connected brain networks. We detect cliques (all-to-all connected sets of brain regions) in the average structural connectomes of 8 healthy adults scanned in triplicate and discover the presence of more large cliques than expected in null networks constructed via wiring minimization, providing architecture through which brain network can perform rapid, local processing. We then locate topological cavities of different dimensions, around which information may flow in either diverging or converging patterns. These cavities exist consistently across subjects, differ from those observed in null model networks, and – importantly – link regions of early and late evolutionary origin in long loops, underscoring their unique role in controlling brain function. These results offer a first demonstration that techniques from algebraic topology offer a novel perspective on structural connectomics, highlighting loop-like paths as crucial features in the human brain’s structural architecture.     

On the influence of prior information evaluated by fully Bayesian criteria in a personalized whole-brain model of epilepsy spread

Individualized anatomical information has been used as prior knowledge in Bayesian inference paradigms of whole-brain network models. However, the actual sensitivity to such personalized information in priors is still unknown. In this study, we introduce the use of fully Bayesian information criteria and leave-one-out cross-validation technique on the subject-specific information to assess different epileptogenicity hypotheses regarding the location of pathological brain areas based on a priori knowledge from dynamical system properties. The Bayesian Virtual Epileptic Patient (BVEP) model, which relies on the fusion of structural data of individuals, a generative model of epileptiform discharges, and a self-tuning Monte Carlo sampling algorithm, is used to infer the spatial map of epileptogenicity across different brain areas. Our results indicate that measuring the out-of-sample prediction accuracy of the BVEP model with informative priors enables reliable and efficient evaluation of potential hypotheses regarding the degree of epileptogenicity across different brain regions. In contrast, while using uninformative priors, the information criteria are unable to provide strong evidence about the epileptogenicity of brain areas. We also show that the fully Bayesian criteria correctly assess different hypotheses about both structural and functional components of whole-brain models that differ across individuals. The fully Bayesian information-theory based approach used in this study suggests a patient-specific strategy for epileptogenicity hypothesis testing in generative brain network models of epilepsy to improve surgical outcomes.     

What Can Interaction Webs Tell Us About Species Roles?

The group model is a useful tool to understand broad-scale patterns of interaction in a network, but it has previously been limited in use to food webs, which contain only predator-prey interactions. Natural populations interact with each other in a variety of ways and, although most published ecological networks only include information about a single interaction type (e.g., feeding, pollination), ecologists are beginning to consider networks which combine multiple interaction types. Here we extend the group model to signed directed networks such as ecological interaction webs. As a specific application of this method, we examine the effects of including or excluding specific interaction types on our understanding of species roles in ecological networks. We consider all three currently available interaction webs, two of which are extended plant-mutualist networks with herbivores and parasitoids added, and one of which is an extended intertidal food web with interactions of all possible sign structures (+/+, -/0, etc.). Species in the extended food web grouped similarly with all interactions, only trophic links, and only nontrophic links. However, removing mutualism or herbivory had a much larger effect in the extended plant-pollinator webs. Species removal even affected groups that were not directly connected to those that were removed, as we found by excluding a small number of parasitoids. These results suggest that including additional species in the network provides far more information than additional interactions for this aspect of network structure. Our methods provide a useful framework for simplifying networks to their essential structure, allowing us to identify generalities in network structure and better understand the roles species play in their communities.     

Game Theory,Conditional Preferences,and Social Influence

Neoclassical noncooperative game theory is based on a simple, yet powerful synthesis of mathematical and logical concepts: unconditional and immutable preference orderings and individual rationality. Although this structure has proven useful for characterizing competitive multi-player behavior, its applicability to scenarios involving complex social relationships is problematic. In this paper we directly address this limitation by the introduction of a conditional preference structure that permits players to modulate their preference orderings as functions of the preferences of other players. Embedding this expanded preference structure in a formal and graphical framework provides a systematic approach for characterizing a complex society. The result is an influence network that allows conditional preferences to propagate through the community, resulting in an emergent social model which characterizes all of the social relationships that exist and which leads to solution concepts that account for both group and individual interests. The Ultimatum game is presented as an example of how social influence can be modeled with conditional preferences.     

Gene regulatory network inference by point-based Gaussian approximation filters incorporating the prior information

Abstract

The extended Kalman filter (EKF) has been applied to inferring gene regulatory networks. However, it is well known that the EKF becomes less accurate when the system exhibits high nonlinearity. In addition, certain prior information about the gene regulatory network exists in practice, and no systematic approach has been developed to incorporate such prior information into the Kalman-type filter for inferring the structure of the gene regulatory network. In this paper, an inference framework based on point-based Gaussian approximation filters that can exploit the prior information is developed to solve the gene regulatory network inference problem. Different point-based Gaussian approximation filters, including the unscented Kalman filter (UKF), the third-degree cubature Kalman filter (CKF₃), and the fifth-degree cubature Kalman filter (CKF₅) are employed. Several types of network prior information, including the existing network structure information, sparsity assumption, and the range constraint of parameters, are considered, and the corresponding filters incorporating the prior information are developed. Experiments on a synthetic network of eight genes and the yeast protein synthesis network of five genes are carried out to demonstrate the performance of the proposed framework. The results show that the proposed methods provide more accurate inference results than existing methods, such as the EKF and the traditional UKF.

     

Multi-scale modeling of complex neuronal networks: a view towards striatal cholinergic pattern formations

The phenomena related to brain function occur as the interplay of various modules at different spatial and temporal scales. Particularly, the integration of the dynamical behavior of cells within the complex brain topology reveals a heterogeneous multi-scale problem, which has, to date, mainly been addressed by methods of statistical physics such as mean-field approximations. In contrast, the present study introduces an abstract mathematical model of a deterministic nature that provides a robust integral transformation of the microscopic activities into macroscopic spatiotemporal patterns. The existence of the transformation operator is guaranteed by the convergence of a repetitive patching of the network domain with its fundamental domains that express the local topologies of the tissue. Depending on the choice of the local connectivity function, this framework represents a computationally efficient generalization of the classical Kirchhoff’s, Hebbian, and Hopfield’s approaches. The capabilities of this multi-scale method have been evaluated within the structure of the dorsal striatum of rats, a brain region with major involvement in motor and cognitive information processing. Numerical simulations suggest the formation of characteristic spatiotemporal patterns due to the activation of cholinergic interneurons.     

BiomeNet: A Bayesian Model for Inference of Metabolic Divergence among Microbial Communities

Metagenomics yields enormous numbers of microbial sequences that can be assigned a metabolic function. Using such data to infer community-level metabolic divergence is hindered by the lack of a suitable statistical framework. Here, we describe a novel hierarchical Bayesian model, called BiomeNet (Bayesian inference of metabolic networks), for inferring differential prevalence of metabolic subnetworks among microbial communities. To infer the structure of community-level metabolic interactions, BiomeNet applies a mixed-membership modelling framework to enzyme abundance information. The basic idea is that the mixture components of the model (metabolic reactions, subnetworks, and networks) are shared across all groups (microbiome samples), but the mixture proportions vary from group to group. Through this framework, the model can capture nested structures within the data. BiomeNet is unique in modeling each metagenome sample as a mixture of complex metabolic systems (metabosystems). The metabosystems are composed of mixtures of tightly connected metabolic subnetworks. BiomeNet differs from other unsupervised methods by allowing researchers to discriminate groups of samples through the metabolic patterns it discovers in the data, and by providing a framework for interpreting them. We describe a collapsed Gibbs sampler for inference of the mixture weights under BiomeNet, and we use simulation to validate the inference algorithm. Application of BiomeNet to human gut metagenomes revealed a metabosystem with greater prevalence among inflammatory bowel disease (IBD) patients. Based on the discriminatory subnetworks for this metabosystem, we inferred that the community is likely to be closely associated with the human gut epithelium, resistant to dietary interventions, and interfere with human uptake of an antioxidant connected to IBD. Because this metabosystem has a greater capacity to exploit host-associated glycans, we speculate that IBD-associated communities might arise from opportunist growth of bacteria that can circumvent the host''s nutrient-based mechanism for bacterial partner selection.     

Analysis and practical guideline of constraint-based boolean method in genetic network inference

Boolean-based method, despite of its simplicity, would be a more attractive approach for inferring a network from high-throughput expression data if its effectiveness has not been limited by high false positive prediction. In this study, we explored factors that could simply be adjusted to improve the accuracy of inferring networks. Our work focused on the analysis of the effects of discretisation methods, biological constraints, and stringency of boolean function assignment on the performance of boolean network, including accuracy, precision, specificity and sensitivity, using three sets of microarray time-series data. The study showed that biological constraints have pivotal influence on the network performance over the other factors. It can reduce the variation in network performance resulting from the arbitrary selection of discretisation methods and stringency settings. We also presented the master boolean network as an approach to establish the unique solution for boolean analysis. The information acquired from the analysis was summarised and deployed as a general guideline for an efficient use of boolean-based method in the network inference. In the end, we provided an example of the use of such a guideline in the study of Arabidopsis circadian clock genetic network from which much interesting biological information can be inferred.     

A stochastic dispersal-limited trait-based model of community dynamics

I present a model of stochastic community dynamics in which death occurs randomly in the community, propagules disperse randomly from a regional pool, and recruitment of new individuals of a species is proportional to the species local abundance multiplied by its local competitive ability. The competitive ability of a species is assumed to be determined by a function of one trait of the species, and I call this function the environmental filtering function. I show that information on local species abundances in a network of plots, together with trait data for each species, enables the inference of both the immigration rate and the environmental filtering function in each plot. I further study how the diversity patterns produced by this model deviate from the neutral predictions, and how this deviation depends on the characteristics of the environmental filtering function. I show that this inference framework is more powerful at detecting trait-based environmental filtering than existing statistical approaches based on trait distributions, and discuss how the predictions of this model could be used to assess environmental heterogeneity in a plot, to detect functionally meaningful trade-offs among species traits, and to test the assumption that there exists a simple relationship between species traits and local competitive ability.     

Evaluating functional network inference using simulations of complex biological systems

MOTIVATION: Although many network inference algorithms have been presented in the bioinformatics literature, no suitable approach has been formulated for evaluating their effectiveness at recovering models of complex biological systems from limited data. To overcome this limitation, we propose an approach to evaluate network inference algorithms according to their ability to recover a complex functional network from biologically reasonable simulated data. RESULTS: We designed a simulator to generate data representing a complex biological system at multiple levels of organization: behaviour, neural anatomy, brain electrophysiology, and gene expression of songbirds. About 90% of the simulated variables are unregulated by other variables in the system and are included simply as distracters. We sampled the simulated data at intervals as one would sample from a biological system in practice, and then used the sampled data to evaluate the effectiveness of an algorithm we developed for functional network inference. We found that our algorithm is highly effective at recovering the functional network structure of the simulated system-including the irrelevance of unregulated variables-from sampled data alone. To assess the reproducibility of these results, we tested our inference algorithm on 50 separately simulated sets of data and it consistently recovered almost perfectly the complex functional network structure underlying the simulated data. To our knowledge, this is the first approach for evaluating the effectiveness of functional network inference algorithms at recovering models from limited data. Our simulation approach also enables researchers a priori to design experiments and data-collection protocols that are amenable to functional network inference.     

An associative memory that can form hypotheses: a phase-coded neural network

 Nonlinear associative memories as realized, e.g., by Hopfield nets are characterized by attractor-type dynamics. When fed with a starting pattern, they converge to exactly one of the stored patterns which is supposed to be most similar. These systems cannot render hypotheses of classification, i.e., render several possible answers to a given classification problem. Inspired by von der Malsburg’s correlation theory of brain function, we extend conventional neural network architectures by introducing additional dynamical variables. Assuming an oscillatory time structure of neural firing, i.e., the existence of neural clocks, we assign a so-called phase to each formal neuron. The phases explicitly describe detailed correlations of neural activities neglected in conventional neural network architectures. Implementing this extension into a simple self-organizing network based on a feature map, we present an associative memory that actually is capable of forming hypotheses of classification. Received: 6 December 1993/Accepted in revised form: 14 July 1994     

Network Physiology: How Organ Systems Dynamically Interact

We systematically study how diverse physiologic systems in the human organism dynamically interact and collectively behave to produce distinct physiologic states and functions. This is a fundamental question in the new interdisciplinary field of Network Physiology, and has not been previously explored. Introducing the novel concept of Time Delay Stability (TDS), we develop a computational approach to identify and quantify networks of physiologic interactions from long-term continuous, multi-channel physiological recordings. We also develop a physiologically-motivated visualization framework to map networks of dynamical organ interactions to graphical objects encoded with information about the coupling strength of network links quantified using the TDS measure. Applying a system-wide integrative approach, we identify distinct patterns in the network structure of organ interactions, as well as the frequency bands through which these interactions are mediated. We establish first maps representing physiologic organ network interactions and discover basic rules underlying the complex hierarchical reorganization in physiologic networks with transitions across physiologic states. Our findings demonstrate a direct association between network topology and physiologic function, and provide new insights into understanding how health and distinct physiologic states emerge from networked interactions among nonlinear multi-component complex systems. The presented here investigations are initial steps in building a first atlas of dynamic interactions among organ systems.