Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Pathway structure determination in complex stochastic networks with non-exponential dwell times.

ABSTRACT: Analysis of complex networks has been widely used as a powerful tool for investigating various physical, chemical, and biological processes. To understand the emergent properties of these complex systems, one of the most basic issues is to determine the structure and topology of the underlying networks. Recently, a new theoretical approach based on first-passage analysis has been developed for investigating the relationship between structure and dynamic properties for network systems with exponential dwell time distributions. However, many real phenomena involve transitions with non-exponential waiting times. We extend the first-passage method to uncover the structure of distinct pathways in complex networks with non-exponential dwell time distributions. It is found that the analysis of early time dynamics provides explicit information on the length of the pathways associated to their dynamic properties. It reveals a universal relationship that we have condensed in one general equation, which relates the number of intermediate states on the shortest path to the early time behavior of the first-passage distributions. Our theoretical predictions are confirmed by extensive Monte Carlo simulations.

SUBMITTER: Li X

PROVIDER: S-EPMC4032447 | biostudies-other | 2014 May

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Reconstruction of stochastic temporal networks through diffusive arrival times.

Project description:Temporal networks have opened a new dimension in defining and quantification of complex interacting systems. Our ability to identify and reproduce time-resolved interaction patterns is, however, limited by the restricted access to empirical individual-level data. Here we propose an inverse modelling method based on first-arrival observations of the diffusion process taking place on temporal networks. We describe an efficient coordinate-ascent implementation for inferring stochastic temporal networks that builds in particular but not exclusively on the null model assumption of mutually independent interaction sequences at the dyadic level. The results of benchmark tests applied on both synthesized and empirical network data sets confirm the validity of our algorithm, showing the feasibility of statistically accurate inference of temporal networks only from moderate-sized samples of diffusion cascades. Our approach provides an effective and flexible scheme for the temporally augmented inverse problems of network reconstruction and has potential in a broad variety of applications.

| S-EPMC5472785 | biostudies-literature

First passage events in biological systems with non-exponential inter-event times.

Project description:It is often possible to model the dynamics of biological systems as a series of discrete transitions between a finite set of observable states (or compartments). When the residence times in each state, or inter-event times more generally, are exponentially distributed, then one can write a set of ordinary differential equations, which accurately describe the evolution of mean quantities. Non-exponential inter-event times can also be experimentally observed, but are more difficult to analyse mathematically. In this paper, we focus on the computation of first passage events and their probabilities in biological systems with non-exponential inter-event times. We show, with three case studies from Molecular Immunology, Virology and Epidemiology, that significant errors are introduced when drawing conclusions based on the assumption that inter-event times are exponentially distributed. Our approach allows these errors to be avoided with the use of phase-type distributions that approximate arbitrarily distributed inter-event times.

| S-EPMC6180141 | biostudies-literature

Exponential random graph modeling for complex brain networks.

Project description:Exponential random graph models (ERGMs), also known as p* models, have been utilized extensively in the social science literature to study complex networks and how their global structure depends on underlying structural components. However, the literature on their use in biological networks (especially brain networks) has remained sparse. Descriptive models based on a specific feature of the graph (clustering coefficient, degree distribution, etc.) have dominated connectivity research in neuroscience. Corresponding generative models have been developed to reproduce one of these features. However, the complexity inherent in whole-brain network data necessitates the development and use of tools that allow the systematic exploration of several features simultaneously and how they interact to form the global network architecture. ERGMs provide a statistically principled approach to the assessment of how a set of interacting local brain network features gives rise to the global structure. We illustrate the utility of ERGMs for modeling, analyzing, and simulating complex whole-brain networks with network data from normal subjects. We also provide a foundation for the selection of important local features through the implementation and assessment of three selection approaches: a traditional p-value based backward selection approach, an information criterion approach (AIC), and a graphical goodness of fit (GOF) approach. The graphical GOF approach serves as the best method given the scientific interest in being able to capture and reproduce the structure of fitted brain networks.

| S-EPMC3102079 | biostudies-other

Short relaxation times but long transient times in both simple and complex reaction networks.

Project description:When relaxation towards an equilibrium or steady state is exponential at large times, one usually considers that the associated relaxation time ?, i.e. the inverse of the decay rate, is the longest characteristic time in the system. However, that need not be true, other times such as the lifetime of an infinitesimal perturbation can be much longer. In the present work, we demonstrate that this paradoxical property can arise even in quite simple systems such as a linear chain of reactions obeying mass action (MA) kinetics. By mathematical analysis of simple reaction networks, we pin-point the reason why the standard relaxation time does not provide relevant information on the potentially long transient times of typical infinitesimal perturbations. Overall, we consider four characteristic times and study their behaviour in both simple linear chains and in more complex reaction networks taken from the publicly available database 'Biomodels'. In all these systems, whether involving MA rates, Michaelis-Menten reversible kinetics, or phenomenological laws for reaction rates, we find that the characteristic times corresponding to lifetimes of tracers and of concentration perturbations can be significantly longer than ?.

| S-EPMC4971225 | biostudies-literature

Using LC Retention Times in Organic Structure Determination: Drug Metabolite Identification.

Project description:BackgroundThere is a continued need for improvements in the efficiency of metabolite structure elucidation.ObjectiveWe propose to take LC Retention Time (RT) into consideration during the process of structure determination.MethodsHerein, we develop a simple methodology that employs a Chromatographic Hydrophobicity Index (CHI) framework for standardizing LC conditions and introduce and utilize the concept of a predictable CHI change upon Phase 1 biotransformation (CHIbt). Through the analysis of literature examples, we offer a Quantitative Structure-Retention Relationship (QSRR) for several types of biotransformation (especially hydroxylation) using physicochemical properties (clogP, hydrogen bonding).ResultsThe CHI system for retention indexing is shown to be practical and simple to implement. A database of CHIbt values has been created from re-incubation of 3 compounds and from analysis of an additional 17 datasets from the literature. Application of this database is illustrated.ConclusionIn our experience, this simple methodology allows complementing the discovery efforts that saves resources for in-depth characterization using NMR.

| S-EPMC6350196 | biostudies-literature

Long-tailed distributions of inter-event times as mixtures of exponential distributions.

Project description:Inter-event times of various human behaviour are apparently non-Poissonian and obey long-tailed distributions as opposed to exponential distributions, which correspond to Poisson processes. It has been suggested that human individuals may switch between different states, in each of which they are regarded to generate events obeying a Poisson process. If this is the case, inter-event times should approximately obey a mixture of exponential distributions with different parameter values. In the present study, we introduce the minimum description length principle to compare mixtures of exponential distributions with different numbers of components (i.e. constituent exponential distributions). Because these distributions violate the identifiability property, one is mathematically not allowed to apply the Akaike or Bayes information criteria to their maximum-likelihood estimator to carry out model selection. We overcome this theoretical barrier by applying a minimum description principle to joint likelihoods of the data and latent variables. We show that mixtures of exponential distributions with a few components are selected, as opposed to more complex mixtures in various datasets, and that the fitting accuracy is comparable to that of state-of-the-art algorithms to fit power-law distributions to data. Our results lend support to Poissonian explanations of apparently non-Poissonian human behaviour.

| S-EPMC7062064 | biostudies-literature

A Regularized Stochastic Block Model for the robust community detection in complex networks.

Project description:The stochastic block model is able to generate random graphs with different types of network partitions, ranging from the traditional assortative structures to the disassortative structures. Since the stochastic block model does not specify which mixing pattern is desired, the inference algorithms discover the locally most likely nodes' partition, regardless of its type. Here we introduce a new model constraining nodes' internal degree ratios in the objective function to guide the inference algorithms to converge to the desired type of structure in the observed network data. We show experimentally that given the regularized model, the inference algorithms, such as Markov chain Monte Carlo, reliably and quickly find the assortative or disassortative structure as directed by the value of a single parameter. In contrast, when the sought-after assortative community structure is not strong in the observed network, the traditional inference algorithms using the degree-corrected stochastic block model tend to converge to undesired disassortative partitions.

| S-EPMC6744415 | biostudies-literature

Dynamical stochastic simulation of complex electrical behavior in neuromorphic networks of metallic nanojunctions.

Project description:Nanostructured Au films fabricated by the assembling of nanoparticles produced in the gas phase have shown properties suitable for neuromorphic computing applications: they are characterized by a non-linear and non-local electrical behavior, featuring switches of the electric resistance whose activation is typically triggered by an applied voltage over a certain threshold. These systems can be considered as complex networks of metallic nanojunctions where thermal effects at the nanoscale cause the continuous rearrangement of regions with low and high electrical resistance. In order to gain a deeper understanding of the electrical properties of this nano granular system, we developed a model based on a large three dimensional regular resistor network with non-linear conduction mechanisms and stochastic updates of conductances. Remarkably, by increasing enough the number of nodes in the network, the features experimentally observed in the electrical conduction properties of nanostructured gold films are qualitatively reproduced in the dynamical behavior of the system. In the activated non-linear conduction regime, our model reproduces also the growing trend, as a function of the subsystem size, of quantities like Mutual and Integrated Information, which have been extracted from the experimental resistance series data via an information theoretic analysis. This indicates that nanostructured Au films (and our model) possess a certain degree of activated interconnection among different areas which, in principle, could be exploited for neuromorphic computing applications.

| S-EPMC9294002 | biostudies-literature

Origin of exponential growth in nonlinear reaction networks.

Project description:Exponentially growing systems are prevalent in nature, spanning all scales from biochemical reaction networks in single cells to food webs of ecosystems. How exponential growth emerges in nonlinear systems is mathematically unclear. Here, we describe a general theoretical framework that reveals underlying principles of long-term growth: scalability of flux functions and ergodicity of the rescaled systems. Our theory shows that nonlinear fluxes can generate not only balanced growth but also oscillatory or chaotic growth modalities, explaining nonequilibrium dynamics observed in cell cycles and ecosystems. Our mathematical framework is broadly useful in predicting long-term growth rates from natural and synthetic networks, analyzing the effects of system noise and perturbations, validating empirical and phenomenological laws on growth rate, and studying autocatalysis and network evolution.

| S-EPMC7668091 | biostudies-literature

Stochastic EM algorithm for generalized exponential cure rate model and an empirical study.

Project description:In this paper, we consider two well-known parametric long-term survival models, namely, the Bernoulli cure rate model and the promotion time (or Poisson) cure rate model. Assuming the long-term survival probability to depend on a set of risk factors, the main contribution is in the development of the stochastic expectation maximization (SEM) algorithm to determine the maximum likelihood estimates of the model parameters. We carry out a detailed simulation study to demonstrate the performance of the proposed SEM algorithm. For this purpose, we assume the lifetimes due to each competing cause to follow a two-parameter generalized exponential distribution. We also compare the results obtained from the SEM algorithm with those obtained from the well-known expectation maximization (EM) algorithm. Furthermore, we investigate a simplified estimation procedure for both SEM and EM algorithms that allow the objective function to be maximized to split into simpler functions with lower dimensions with respect to model parameters. Moreover, we present examples where the EM algorithm fails to converge but the SEM algorithm still works. For illustrative purposes, we analyze a breast cancer survival data. Finally, we use a graphical method to assess the goodness-of-fit of the model with generalized exponential lifetimes.

| S-EPMC9041914 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data