Adaptive Asymptotical Synchronization for Stochastic Complex Networks with Time-Delay and Markovian Switching

Directory of Open Access Journals (Sweden)

Xueling Jiang

2014-01-01

Full Text Available The problem of adaptive asymptotical synchronization is discussed for the stochastic complex dynamical networks with time-delay and Markovian switching. By applying the stochastic analysis approach and the M-matrix method for stochastic complex networks, several sufficient conditions to ensure adaptive asymptotical synchronization for stochastic complex networks are derived. Through the adaptive feedback control techniques, some suitable parameters update laws are obtained. Simulation result is provided to substantiate the effectiveness and characteristics of the proposed approach.

Exact norm-conserving stochastic time-dependent Hartree-Fock

International Nuclear Information System (INIS)

Tessieri, Luca; Wilkie, Joshua; Cetinbas, Murat

2005-01-01

We derive an exact single-body decomposition of the time-dependent Schroedinger equation for N pairwise interacting fermions. Each fermion obeys a stochastic time-dependent norm-preserving wave equation. As a first test of the method, we calculate the low energy spectrum of helium. An extension of the method to bosons is outlined

Global synchronization of general delayed complex networks with stochastic disturbances

International Nuclear Information System (INIS)

Tu Li-Lan

2011-01-01

In this paper, global synchronization of general delayed complex networks with stochastic disturbances, which is a zero-mean real scalar Wiener process, is investigated. The networks under consideration are continuous-time networks with time-varying delay. Based on the stochastic Lyapunov stability theory, Ito's differential rule and the linear matrix inequality (LMI) optimization technique, several delay-dependent synchronous criteria are established, which guarantee the asymptotical mean-square synchronization of drive networks and response networks with stochastic disturbances. The criteria are expressed in terms of LMI, which can be easily solved using the Matlab LMI Control Toolbox. Finally, two examples show the effectiveness and feasibility of the proposed synchronous conditions. (general)

Robustness Analysis of Hybrid Stochastic Neural Networks with Neutral Terms and Time-Varying Delays

Directory of Open Access Journals (Sweden)

Chunmei Wu

2015-01-01

Full Text Available We analyze the robustness of global exponential stability of hybrid stochastic neural networks subject to neutral terms and time-varying delays simultaneously. Given globally exponentially stable hybrid stochastic neural networks, we characterize the upper bounds of contraction coefficients of neutral terms and time-varying delays by using the transcendental equation. Moreover, we prove theoretically that, for any globally exponentially stable hybrid stochastic neural networks, if additive neutral terms and time-varying delays are smaller than the upper bounds arrived, then the perturbed neural networks are guaranteed to also be globally exponentially stable. Finally, a numerical simulation example is given to illustrate the presented criteria.

Exponential Antisynchronization Control of Stochastic Memristive Neural Networks with Mixed Time-Varying Delays Based on Novel Delay-Dependent or Delay-Independent Adaptive Controller

Directory of Open Access Journals (Sweden)

Minghui Yu

2017-01-01

Full Text Available The global exponential antisynchronization in mean square of memristive neural networks with stochastic perturbation and mixed time-varying delays is studied in this paper. Then, two kinds of novel delay-dependent and delay-independent adaptive controllers are designed. With the ability of adapting to environment changes, the proposed controllers can modify their behaviors to achieve the best performance. In particular, on the basis of the differential inclusions theory, inequality theory, and stochastic analysis techniques, several sufficient conditions are obtained to guarantee the exponential antisynchronization between the drive system and response system. Furthermore, two numerical simulation examples are provided to the validity of the derived criteria.

Global exponential stability of neutral high-order stochastic Hopfield neural networks with Markovian jump parameters and mixed time delays.

Science.gov (United States)

Huang, Haiying; Du, Qiaosheng; Kang, Xibing

2013-11-01

In this paper, a class of neutral high-order stochastic Hopfield neural networks with Markovian jump parameters and mixed time delays is investigated. The jumping parameters are modeled as a continuous-time finite-state Markov chain. At first, the existence of equilibrium point for the addressed neural networks is studied. By utilizing the Lyapunov stability theory, stochastic analysis theory and linear matrix inequality (LMI) technique, new delay-dependent stability criteria are presented in terms of linear matrix inequalities to guarantee the neural networks to be globally exponentially stable in the mean square. Numerical simulations are carried out to illustrate the main results. © 2013 ISA. Published by ISA. All rights reserved.

Improved result on stability analysis of discrete stochastic neural networks with time delay

International Nuclear Information System (INIS)

Wu Zhengguang; Su Hongye; Chu Jian; Zhou Wuneng

2009-01-01

This Letter investigates the problem of exponential stability for discrete stochastic time-delay neural networks. By defining a novel Lyapunov functional, an improved delay-dependent exponential stability criterion is established in terms of linear matrix inequality (LMI) approach. Meanwhile, the computational complexity of the newly established stability condition is reduced because less variables are involved. Numerical example is given to illustrate the effectiveness and the benefits of the proposed method.

H∞ state estimation of stochastic memristor-based neural networks with time-varying delays.

Science.gov (United States)

Bao, Haibo; Cao, Jinde; Kurths, Jürgen; Alsaedi, Ahmed; Ahmad, Bashir

2018-03-01

This paper addresses the problem of H ∞ state estimation for a class of stochastic memristor-based neural networks with time-varying delays. Under the framework of Filippov solution, the stochastic memristor-based neural networks are transformed into systems with interval parameters. The present paper is the first to investigate the H ∞ state estimation problem for continuous-time Itô-type stochastic memristor-based neural networks. By means of Lyapunov functionals and some stochastic technique, sufficient conditions are derived to ensure that the estimation error system is asymptotically stable in the mean square with a prescribed H ∞ performance. An explicit expression of the state estimator gain is given in terms of linear matrix inequalities (LMIs). Compared with other results, our results reduce control gain and control cost effectively. Finally, numerical simulations are provided to demonstrate the efficiency of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

Eco-reliable path finding in time-variant and stochastic networks

International Nuclear Information System (INIS)

Li, Wenjie; Yang, Lixing; Wang, Li; Zhou, Xuesong; Liu, Ronghui; Gao, Ziyou

2017-01-01

This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm. - Highlights: • The most eco-reliable path is defined in time-variant and stochastic networks. • The model is developed with on-time arrival probability and emission constraints. • The sub-gradient and label correcting algorithm are integrated to solve the model. • Numerical experiments demonstrate the effectiveness of developed approaches.

Synchronization of Markovian jumping stochastic complex networks with distributed time delays and probabilistic interval discrete time-varying delays

International Nuclear Information System (INIS)

Li Hongjie; Yue Dong

2010-01-01

The paper investigates the synchronization stability problem for a class of complex dynamical networks with Markovian jumping parameters and mixed time delays. The complex networks consist of m modes and the networks switch from one mode to another according to a Markovian chain with known transition probability. The mixed time delays are composed of discrete and distributed delays, the discrete time delay is assumed to be random and its probability distribution is known a priori. In terms of the probability distribution of the delays, the new type of system model with probability-distribution-dependent parameter matrices is proposed. Based on the stochastic analysis techniques and the properties of the Kronecker product, delay-dependent synchronization stability criteria in the mean square are derived in the form of linear matrix inequalities which can be readily solved by using the LMI toolbox in MATLAB, the solvability of derived conditions depends on not only the size of the delay, but also the probability of the delay-taking values in some intervals. Finally, a numerical example is given to illustrate the feasibility and effectiveness of the proposed method.

Robust stability for uncertain stochastic fuzzy BAM neural networks with time-varying delays

Science.gov (United States)

Syed Ali, M.; Balasubramaniam, P.

2008-07-01

In this Letter, by utilizing the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, we analyze the global asymptotic stability of uncertain stochastic fuzzy Bidirectional Associative Memory (BAM) neural networks with time-varying delays which are represented by the Takagi-Sugeno (TS) fuzzy models. A new class of uncertain stochastic fuzzy BAM neural networks with time varying delays has been studied and sufficient conditions have been derived to obtain conservative result in stochastic settings. The developed results are more general than those reported in the earlier literatures. In addition, the numerical examples are provided to illustrate the applicability of the result using LMI toolbox in MATLAB.

Robust stability for uncertain stochastic fuzzy BAM neural networks with time-varying delays

International Nuclear Information System (INIS)

Syed Ali, M.; Balasubramaniam, P.

2008-01-01

In this Letter, by utilizing the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, we analyze the global asymptotic stability of uncertain stochastic fuzzy Bidirectional Associative Memory (BAM) neural networks with time-varying delays which are represented by the Takagi-Sugeno (TS) fuzzy models. A new class of uncertain stochastic fuzzy BAM neural networks with time varying delays has been studied and sufficient conditions have been derived to obtain conservative result in stochastic settings. The developed results are more general than those reported in the earlier literatures. In addition, the numerical examples are provided to illustrate the applicability of the result using LMI toolbox in MATLAB

Continuous-time random walks on networks with vertex- and time-dependent forcing.

Science.gov (United States)

Angstmann, C N; Donnelly, I C; Henry, B I; Langlands, T A M

2013-08-01

We have investigated the transport of particles moving as random walks on the vertices of a network, subject to vertex- and time-dependent forcing. We have derived the generalized master equations for this transport using continuous time random walks, characterized by jump and waiting time densities, as the underlying stochastic process. The forcing is incorporated through a vertex- and time-dependent bias in the jump densities governing the random walking particles. As a particular case, we consider particle forcing proportional to the concentration of particles on adjacent vertices, analogous to self-chemotactic attraction in a spatial continuum. Our algebraic and numerical studies of this system reveal an interesting pair-aggregation pattern formation in which the steady state is composed of a high concentration of particles on a small number of isolated pairs of adjacent vertices. The steady states do not exhibit this pair aggregation if the transport is random on the vertices, i.e., without forcing. The manifestation of pair aggregation on a transport network may thus be a signature of self-chemotactic-like forcing.

Hill functions for stochastic gene regulatory networks from master equations with split nodes and time-scale separation

Science.gov (United States)

Lipan, Ovidiu; Ferwerda, Cameron

2018-02-01

The deterministic Hill function depends only on the average values of molecule numbers. To account for the fluctuations in the molecule numbers, the argument of the Hill function needs to contain the means, the standard deviations, and the correlations. Here we present a method that allows for stochastic Hill functions to be constructed from the dynamical evolution of stochastic biocircuits with specific topologies. These stochastic Hill functions are presented in a closed analytical form so that they can be easily incorporated in models for large genetic regulatory networks. Using a repressive biocircuit as an example, we show by Monte Carlo simulations that the traditional deterministic Hill function inaccurately predicts time of repression by an order of two magnitudes. However, the stochastic Hill function was able to capture the fluctuations and thus accurately predicted the time of repression.

Robust stability for stochastic bidirectional associative memory neural networks with time delays

Science.gov (United States)

Shu, H. S.; Lv, Z. W.; Wei, G. L.

2008-02-01

In this paper, the asymptotic stability is considered for a class of uncertain stochastic bidirectional associative memory neural networks with time delays and parameter uncertainties. The delays are time-invariant and the uncertainties are norm-bounded that enter into all network parameters. The aim of this paper is to establish easily verifiable conditions under which the delayed neural network is robustly asymptotically stable in the mean square for all admissible parameter uncertainties. By employing a Lyapunov-Krasovskii functional and conducting the stochastic analysis, a linear matrix inequality matrix inequality (LMI) approach is developed to derive the stability criteria. The proposed criteria can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed criteria.

Reduced linear noise approximation for biochemical reaction networks with time-scale separation: The stochastic tQSSA+

Science.gov (United States)

Herath, Narmada; Del Vecchio, Domitilla

2018-03-01

Biochemical reaction networks often involve reactions that take place on different time scales, giving rise to "slow" and "fast" system variables. This property is widely used in the analysis of systems to obtain dynamical models with reduced dimensions. In this paper, we consider stochastic dynamics of biochemical reaction networks modeled using the Linear Noise Approximation (LNA). Under time-scale separation conditions, we obtain a reduced-order LNA that approximates both the slow and fast variables in the system. We mathematically prove that the first and second moments of this reduced-order model converge to those of the full system as the time-scale separation becomes large. These mathematical results, in particular, provide a rigorous justification to the accuracy of LNA models derived using the stochastic total quasi-steady state approximation (tQSSA). Since, in contrast to the stochastic tQSSA, our reduced-order model also provides approximations for the fast variable stochastic properties, we term our method the "stochastic tQSSA+". Finally, we demonstrate the application of our approach on two biochemical network motifs found in gene-regulatory and signal transduction networks.

Multimodal Network Equilibrium with Stochastic Travel Times

Directory of Open Access Journals (Sweden)

M. Meng

2014-01-01

Full Text Available The private car, unlike public traffic modes (e.g., subway, trolley running along dedicated track-ways, is invariably subject to various uncertainties resulting in travel time variation. A multimodal network equilibrium model is formulated that explicitly considers stochastic link capacity variability in the road network. The travel time of combined-mode trips is accumulated based on the concept of the mean excess travel time (METT which is a summation of estimated buffer time and tardy time. The problem is characterized by an equivalent VI (variational inequality formulation where the mode choice is expressed in a hierarchical logit structure. Specifically, the supernetwork theory and expansion technique are used herein to represent the multimodal transportation network, which completely represents the combined-mode trips as constituting multiple modes within a trip. The method of successive weighted average is adopted for problem solutions. The model and solution method are further applied to study the trip distribution and METT variations caused by the different levels of the road conditions. Results of numerical examples show that travelers prefer to choose the combined travel mode as road capacity decreases. Travelers with different attitudes towards risk are shown to exhibit significant differences when making travel choice decisions.

Neural network connectivity and response latency modelled by stochastic processes

DEFF Research Database (Denmark)

Tamborrino, Massimiliano

is connected to thousands of other neurons. The rst question is: how to model neural networks through stochastic processes? A multivariate Ornstein-Uhlenbeck process, obtained as a diffusion approximation of a jump process, is the proposed answer. Obviously, dependencies between neurons imply dependencies......Stochastic processes and their rst passage times have been widely used to describe the membrane potential dynamics of single neurons and to reproduce neuronal spikes, respectively.However, cerebral cortex in human brains is estimated to contain 10-20 billions of neurons and each of them...... between their spike times. Therefore, the second question is: how to detect neural network connectivity from simultaneously recorded spike trains? Answering this question corresponds to investigate the joint distribution of sequences of rst passage times. A non-parametric method based on copulas...

Volatility Degree Forecasting of Stock Market by Stochastic Time Strength Neural Network

Directory of Open Access Journals (Sweden)

Haiyan Mo

2013-01-01

Full Text Available In view of the applications of artificial neural networks in economic and financial forecasting, a stochastic time strength function is introduced in the backpropagation neural network model to predict the fluctuations of stock price changes. In this model, stochastic time strength function gives a weight for each historical datum and makes the model have the effect of random movement, and then we investigate and forecast the behavior of volatility degrees of returns for the Chinese stock market indexes and some global market indexes. The empirical research is performed in testing the prediction effect of SSE, SZSE, HSI, DJIA, IXIC, and S&P 500 with different selected volatility degrees in the established model.

Stabilization Strategies of Supply Networks with Stochastic Switched Topology

Directory of Open Access Journals (Sweden)

Shukai Li

2013-01-01

Full Text Available In this paper, a dynamical supply networks model with stochastic switched topology is presented, in which the stochastic switched topology is dependent on a continuous time Markov process. The goal is to design the state-feedback control strategies to stabilize the dynamical supply networks. Based on Lyapunov stability theory, sufficient conditions for the existence of state feedback control strategies are given in terms of matrix inequalities, which ensure the robust stability of the supply networks at the stationary states and a prescribed H∞ disturbance attenuation level with respect to the uncertain demand. A numerical example is given to illustrate the effectiveness of the proposed method.

H∞ state estimation for discrete-time memristive recurrent neural networks with stochastic time-delays

Science.gov (United States)

Liu, Hongjian; Wang, Zidong; Shen, Bo; Alsaadi, Fuad E.

2016-07-01

This paper deals with the robust H∞ state estimation problem for a class of memristive recurrent neural networks with stochastic time-delays. The stochastic time-delays under consideration are governed by a Bernoulli-distributed stochastic sequence. The purpose of the addressed problem is to design the robust state estimator such that the dynamics of the estimation error is exponentially stable in the mean square, and the prescribed ? performance constraint is met. By utilizing the difference inclusion theory and choosing a proper Lyapunov-Krasovskii functional, the existence condition of the desired estimator is derived. Based on it, the explicit expression of the estimator gain is given in terms of the solution to a linear matrix inequality. Finally, a numerical example is employed to demonstrate the effectiveness and applicability of the proposed estimation approach.

Stability analysis for discrete-time stochastic memristive neural networks with both leakage and probabilistic delays.

Science.gov (United States)

Liu, Hongjian; Wang, Zidong; Shen, Bo; Huang, Tingwen; Alsaadi, Fuad E

2018-06-01

This paper is concerned with the globally exponential stability problem for a class of discrete-time stochastic memristive neural networks (DSMNNs) with both leakage delays as well as probabilistic time-varying delays. For the probabilistic delays, a sequence of Bernoulli distributed random variables is utilized to determine within which intervals the time-varying delays fall at certain time instant. The sector-bounded activation function is considered in the addressed DSMNN. By taking into account the state-dependent characteristics of the network parameters and choosing an appropriate Lyapunov-Krasovskii functional, some sufficient conditions are established under which the underlying DSMNN is globally exponentially stable in the mean square. The derived conditions are made dependent on both the leakage and the probabilistic delays, and are therefore less conservative than the traditional delay-independent criteria. A simulation example is given to show the effectiveness of the proposed stability criterion. Copyright © 2018 Elsevier Ltd. All rights reserved.

New Results on Passivity Analysis of Stochastic Neural Networks with Time-Varying Delay and Leakage Delay

Directory of Open Access Journals (Sweden)

YaJun Li

2015-01-01

Full Text Available The passivity problem for a class of stochastic neural networks systems (SNNs with varying delay and leakage delay has been further studied in this paper. By constructing a more effective Lyapunov functional, employing the free-weighting matrix approach, and combining with integral inequality technic and stochastic analysis theory, the delay-dependent conditions have been proposed such that SNNs are asymptotically stable with guaranteed performance. The time-varying delay is divided into several subintervals and two adjustable parameters are introduced; more information about time delay is utilised and less conservative results have been obtained. Examples are provided to illustrate the less conservatism of the proposed method and simulations are given to show the impact of leakage delay on stability of SNNs.

Finite-Time Nonfragile Synchronization of Stochastic Complex Dynamical Networks with Semi-Markov Switching Outer Coupling

Directory of Open Access Journals (Sweden)

Rathinasamy Sakthivel

2018-01-01

Full Text Available The problem of robust nonfragile synchronization is investigated in this paper for a class of complex dynamical networks subject to semi-Markov jumping outer coupling, time-varying coupling delay, randomly occurring gain variation, and stochastic noise over a desired finite-time interval. In particular, the network topology is assumed to follow a semi-Markov process such that it may switch from one to another at different instants. In this paper, the random gain variation is represented by a stochastic variable that is assumed to satisfy the Bernoulli distribution with white sequences. Based on these hypotheses and the Lyapunov-Krasovskii stability theory, a new finite-time stochastic synchronization criterion is established for the considered network in terms of linear matrix inequalities. Moreover, the control design parameters that guarantee the required criterion are computed by solving a set of linear matrix inequality constraints. An illustrative example is finally given to show the effectiveness and advantages of the developed analytical results.

Stochastic resonance in small-world neuronal networks with hybrid electrical–chemical synapses

International Nuclear Information System (INIS)

Wang, Jiang; Guo, Xinmeng; Yu, Haitao; Liu, Chen; Deng, Bin; Wei, Xile; Chen, Yingyuan

2014-01-01

Highlights: •We study stochastic resonance in small-world neural networks with hybrid synapses. •The resonance effect depends largely on the probability of chemical synapse. •An optimal chemical synapse probability exists to evoke network resonance. •Network topology affects the stochastic resonance in hybrid neuronal networks. - Abstract: The dependence of stochastic resonance in small-world neuronal networks with hybrid electrical–chemical synapses on the probability of chemical synapse and the rewiring probability is investigated. A subthreshold periodic signal is imposed on one single neuron within the neuronal network as a pacemaker. It is shown that, irrespective of the probability of chemical synapse, there exists a moderate intensity of external noise optimizing the response of neuronal networks to the pacemaker. Moreover, the effect of pacemaker driven stochastic resonance of the system depends largely on the probability of chemical synapse. A high probability of chemical synapse will need lower noise intensity to evoke the phenomenon of stochastic resonance in the networked neuronal systems. In addition, for fixed noise intensity, there is an optimal chemical synapse probability, which can promote the propagation of the localized subthreshold pacemaker across neural networks. And the optimal chemical synapses probability turns even larger as the coupling strength decreases. Furthermore, the small-world topology has a significant impact on the stochastic resonance in hybrid neuronal networks. It is found that increasing the rewiring probability can always enhance the stochastic resonance until it approaches the random network limit

Forecasting financial asset processes: stochastic dynamics via learning neural networks.

Science.gov (United States)

Giebel, S; Rainer, M

2010-01-01

Models for financial asset dynamics usually take into account their inherent unpredictable nature by including a suitable stochastic component into their process. Unknown (forward) values of financial assets (at a given time in the future) are usually estimated as expectations of the stochastic asset under a suitable risk-neutral measure. This estimation requires the stochastic model to be calibrated to some history of sufficient length in the past. Apart from inherent limitations, due to the stochastic nature of the process, the predictive power is also limited by the simplifying assumptions of the common calibration methods, such as maximum likelihood estimation and regression methods, performed often without weights on the historic time series, or with static weights only. Here we propose a novel method of "intelligent" calibration, using learning neural networks in order to dynamically adapt the parameters of the stochastic model. Hence we have a stochastic process with time dependent parameters, the dynamics of the parameters being themselves learned continuously by a neural network. The back propagation in training the previous weights is limited to a certain memory length (in the examples we consider 10 previous business days), which is similar to the maximal time lag of autoregressive processes. We demonstrate the learning efficiency of the new algorithm by tracking the next-day forecasts for the EURTRY and EUR-HUF exchange rates each.

Stochastic modeling and analysis of telecoms networks

CERN Document Server

Decreusefond, Laurent

2012-01-01

This book addresses the stochastic modeling of telecommunication networks, introducing the main mathematical tools for that purpose, such as Markov processes, real and spatial point processes and stochastic recursions, and presenting a wide list of results on stability, performances and comparison of systems.The authors propose a comprehensive mathematical construction of the foundations of stochastic network theory: Markov chains, continuous time Markov chains are extensively studied using an original martingale-based approach. A complete presentation of stochastic recursions from an

Stochastic analysis of epidemics on adaptive time varying networks

Science.gov (United States)

Kotnis, Bhushan; Kuri, Joy

2013-06-01

Many studies investigating the effect of human social connectivity structures (networks) and human behavioral adaptations on the spread of infectious diseases have assumed either a static connectivity structure or a network which adapts itself in response to the epidemic (adaptive networks). However, human social connections are inherently dynamic or time varying. Furthermore, the spread of many infectious diseases occur on a time scale comparable to the time scale of the evolving network structure. Here we aim to quantify the effect of human behavioral adaptations on the spread of asymptomatic infectious diseases on time varying networks. We perform a full stochastic analysis using a continuous time Markov chain approach for calculating the outbreak probability, mean epidemic duration, epidemic reemergence probability, etc. Additionally, we use mean-field theory for calculating epidemic thresholds. Theoretical predictions are verified using extensive simulations. Our studies have uncovered the existence of an “adaptive threshold,” i.e., when the ratio of susceptibility (or infectivity) rate to recovery rate is below the threshold value, adaptive behavior can prevent the epidemic. However, if it is above the threshold, no amount of behavioral adaptations can prevent the epidemic. Our analyses suggest that the interaction patterns of the infected population play a major role in sustaining the epidemic. Our results have implications on epidemic containment policies, as awareness campaigns and human behavioral responses can be effective only if the interaction levels of the infected populace are kept in check.

On time-dependent diffusion coefficients arising from stochastic processes with memory

Science.gov (United States)

Carpio-Bernido, M. Victoria; Barredo, Wilson I.; Bernido, Christopher C.

2017-08-01

Time-dependent diffusion coefficients arise from anomalous diffusion encountered in many physical systems such as protein transport in cells. We compare these coefficients with those arising from analysis of stochastic processes with memory that go beyond fractional Brownian motion. Facilitated by the Hida white noise functional integral approach, diffusion propagators or probability density functions (pdf) are obtained and shown to be solutions of modified diffusion equations with time-dependent diffusion coefficients. This should be useful in the study of complex transport processes.

The Ising Decision Maker: a binary stochastic network for choice response time.

Science.gov (United States)

Verdonck, Stijn; Tuerlinckx, Francis

2014-07-01

The Ising Decision Maker (IDM) is a new formal model for speeded two-choice decision making derived from the stochastic Hopfield network or dynamic Ising model. On a microscopic level, it consists of 2 pools of binary stochastic neurons with pairwise interactions. Inside each pool, neurons excite each other, whereas between pools, neurons inhibit each other. The perceptual input is represented by an external excitatory field. Using methods from statistical mechanics, the high-dimensional network of neurons (microscopic level) is reduced to a two-dimensional stochastic process, describing the evolution of the mean neural activity per pool (macroscopic level). The IDM can be seen as an abstract, analytically tractable multiple attractor network model of information accumulation. In this article, the properties of the IDM are studied, the relations to existing models are discussed, and it is shown that the most important basic aspects of two-choice response time data can be reproduced. In addition, the IDM is shown to predict a variety of observed psychophysical relations such as Piéron's law, the van der Molen-Keuss effect, and Weber's law. Using Bayesian methods, the model is fitted to both simulated and real data, and its performance is compared to the Ratcliff diffusion model. (c) 2014 APA, all rights reserved.

Time-ordered product expansions for computational stochastic system biology

International Nuclear Information System (INIS)

Mjolsness, Eric

2013-01-01

The time-ordered product framework of quantum field theory can also be used to understand salient phenomena in stochastic biochemical networks. It is used here to derive Gillespie’s stochastic simulation algorithm (SSA) for chemical reaction networks; consequently, the SSA can be interpreted in terms of Feynman diagrams. It is also used here to derive other, more general simulation and parameter-learning algorithms including simulation algorithms for networks of stochastic reaction-like processes operating on parameterized objects, and also hybrid stochastic reaction/differential equation models in which systems of ordinary differential equations evolve the parameters of objects that can also undergo stochastic reactions. Thus, the time-ordered product expansion can be used systematically to derive simulation and parameter-fitting algorithms for stochastic systems. (paper)

Stochastic Wilson–Cowan models of neuronal network dynamics with memory and delay

International Nuclear Information System (INIS)

Goychuk, Igor; Goychuk, Andriy

2015-01-01

We consider a simple Markovian class of the stochastic Wilson–Cowan type models of neuronal network dynamics, which incorporates stochastic delay caused by the existence of a refractory period of neurons. From the point of view of the dynamics of the individual elements, we are dealing with a network of non-Markovian stochastic two-state oscillators with memory, which are coupled globally in a mean-field fashion. This interrelation of a higher-dimensional Markovian and lower-dimensional non-Markovian dynamics is discussed in its relevance to the general problem of the network dynamics of complex elements possessing memory. The simplest model of this class is provided by a three-state Markovian neuron with one refractory state, which causes firing delay with an exponentially decaying memory within the two-state reduced model. This basic model is used to study critical avalanche dynamics (the noise sustained criticality) in a balanced feedforward network consisting of the excitatory and inhibitory neurons. Such avalanches emerge due to the network size dependent noise (mesoscopic noise). Numerical simulations reveal an intermediate power law in the distribution of avalanche sizes with the critical exponent around −1.16. We show that this power law is robust upon a variation of the refractory time over several orders of magnitude. However, the avalanche time distribution is biexponential. It does not reflect any genuine power law dependence. (paper)

A multi-stage stochastic program for supply chain network redesign problem with price-dependent uncertain demands

DEFF Research Database (Denmark)

Fattahi, Mohammad; Govindan, Kannan; Keyvanshokooh, Esmaeil

2018-01-01

In this paper, we address a multi-period supply chain network redesign problem in which customer zones have price-dependent stochastic demand for multiple products. A novel multi-stage stochastic program is proposed to simultaneously make tactical decisions including products' prices and strategic...... redesign decisions. Existing uncertainty in potential demands of customer zones is modeled through a finite set of scenarios, described in the form of a scenario tree. The scenarios are generated using a Latin Hypercube Sampling method and then a forward scenario construction technique is employed...

Delay-distribution-dependent H∞ state estimation for delayed neural networks with (x,v)-dependent noises and fading channels.

Science.gov (United States)

Sheng, Li; Wang, Zidong; Tian, Engang; Alsaadi, Fuad E

2016-12-01

This paper deals with the H ∞ state estimation problem for a class of discrete-time neural networks with stochastic delays subject to state- and disturbance-dependent noises (also called (x,v)-dependent noises) and fading channels. The time-varying stochastic delay takes values on certain intervals with known probability distributions. The system measurement is transmitted through fading channels described by the Rice fading model. The aim of the addressed problem is to design a state estimator such that the estimation performance is guaranteed in the mean-square sense against admissible stochastic time-delays, stochastic noises as well as stochastic fading signals. By employing the stochastic analysis approach combined with the Kronecker product, several delay-distribution-dependent conditions are derived to ensure that the error dynamics of the neuron states is stochastically stable with prescribed H ∞ performance. Finally, a numerical example is provided to illustrate the effectiveness of the obtained results. Copyright © 2016 Elsevier Ltd. All rights reserved.

pth moment exponential stability of stochastic memristor-based bidirectional associative memory (BAM) neural networks with time delays.

Science.gov (United States)

Wang, Fen; Chen, Yuanlong; Liu, Meichun

2018-02-01

Stochastic memristor-based bidirectional associative memory (BAM) neural networks with time delays play an increasingly important role in the design and implementation of neural network systems. Under the framework of Filippov solutions, the issues of the pth moment exponential stability of stochastic memristor-based BAM neural networks are investigated. By using the stochastic stability theory, Itô's differential formula and Young inequality, the criteria are derived. Meanwhile, with Lyapunov approach and Cauchy-Schwarz inequality, we derive some sufficient conditions for the mean square exponential stability of the above systems. The obtained results improve and extend previous works on memristor-based or usual neural networks dynamical systems. Four numerical examples are provided to illustrate the effectiveness of the proposed results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Fault Detection for Wireless Networked Control Systems with Stochastic Switching Topology and Time Delay

Directory of Open Access Journals (Sweden)

Pengfei Guo

2014-01-01

Full Text Available This paper deals with the fault detection problem for a class of discrete-time wireless networked control systems described by switching topology with uncertainties and disturbances. System states of each individual node are affected not only by its own measurements, but also by other nodes’ measurements according to a certain network topology. As the topology of system can be switched in a stochastic way, we aim to design H∞ fault detection observers for nodes in the dynamic time-delay systems. By using the Lyapunov method and stochastic analysis techniques, sufficient conditions are acquired to guarantee the existence of the filters satisfying the H∞ performance constraint, and observer gains are derived by solving linear matrix inequalities. Finally, an illustrated example is provided to verify the effectiveness of the theoretical results.

Uncertainty Reduction for Stochastic Processes on Complex Networks

Science.gov (United States)

Radicchi, Filippo; Castellano, Claudio

2018-05-01

Many real-world systems are characterized by stochastic dynamical rules where a complex network of interactions among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the stochastic rules, the ability to predict system configurations is generally characterized by a large uncertainty. Selecting a fraction of the nodes and observing their state may help to reduce the uncertainty about the unobserved nodes. However, choosing these points of observation in an optimal way is a highly nontrivial task, depending on the nature of the stochastic process and on the structure of the underlying interaction pattern. In this paper, we introduce a computationally efficient algorithm to determine quasioptimal solutions to the problem. The method leverages network sparsity to reduce computational complexity from exponential to almost quadratic, thus allowing the straightforward application of the method to mid-to-large-size systems. Although the method is exact only for equilibrium stochastic processes defined on trees, it turns out to be effective also for out-of-equilibrium processes on sparse loopy networks.

Event-Triggered Faults Tolerant Control for Stochastic Systems with Time Delays

Directory of Open Access Journals (Sweden)

Ling Huang

2016-01-01

Full Text Available This paper is concerned with the state-feedback controller design for stochastic networked control systems (NCSs with random actuator failures and transmission delays. Firstly, an event-triggered scheme is introduced to optimize the performance of the stochastic NCSs. Secondly, stochastic NCSs under event-triggered scheme are modeled as stochastic time-delay systems. Thirdly, some less conservative delay-dependent stability criteria in terms of linear matrix inequalities for the codesign of both the controller gain and the trigger parameters are obtained by using delay-decomposition technique and convex combination approach. Finally, a numerical example is provided to show the less sampled data transmission and less conservatism of the proposed theory.

The Limit Behavior of a Stochastic Logistic Model with Individual Time-Dependent Rates

Directory of Open Access Journals (Sweden)

Yilun Shang

2013-01-01

Full Text Available We investigate a variant of the stochastic logistic model that allows individual variation and time-dependent infection and recovery rates. The model is described as a heterogeneous density dependent Markov chain. We show that the process can be approximated by a deterministic process defined by an integral equation as the population size grows.

Inverse stochastic resonance in networks of spiking neurons.

Science.gov (United States)

Uzuntarla, Muhammet; Barreto, Ernest; Torres, Joaquin J

2017-07-01

Inverse Stochastic Resonance (ISR) is a phenomenon in which the average spiking rate of a neuron exhibits a minimum with respect to noise. ISR has been studied in individual neurons, but here, we investigate ISR in scale-free networks, where the average spiking rate is calculated over the neuronal population. We use Hodgkin-Huxley model neurons with channel noise (i.e., stochastic gating variable dynamics), and the network connectivity is implemented via electrical or chemical connections (i.e., gap junctions or excitatory/inhibitory synapses). We find that the emergence of ISR depends on the interplay between each neuron's intrinsic dynamical structure, channel noise, and network inputs, where the latter in turn depend on network structure parameters. We observe that with weak gap junction or excitatory synaptic coupling, network heterogeneity and sparseness tend to favor the emergence of ISR. With inhibitory coupling, ISR is quite robust. We also identify dynamical mechanisms that underlie various features of this ISR behavior. Our results suggest possible ways of experimentally observing ISR in actual neuronal systems.

Network interdiction and stochastic integer programming

CERN Document Server

2003-01-01

On March 15, 2002 we held a workshop on network interdiction and the more general problem of stochastic mixed integer programming at the University of California, Davis. Jesús De Loera and I co-chaired the event, which included presentations of on-going research and discussion. At the workshop, we decided to produce a volume of timely work on the topics. This volume is the result. Each chapter represents state-of-the-art research and all of them were refereed by leading investigators in the respective fields. Problems - sociated with protecting and attacking computer, transportation, and social networks gain importance as the world becomes more dep- dent on interconnected systems. Optimization models that address the stochastic nature of these problems are an important part of the research agenda. This work relies on recent efforts to provide methods for - dressing stochastic mixed integer programs. The book is organized with interdiction papers first and the stochastic programming papers in the second part....

A note on "Multicriteria adaptive paths in stochastic, time-varying networks"

DEFF Research Database (Denmark)

Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan

In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property...... that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a parametric problem. We give a simplified algorithm which is linear in the input size....

Time-dependent stochastic inversion in acoustic tomography of the atmosphere with reciprocal sound transmission

International Nuclear Information System (INIS)

Vecherin, Sergey N; Ostashev, Vladimir E; Wilson, D Keith; Ziemann, A

2008-01-01

Time-dependent stochastic inversion (TDSI) was recently developed for acoustic travel-time tomography of the atmosphere. This type of tomography allows reconstruction of temperature and wind-velocity fields given the location of sound sources and receivers and the travel times between all source–receiver pairs. The quality of reconstruction provided by TDSI depends on the geometry of the transducer array. However, TDSI has not been studied for the geometry with reciprocal sound transmission. This paper is focused on three aspects of TDSI. First, the use of TDSI in reciprocal sound transmission arrays is studied in numerical and physical experiments. Second, efficiency of time-dependent and ordinary stochastic inversion (SI) algorithms is studied in numerical experiments. Third, a new model of noise in the input data for TDSI is developed that accounts for systematic errors in transducer positions. It is shown that (i) a separation of the travel times into temperature and wind-velocity components in tomography with reciprocal transmission does not improve the reconstruction, (ii) TDSI yields a better reconstruction than SI and (iii) the developed model of noise yields an accurate reconstruction of turbulent fields and estimation of errors in the reconstruction

Benchmarking the stochastic time-dependent variational approach for excitation dynamics in molecular aggregates

Energy Technology Data Exchange (ETDEWEB)

Chorošajev, Vladimir [Department of Theoretical Physics, Faculty of Physics, Vilnius University, Sauletekio 9-III, 10222 Vilnius (Lithuania); Gelzinis, Andrius; Valkunas, Leonas [Department of Theoretical Physics, Faculty of Physics, Vilnius University, Sauletekio 9-III, 10222 Vilnius (Lithuania); Department of Molecular Compound Physics, Center for Physical Sciences and Technology, Sauletekio 3, 10222 Vilnius (Lithuania); Abramavicius, Darius, E-mail: darius.abramavicius@ff.vu.lt [Department of Theoretical Physics, Faculty of Physics, Vilnius University, Sauletekio 9-III, 10222 Vilnius (Lithuania)

2016-12-20

Highlights: • The Davydov ansatze can be used for finite temperature simulations with an extension. • The accuracy is high if the system is strongly coupled to the environmental phonons. • The approach can simulate time-resolved fluorescence spectra. - Abstract: Time dependent variational approach is a convenient method to characterize the excitation dynamics in molecular aggregates for different strengths of system-bath interaction a, which does not require any additional perturbative schemes. Until recently, however, this method was only applicable in zero temperature case. It has become possible to extend this method for finite temperatures with the introduction of stochastic time dependent variational approach. Here we present a comparison between this approach and the exact hierarchical equations of motion approach for describing excitation dynamics in a broad range of temperatures. We calculate electronic population evolution, absorption and auxiliary time resolved fluorescence spectra in different regimes and find that the stochastic approach shows excellent agreement with the exact approach when the system-bath coupling is sufficiently large and temperatures are high. The differences between the two methods are larger, when temperatures are lower or the system-bath coupling is small.

ON THE ANISOTROPIC NORM OF DISCRETE TIME STOCHASTIC SYSTEMS WITH STATE DEPENDENT NOISE

Directory of Open Access Journals (Sweden)

Isaac Yaesh

2013-01-01

Full Text Available The purpose of this paper is to determine conditions for the bound-edness of the anisotropic norm of discrete-time linear stochastic sys-tems with state dependent noise. It is proved that these conditions canbe expressed in terms of the feasibility of a specific system of matrixinequalities.

Stability analysis for stochastic BAM nonlinear neural network with delays

Science.gov (United States)

Lv, Z. W.; Shu, H. S.; Wei, G. L.

2008-02-01

In this paper, stochastic bidirectional associative memory neural networks with constant or time-varying delays is considered. Based on a Lyapunov-Krasovskii functional and the stochastic stability analysis theory, we derive several sufficient conditions in order to guarantee the global asymptotically stable in the mean square. Our investigation shows that the stochastic bidirectional associative memory neural networks are globally asymptotically stable in the mean square if there are solutions to some linear matrix inequalities(LMIs). Hence, the global asymptotic stability of the stochastic bidirectional associative memory neural networks can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed global asymptotic stability criteria.

Stability analysis for stochastic BAM nonlinear neural network with delays

International Nuclear Information System (INIS)

Lv, Z W; Shu, H S; Wei, G L

2008-01-01

In this paper, stochastic bidirectional associative memory neural networks with constant or time-varying delays is considered. Based on a Lyapunov-Krasovskii functional and the stochastic stability analysis theory, we derive several sufficient conditions in order to guarantee the global asymptotically stable in the mean square. Our investigation shows that the stochastic bidirectional associative memory neural networks are globally asymptotically stable in the mean square if there are solutions to some linear matrix inequalities(LMIs). Hence, the global asymptotic stability of the stochastic bidirectional associative memory neural networks can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed global asymptotic stability criteria

On Stochastic Finite-Time Control of Discrete-Time Fuzzy Systems with Packet Dropout

Directory of Open Access Journals (Sweden)

Yingqi Zhang

2012-01-01

Full Text Available This paper is concerned with the stochastic finite-time stability and stochastic finite-time boundedness problems for one family of fuzzy discrete-time systems over networks with packet dropout, parametric uncertainties, and time-varying norm-bounded disturbance. Firstly, we present the dynamic model description studied, in which the discrete-time fuzzy T-S systems with packet loss can be described by one class of fuzzy Markovian jump systems. Then, the concepts of stochastic finite-time stability and stochastic finite-time boundedness and problem formulation are given. Based on Lyapunov function approach, sufficient conditions on stochastic finite-time stability and stochastic finite-time boundedness are established for the resulting closed-loop fuzzy discrete-time system with Markovian jumps, and state-feedback controllers are designed to ensure stochastic finite-time stability and stochastic finite-time boundedness of the class of fuzzy systems. The stochastic finite-time stability and stochastic finite-time boundedness criteria can be tackled in the form of linear matrix inequalities with a fixed parameter. As an auxiliary result, we also give sufficient conditions on the stochastic stability of the class of fuzzy T-S systems with packet loss. Finally, two illustrative examples are presented to show the validity of the developed methodology.

Robust stability analysis of uncertain stochastic neural networks with interval time-varying delay

International Nuclear Information System (INIS)

Feng Wei; Yang, Simon X.; Fu Wei; Wu Haixia

2009-01-01

This paper addresses the stability analysis problem for uncertain stochastic neural networks with interval time-varying delays. The parameter uncertainties are assumed to be norm bounded, and the delay factor is assumed to be time-varying and belong to a given interval, which means that the lower and upper bounds of interval time-varying delays are available. A sufficient condition is derived such that for all admissible uncertainties, the considered neural network is robustly, globally, asymptotically stable in the mean square. Some stability criteria are formulated by means of the feasibility of a linear matrix inequality (LMI), which can be effectively solved by some standard numerical packages. Finally, numerical examples are provided to demonstrate the usefulness of the proposed criteria.

Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Jacob, Rico

2001-01-01

We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models.......We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models....

A delay fractioning approach to global synchronization of delayed complex networks with stochastic disturbances

International Nuclear Information System (INIS)

Wang Yao; Wang Zidong; Liang Jinling

2008-01-01

In this Letter, the synchronization problem is investigated for a class of stochastic complex networks with time delays. By utilizing a new Lyapunov functional form based on the idea of 'delay fractioning', we employ the stochastic analysis techniques and the properties of Kronecker product to establish delay-dependent synchronization criteria that guarantee the globally asymptotically mean-square synchronization of the addressed delayed networks with stochastic disturbances. These sufficient conditions, which are formulated in terms of linear matrix inequalities (LMIs), can be solved efficiently by the LMI toolbox in Matlab. The main results are proved to be much less conservative and the conservatism could be reduced further as the number of delay fractioning gets bigger. A simulation example is exploited to demonstrate the advantage and applicability of the proposed result

Fixed-time synchronization of complex networks with nonidentical nodes and stochastic noise perturbations

Science.gov (United States)

Zhang, Wanli; Li, Chuandong; Huang, Tingwen; Huang, Junjian

2018-02-01

This paper investigates the fixed-time synchronization of complex networks (CNs) with nonidentical nodes and stochastic noise perturbations. By designing new controllers, constructing Lyapunov functions and using the properties of Weiner process, different synchronization criteria are derived according to whether the node systems in the CNs or the goal system satisfies the corresponding conditions. Moreover, the role of the designed controllers is analyzed in great detail by constructing a suitable comparison system and a new method is presented to estimate the settling time by utilizing the comparison system. Results of this paper can be applied to both directed and undirected weighted networks. Numerical simulations are offered to verify the effectiveness of our new results.

Biochemical Network Stochastic Simulator (BioNetS: software for stochastic modeling of biochemical networks

Directory of Open Access Journals (Sweden)

Elston Timothy C

2004-03-01

Full Text Available Abstract Background Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true for pathways that involve transcriptional regulation, where generally there are two copies of each gene and the number of messenger RNA (mRNA molecules can be small. Therefore, there is a need for computational tools for developing and investigating stochastic models of biochemical networks. Results We have developed the software package Biochemical Network Stochastic Simulator (BioNetS for efficientlyand accurately simulating stochastic models of biochemical networks. BioNetS has a graphical user interface that allows models to be entered in a straightforward manner, and allows the user to specify the type of random variable (discrete or continuous for each chemical species in the network. The discrete variables are simulated using an efficient implementation of the Gillespie algorithm. For the continuous random variables, BioNetS constructs and numerically solvesthe appropriate chemical Langevin equations. The software package has been developed to scale efficiently with network size, thereby allowing large systems to be studied. BioNetS runs as a BioSpice agent and can be downloaded from http://www.biospice.org. BioNetS also can be run as a stand alone package. All the required files are accessible from http://x.amath.unc.edu/BioNetS. Conclusions We have developed BioNetS to be a reliable tool for studying the stochastic dynamics of large biochemical networks. Important features of BioNetS are its ability to handle hybrid models that consist of both continuous and discrete random variables and its ability to model cell growth and division. We have verified the accuracy and efficiency of the numerical methods by considering several test systems.

On Stochastic Dependence

Science.gov (United States)

Meyer, Joerg M.

2018-01-01

The contrary of stochastic independence splits up into two cases: pairs of events being favourable or being unfavourable. Examples show that both notions have quite unexpected properties, some of them being opposite to intuition. For example, transitivity does not hold. Stochastic dependence is also useful to explain cases of Simpson's paradox.

Betweenness in time dependent networks

International Nuclear Information System (INIS)

Alsayed, Ahmad; Higham, Desmond J.

2015-01-01

The concept of betweenness has given rise to a very useful class of network centrality measures. Loosely, betweenness quantifies the level of importance of a node in terms of its propensity to act as an intermediary when messages are passed around the network. In this work we generalize a walk-based betweenness measure to the case of time-dependent networks, such as those arising in telecommunications and on-line social media. We also introduce a new kind of betweenness measure, temporal betweenness, which quantifies the importance of a time-point. We illustrate the effectiveness of these new measures on synthetic examples, and also give results on real data sets involving voice call, email and Twitter

Hybrid stochastic simplifications for multiscale gene networks

Directory of Open Access Journals (Sweden)

Debussche Arnaud

2009-09-01

Full Text Available Abstract Background Stochastic simulation of gene networks by Markov processes has important applications in molecular biology. The complexity of exact simulation algorithms scales with the number of discrete jumps to be performed. Approximate schemes reduce the computational time by reducing the number of simulated discrete events. Also, answering important questions about the relation between network topology and intrinsic noise generation and propagation should be based on general mathematical results. These general results are difficult to obtain for exact models. Results We propose a unified framework for hybrid simplifications of Markov models of multiscale stochastic gene networks dynamics. We discuss several possible hybrid simplifications, and provide algorithms to obtain them from pure jump processes. In hybrid simplifications, some components are discrete and evolve by jumps, while other components are continuous. Hybrid simplifications are obtained by partial Kramers-Moyal expansion 123 which is equivalent to the application of the central limit theorem to a sub-model. By averaging and variable aggregation we drastically reduce simulation time and eliminate non-critical reactions. Hybrid and averaged simplifications can be used for more effective simulation algorithms and for obtaining general design principles relating noise to topology and time scales. The simplified models reproduce with good accuracy the stochastic properties of the gene networks, including waiting times in intermittence phenomena, fluctuation amplitudes and stationary distributions. The methods are illustrated on several gene network examples. Conclusion Hybrid simplifications can be used for onion-like (multi-layered approaches to multi-scale biochemical systems, in which various descriptions are used at various scales. Sets of discrete and continuous variables are treated with different methods and are coupled together in a physically justified approach.

Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks

Directory of Open Access Journals (Sweden)

Liang Jinghang

2012-08-01

Full Text Available Abstract Background Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs. As a logical model, probabilistic Boolean networks (PBNs consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n or O(nN2n for a sparse matrix. Results This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN. An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n, where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a

Time-dependent solutions for stochastic systems with delays: Perturbation theory and applications to financial physics

International Nuclear Information System (INIS)

Frank, T.D.

2006-01-01

First-order approximations of time-dependent solutions are determined for stochastic systems perturbed by time-delayed feedback forces. To this end, the theory of delay Fokker-Planck equations is applied in combination with Bayes' theorem. Applications to a time-delayed Ornstein-Uhlenbeck process and the geometric Brownian walk of financial physics are discussed

Stochastic solution of population balance equations for reactor networks

International Nuclear Information System (INIS)

Menz, William J.; Akroyd, Jethro; Kraft, Markus

2014-01-01

This work presents a sequential modular approach to solve a generic network of reactors with a population balance model using a stochastic numerical method. Full-coupling to the gas-phase is achieved through operator-splitting. The convergence of the stochastic particle algorithm in test networks is evaluated as a function of network size, recycle fraction and numerical parameters. These test cases are used to identify methods through which systematic and statistical error may be reduced, including by use of stochastic weighted algorithms. The optimal algorithm was subsequently used to solve a one-dimensional example of silicon nanoparticle synthesis using a multivariate particle model. This example demonstrated the power of stochastic methods in resolving particle structure by investigating the transient and spatial evolution of primary polydispersity, degree of sintering and TEM-style images. Highlights: •An algorithm is presented to solve reactor networks with a population balance model. •A stochastic method is used to solve the population balance equations. •The convergence and efficiency of the reported algorithms are evaluated. •The algorithm is applied to simulate silicon nanoparticle synthesis in a 1D reactor. •Particle structure is reported as a function of reactor length and time

Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise.

Science.gov (United States)

Chen, Po-Wei; Chen, Bor-Sen

2011-08-01

Naturally, a cellular network consisted of a large amount of interacting cells is complex. These cells have to be synchronized in order to emerge their phenomena for some biological purposes. However, the inherently stochastic intra and intercellular interactions are noisy and delayed from biochemical processes. In this study, a robust synchronization scheme is proposed for a nonlinear stochastic time-delay coupled cellular network (TdCCN) in spite of the time-varying process delay and intracellular parameter perturbations. Furthermore, a nonlinear stochastic noise filtering ability is also investigated for this synchronized TdCCN against stochastic intercellular and environmental disturbances. Since it is very difficult to solve a robust synchronization problem with the Hamilton-Jacobi inequality (HJI) matrix, a linear matrix inequality (LMI) is employed to solve this problem via the help of a global linearization method. Through this robust synchronization analysis, we can gain a more systemic insight into not only the robust synchronizability but also the noise filtering ability of TdCCN under time-varying process delays, intracellular perturbations and intercellular disturbances. The measures of robustness and noise filtering ability of a synchronized TdCCN have potential application to the designs of neuron transmitters, on-time mass production of biochemical molecules, and synthetic biology. Finally, a benchmark of robust synchronization design in Escherichia coli repressilators is given to confirm the effectiveness of the proposed methods. Copyright © 2011 Elsevier Inc. All rights reserved.

Extending Stochastic Network Calculus to Loss Analysis

Directory of Open Access Journals (Sweden)

Chao Luo

2013-01-01

Full Text Available Loss is an important parameter of Quality of Service (QoS. Though stochastic network calculus is a very useful tool for performance evaluation of computer networks, existing studies on stochastic service guarantees mainly focused on the delay and backlog. Some efforts have been made to analyse loss by deterministic network calculus, but there are few results to extend stochastic network calculus for loss analysis. In this paper, we introduce a new parameter named loss factor into stochastic network calculus and then derive the loss bound through the existing arrival curve and service curve via this parameter. We then prove that our result is suitable for the networks with multiple input flows. Simulations show the impact of buffer size, arrival traffic, and service on the loss factor.

Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries

DEFF Research Database (Denmark)

Brodal, Gert Stølting; Jacob, Rico

2003-01-01

We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models.......We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models....

Synchronization of stochastic delayed neural networks with markovian switching and its application.

Science.gov (United States)

Tang, Yang; Fang, Jian-An; Miao, Qing-Ying

2009-02-01

In this paper, the problem of adaptive synchronization for a class of stochastic neural networks (SNNs) which involve both mixed delays and Markovian jumping parameters is investigated. The mixed delays comprise the time-varying delays and distributed delays, both of which are mode-dependent. The stochastic perturbations are described in terms of Browian motion. By the adaptive feedback technique, several sufficient criteria have been proposed to ensure the synchronization of SNNs in mean square. Moreover, the proposed adaptive feedback scheme is applied to the secure communication. Finally, the corresponding simulation results are given to demonstrate the usefulness of the main results obtained.

Stochastic inflation as a time-dependent random walk

International Nuclear Information System (INIS)

Kandrup, H.E.

1989-01-01

This paper exploits the ''stochastic inflation'' paradigm introduced by Starobinskii to study the evolution of long-wavelength modes for a free scalar field Phi in an inflationary Universe. By relaxing the assumption of a ''slow roll,'' it becomes obvious that the well-known late-time infrared divergence of the vacuum for a massless field in de Sitter space may be viewed as a consequence of the fluctuation-dissipation theorem. This stochastic model is also extended to allow for nonvacuum states and power-law inflation, situations where the fluctuation-dissipation theorem no longer holds. One recovers the correct late-time form for the expectation value 2 > in these cases as well, corroborating thereby the intuitive picture that, quite generally, the long-wavelength modes of the field evolve in a thermal ''bath'' provided by the shorter-wavelength modes

Optimal routing of hazardous substances in time-varying, stochastic transportation networks

International Nuclear Information System (INIS)

Woods, A.L.; Miller-Hooks, E.; Mahmassani, H.S.

1998-07-01

This report is concerned with the selection of routes in a network along which to transport hazardous substances, taking into consideration several key factors pertaining to the cost of transport and the risk of population exposure in the event of an accident. Furthermore, the fact that travel time and the risk measures are not constant over time is explicitly recognized in the routing decisions. Existing approaches typically assume static conditions, possibly resulting in inefficient route selection and unnecessary risk exposure. The report described the application of recent advances in network analysis methodologies to the problem of routing hazardous substances. Several specific problem formulations are presented, reflecting different degrees of risk aversion on the part of the decision-maker, as well as different possible operational scenarios. All procedures explicitly consider travel times and travel costs (including risk measures) to be stochastic time-varying quantities. The procedures include both exact algorithms, which may require extensive computational effort in some situations, as well as more efficient heuristics that may not guarantee a Pareto-optimal solution. All procedures are systematically illustrated for an example application using the Texas highway network, for both normal and incident condition scenarios. The application illustrates the trade-offs between the information obtained in the solution and computational efficiency, and highlights the benefits of incorporating these procedures in a decision-support system for hazardous substance shipment routing decisions

Mapping stochastic processes onto complex networks

International Nuclear Information System (INIS)

Shirazi, A H; Reza Jafari, G; Davoudi, J; Peinke, J; Reza Rahimi Tabar, M; Sahimi, Muhammad

2009-01-01

We introduce a method by which stochastic processes are mapped onto complex networks. As examples, we construct the networks for such time series as those for free-jet and low-temperature helium turbulence, the German stock market index (the DAX), and white noise. The networks are further studied by contrasting their geometrical properties, such as the mean length, diameter, clustering, and average number of connections per node. By comparing the network properties of the original time series investigated with those for the shuffled and surrogate series, we are able to quantify the effect of the long-range correlations and the fatness of the probability distribution functions of the series on the networks constructed. Most importantly, we demonstrate that the time series can be reconstructed with high precision by means of a simple random walk on their corresponding networks

Nonlinear stochastic exclusion financial dynamics modeling and time-dependent intrinsic detrended cross-correlation

Science.gov (United States)

Zhang, Wei; Wang, Jun

2017-09-01

In attempt to reproduce price dynamics of financial markets, a stochastic agent-based financial price model is proposed and investigated by stochastic exclusion process. The exclusion process, one of interacting particle systems, is usually thought of as modeling particle motion (with the conserved number of particles) in a continuous time Markov process. In this work, the process is utilized to imitate the trading interactions among the investing agents, in order to explain some stylized facts found in financial time series dynamics. To better understand the correlation behaviors of the proposed model, a new time-dependent intrinsic detrended cross-correlation (TDI-DCC) is introduced and performed, also, the autocorrelation analyses are applied in the empirical research. Furthermore, to verify the rationality of the financial price model, the actual return series are also considered to be comparatively studied with the simulation ones. The comparison results of return behaviors reveal that this financial price dynamics model can reproduce some correlation features of actual stock markets.

The time dependent propensity function for acceleration of spatial stochastic simulation of reaction–diffusion systems

International Nuclear Information System (INIS)

Fu, Jin; Wu, Sheng; Li, Hong; Petzold, Linda R.

2014-01-01

The inhomogeneous stochastic simulation algorithm (ISSA) is a fundamental method for spatial stochastic simulation. However, when diffusion events occur more frequently than reaction events, simulating the diffusion events by ISSA is quite costly. To reduce this cost, we propose to use the time dependent propensity function in each step. In this way we can avoid simulating individual diffusion events, and use the time interval between two adjacent reaction events as the simulation stepsize. We demonstrate that the new algorithm can achieve orders of magnitude efficiency gains over widely-used exact algorithms, scales well with increasing grid resolution, and maintains a high level of accuracy

Stochastic Simulation of Biomolecular Reaction Networks Using the Biomolecular Network Simulator Software

National Research Council Canada - National Science Library

Frazier, John; Chusak, Yaroslav; Foy, Brent

2008-01-01

.... The software uses either exact or approximate stochastic simulation algorithms for generating Monte Carlo trajectories that describe the time evolution of the behavior of biomolecular reaction networks...

Exponential Synchronization for Stochastic Neural Networks with Mixed Time Delays and Markovian Jump Parameters via Sampled Data

Directory of Open Access Journals (Sweden)

Yingwei Li

2014-01-01

Full Text Available The exponential synchronization issue for stochastic neural networks (SNNs with mixed time delays and Markovian jump parameters using sampled-data controller is investigated. Based on a novel Lyapunov-Krasovskii functional, stochastic analysis theory, and linear matrix inequality (LMI approach, we derived some novel sufficient conditions that guarantee that the master systems exponentially synchronize with the slave systems. The design method of the desired sampled-data controller is also proposed. To reflect the most dynamical behaviors of the system, both Markovian jump parameters and stochastic disturbance are considered, where stochastic disturbances are given in the form of a Brownian motion. The results obtained in this paper are a little conservative comparing the previous results in the literature. Finally, two numerical examples are given to illustrate the effectiveness of the proposed methods.

Structural factoring approach for analyzing stochastic networks

Science.gov (United States)

Hayhurst, Kelly J.; Shier, Douglas R.

1991-01-01

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Stability analysis of Markovian jumping stochastic Cohen—Grossberg neural networks with discrete and distributed time varying delays

International Nuclear Information System (INIS)

Ali, M. Syed

2014-01-01

In this paper, the global asymptotic stability problem of Markovian jumping stochastic Cohen—Grossberg neural networks with discrete and distributed time-varying delays (MJSCGNNs) is considered. A novel LMI-based stability criterion is obtained by constructing a new Lyapunov functional to guarantee the asymptotic stability of MJSCGNNs. Our results can be easily verified and they are also less restrictive than previously known criteria and can be applied to Cohen—Grossberg neural networks, recurrent neural networks, and cellular neural networks. Finally, the proposed stability conditions are demonstrated with numerical examples

A Markovian event-based framework for stochastic spiking neural networks.

Science.gov (United States)

Touboul, Jonathan D; Faugeras, Olivier D

2011-11-01

In spiking neural networks, the information is conveyed by the spike times, that depend on the intrinsic dynamics of each neuron, the input they receive and on the connections between neurons. In this article we study the Markovian nature of the sequence of spike times in stochastic neural networks, and in particular the ability to deduce from a spike train the next spike time, and therefore produce a description of the network activity only based on the spike times regardless of the membrane potential process. To study this question in a rigorous manner, we introduce and study an event-based description of networks of noisy integrate-and-fire neurons, i.e. that is based on the computation of the spike times. We show that the firing times of the neurons in the networks constitute a Markov chain, whose transition probability is related to the probability distribution of the interspike interval of the neurons in the network. In the cases where the Markovian model can be developed, the transition probability is explicitly derived in such classical cases of neural networks as the linear integrate-and-fire neuron models with excitatory and inhibitory interactions, for different types of synapses, possibly featuring noisy synaptic integration, transmission delays and absolute and relative refractory period. This covers most of the cases that have been investigated in the event-based description of spiking deterministic neural networks.

Stochastic ℋ∞ Finite-Time Control of Discrete-Time Systems with Packet Loss

Directory of Open Access Journals (Sweden)

Yingqi Zhang

2012-01-01

Full Text Available This paper investigates the stochastic finite-time stabilization and ℋ∞ control problem for one family of linear discrete-time systems over networks with packet loss, parametric uncertainties, and time-varying norm-bounded disturbance. Firstly, the dynamic model description studied is given, which, if the packet dropout is assumed to be a discrete-time homogenous Markov process, the class of discrete-time linear systems with packet loss can be regarded as Markovian jump systems. Based on Lyapunov function approach, sufficient conditions are established for the resulting closed-loop discrete-time system with Markovian jumps to be stochastic ℋ∞ finite-time boundedness and then state feedback controllers are designed to guarantee stochastic ℋ∞ finite-time stabilization of the class of stochastic systems. The stochastic ℋ∞ finite-time boundedness criteria can be tackled in the form of linear matrix inequalities with a fixed parameter. As an auxiliary result, we also give sufficient conditions on the robust stochastic stabilization of the class of linear systems with packet loss. Finally, simulation examples are presented to illustrate the validity of the developed scheme.

Nonlinear signaling on biological networks: The role of stochasticity and spectral clustering

Science.gov (United States)

Hernandez-Hernandez, Gonzalo; Myers, Jesse; Alvarez-Lacalle, Enrique; Shiferaw, Yohannes

2017-03-01

Signal transduction within biological cells is governed by networks of interacting proteins. Communication between these proteins is mediated by signaling molecules which bind to receptors and induce stochastic transitions between different conformational states. Signaling is typically a cooperative process which requires the occurrence of multiple binding events so that reaction rates have a nonlinear dependence on the amount of signaling molecule. It is this nonlinearity that endows biological signaling networks with robust switchlike properties which are critical to their biological function. In this study we investigate how the properties of these signaling systems depend on the network architecture. Our main result is that these nonlinear networks exhibit bistability where the network activity can switch between states that correspond to a low and high activity level. We show that this bistable regime emerges at a critical coupling strength that is determined by the spectral structure of the network. In particular, the set of nodes that correspond to large components of the leading eigenvector of the adjacency matrix determines the onset of bistability. Above this transition the eigenvectors of the adjacency matrix determine a hierarchy of clusters, defined by its spectral properties, which are activated sequentially with increasing network activity. We argue further that the onset of bistability occurs either continuously or discontinuously depending upon whether the leading eigenvector is localized or delocalized. Finally, we show that at low network coupling stochastic transitions to the active branch are also driven by the set of nodes that contribute more strongly to the leading eigenvector. However, at high coupling, transitions are insensitive to network structure since the network can be activated by stochastic transitions of a few nodes. Thus this work identifies important features of biological signaling networks that may underlie their biological

Stability analysis of delayed genetic regulatory networks with stochastic disturbances

Energy Technology Data Exchange (ETDEWEB)

Zhou Qi, E-mail: zhouqilhy@yahoo.com.c [School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu (China); Xu Shengyuan [School of Automation, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu (China); Chen Bing [Institute of Complexity Science, Qingdao University, Qingdao 266071, Shandong (China); Li Hongyi [Space Control and Inertial Technology Research Center, Harbin Institute of Technology, Harbin 150001 (China); Chu Yuming [Department of Mathematics, Huzhou Teacher' s College, Huzhou 313000, Zhejiang (China)

2009-10-05

This Letter considers the problem of stability analysis of a class of delayed genetic regulatory networks with stochastic disturbances. The delays are assumed to be time-varying and bounded. By utilizing Ito's differential formula and Lyapunov-Krasovskii functionals, delay-range-dependent and rate-dependent (rate-independent) stability criteria are proposed in terms of linear matrices inequalities. An important feature of the proposed results is that all the stability conditions are dependent on the upper and lower bounds of the delays. Another important feature is that the obtained stability conditions are less conservative than certain existing ones in the literature due to introducing some appropriate free-weighting matrices. A simulation example is employed to illustrate the applicability and effectiveness of the proposed methods.

Stochastic dynamics of genetic broadcasting networks

Science.gov (United States)

Potoyan, Davit A.; Wolynes, Peter G.

2017-11-01

The complex genetic programs of eukaryotic cells are often regulated by key transcription factors occupying or clearing out of a large number of genomic locations. Orchestrating the residence times of these factors is therefore important for the well organized functioning of a large network. The classic models of genetic switches sidestep this timing issue by assuming the binding of transcription factors to be governed entirely by thermodynamic protein-DNA affinities. Here we show that relying on passive thermodynamics and random release times can lead to a "time-scale crisis" for master genes that broadcast their signals to a large number of binding sites. We demonstrate that this time-scale crisis for clearance in a large broadcasting network can be resolved by actively regulating residence times through molecular stripping. We illustrate these ideas by studying a model of the stochastic dynamics of the genetic network of the central eukaryotic master regulator NFκ B which broadcasts its signals to many downstream genes that regulate immune response, apoptosis, etc.

Stochastic synchronization of coupled neural networks with intermittent control

International Nuclear Information System (INIS)

Yang Xinsong; Cao Jinde

2009-01-01

In this Letter, we study the exponential stochastic synchronization problem for coupled neural networks with stochastic noise perturbations. Based on Lyapunov stability theory, inequality techniques, the properties of Weiner process, and adding different intermittent controllers, several sufficient conditions are obtained to ensure exponential stochastic synchronization of coupled neural networks with or without coupling delays under stochastic perturbations. These stochastic synchronization criteria are expressed in terms of several lower-dimensional linear matrix inequalities (LMIs) and can be easily verified. Moreover, the results of this Letter are applicable to both directed and undirected weighted networks. A numerical example and its simulations are offered to show the effectiveness of our new results.

Quantum stochastic walks on networks for decision-making.

Science.gov (United States)

Martínez-Martínez, Ismael; Sánchez-Burillo, Eduardo

2016-03-31

Recent experiments report violations of the classical law of total probability and incompatibility of certain mental representations when humans process and react to information. Evidence shows promise of a more general quantum theory providing a better explanation of the dynamics and structure of real decision-making processes than classical probability theory. Inspired by this, we show how the behavioral choice-probabilities can arise as the unique stationary distribution of quantum stochastic walkers on the classical network defined from Luce's response probabilities. This work is relevant because (i) we provide a very general framework integrating the positive characteristics of both quantum and classical approaches previously in confrontation, and (ii) we define a cognitive network which can be used to bring other connectivist approaches to decision-making into the quantum stochastic realm. We model the decision-maker as an open system in contact with her surrounding environment, and the time-length of the decision-making process reveals to be also a measure of the process' degree of interplay between the unitary and irreversible dynamics. Implementing quantum coherence on classical networks may be a door to better integrate human-like reasoning biases in stochastic models for decision-making.

Quantum stochastic walks on networks for decision-making

Science.gov (United States)

Martínez-Martínez, Ismael; Sánchez-Burillo, Eduardo

2016-03-01

Recent experiments report violations of the classical law of total probability and incompatibility of certain mental representations when humans process and react to information. Evidence shows promise of a more general quantum theory providing a better explanation of the dynamics and structure of real decision-making processes than classical probability theory. Inspired by this, we show how the behavioral choice-probabilities can arise as the unique stationary distribution of quantum stochastic walkers on the classical network defined from Luce’s response probabilities. This work is relevant because (i) we provide a very general framework integrating the positive characteristics of both quantum and classical approaches previously in confrontation, and (ii) we define a cognitive network which can be used to bring other connectivist approaches to decision-making into the quantum stochastic realm. We model the decision-maker as an open system in contact with her surrounding environment, and the time-length of the decision-making process reveals to be also a measure of the process’ degree of interplay between the unitary and irreversible dynamics. Implementing quantum coherence on classical networks may be a door to better integrate human-like reasoning biases in stochastic models for decision-making.

A stochastic-field description of finite-size spiking neural networks.

Science.gov (United States)

Dumont, Grégory; Payeur, Alexandre; Longtin, André

2017-08-01

Neural network dynamics are governed by the interaction of spiking neurons. Stochastic aspects of single-neuron dynamics propagate up to the network level and shape the dynamical and informational properties of the population. Mean-field models of population activity disregard the finite-size stochastic fluctuations of network dynamics and thus offer a deterministic description of the system. Here, we derive a stochastic partial differential equation (SPDE) describing the temporal evolution of the finite-size refractory density, which represents the proportion of neurons in a given refractory state at any given time. The population activity-the density of active neurons per unit time-is easily extracted from this refractory density. The SPDE includes finite-size effects through a two-dimensional Gaussian white noise that acts both in time and along the refractory dimension. For an infinite number of neurons the standard mean-field theory is recovered. A discretization of the SPDE along its characteristic curves allows direct simulations of the activity of large but finite spiking networks; this constitutes the main advantage of our approach. Linearizing the SPDE with respect to the deterministic asynchronous state allows the theoretical investigation of finite-size activity fluctuations. In particular, analytical expressions for the power spectrum and autocorrelation of activity fluctuations are obtained. Moreover, our approach can be adapted to incorporate multiple interacting populations and quasi-renewal single-neuron dynamics.

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

Science.gov (United States)

Wang, Ting; Plecháč, Petr

2017-12-01

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis.

Science.gov (United States)

Wang, Ting; Plecháč, Petr

2017-12-21

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.

Estimation of parameter sensitivities for stochastic reaction networks

KAUST Repository

Gupta, Ankit

2016-01-07

Quantification of the effects of parameter uncertainty is an important and challenging problem in Systems Biology. We consider this problem in the context of stochastic models of biochemical reaction networks where the dynamics is described as a continuous-time Markov chain whose states represent the molecular counts of various species. For such models, effects of parameter uncertainty are often quantified by estimating the infinitesimal sensitivities of some observables with respect to model parameters. The aim of this talk is to present a holistic approach towards this problem of estimating parameter sensitivities for stochastic reaction networks. Our approach is based on a generic formula which allows us to construct efficient estimators for parameter sensitivity using simulations of the underlying model. We will discuss how novel simulation techniques, such as tau-leaping approximations, multi-level methods etc. can be easily integrated with our approach and how one can deal with stiff reaction networks where reactions span multiple time-scales. We will demonstrate the efficiency and applicability of our approach using many examples from the biological literature.

Low Variance Couplings for Stochastic Models of Intracellular Processes with Time-Dependent Rate Functions.

Science.gov (United States)

Anderson, David F; Yuan, Chaojie

2018-04-18

A number of coupling strategies are presented for stochastically modeled biochemical processes with time-dependent parameters. In particular, the stacked coupling is introduced and is shown via a number of examples to provide an exceptionally low variance between the generated paths. This coupling will be useful in the numerical computation of parametric sensitivities and the fast estimation of expectations via multilevel Monte Carlo methods. We provide the requisite estimators in both cases.

Contribution to the stochastically studies of space-time dependable hydrological processes

International Nuclear Information System (INIS)

Kjaevski, Ivancho

2002-12-01

One of the fundaments of today's planning and water economy is Science of Hydrology. Science of Hydrology through the history had followed the development of the water management systems. Water management systems, during the time from single-approach evolved to complex and multi purpose systems. The dynamic and development of the today's society contributed for increasing the demand of clean water, and in the same time, the resources of clean water in the nature are reduced. In this kind of conditions, water management systems should resolve problems that are more complicated during managing of water sources. Solving the problems in water management, enable development and applying new methods and technologies in planning and management with water resources and water management systems like: systematical analyses, operational research, hierarchy decisions, expert systems, computer technology etc. Planning and management of water sources needs historical measured data for hydro metrological processes. In our country there are data of hydro metrological processes in period of 50-70, but in some Europe countries there are data more than 100 years. Water economy trends follow the hydro metrological trend research. The basic statistic techniques like sampling, probability distribution function, correlation and regression, are used about one intended and simple water management problems. Solving new problems about water management needs using of space-time stochastic technique, modem mathematical and statistical techniques during simulation and optimization of complex water systems. We need tree phases of development of the techniques to get secure hydrological models: i) Estimate the quality of hydro meteorological data, analyzing of their consistency, and homogeneous; ii) Structural analyze of hydro meteorological processes; iii) Mathematical models for modeling hydro meteorological processes. Very often, the third phase is applied for analyzing and modeling of hydro

Stochastic synchronization in finite size spiking networks

Science.gov (United States)

Doiron, Brent; Rinzel, John; Reyes, Alex

2006-09-01

We study a stochastic synchronization of spiking activity in feedforward networks of integrate-and-fire model neurons. A stochastic mean field analysis shows that synchronization occurs only when the network size is sufficiently small. This gives evidence that the dynamics, and hence processing, of finite size populations can be drastically different from that observed in the infinite size limit. Our results agree with experimentally observed synchrony in cortical networks, and further strengthen the link between synchrony and propagation in cortical systems.

Reliability-oriented multi-resource allocation in a stochastic-flow network

International Nuclear Information System (INIS)

Hsieh, C.-C.; Lin, M.-H.

2003-01-01

A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple operational states. The network reliability of such a stochastic-flow network is the probability that resources can be successfully transmitted from source nodes through multi-capacitated arcs to sink nodes. Although the evaluation schemes of network reliability in stochastic-flow networks have been extensively studied in the literature, how to allocate various resources at source nodes in a reliable means remains unanswered. In this study, a resource allocation problem in a stochastic-flow network is formulated that aims to determine the optimal resource allocation policy at source nodes subject to given resource demands at sink nodes such that the network reliability of the stochastic-flow network is maximized, and an algorithm for computing the optimal resource allocation is proposed that incorporates the principle of minimal path vectors. A numerical example is given to illustrate the proposed algorithm

Analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times

Science.gov (United States)

Sharma, Pankaj; Jain, Ajai

2014-12-01

Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures viewpoint. A discrete event simulation model of a stochastic dynamic job shop manufacturing system is developed for investigation purpose. Nine dispatching rules identified from literature are incorporated in the simulation model. The simulation experiments are conducted under due date tightness factor of 3, shop utilization percentage of 90% and setup times less than processing times. Results indicate that shortest setup time (SIMSET) rule provides the best performance for mean flow time and number of tardy jobs measures. The job with similar setup and modified earliest due date (JMEDD) rule provides the best performance for makespan, maximum flow time, mean tardiness, maximum tardiness, total setups and mean setup time measures.

History-dependent stochastic Petri nets

NARCIS (Netherlands)

Schonenberg, H.; Sidorova, N.; Aalst, van der W.M.P.; Hee, van K.M.; Pnueli, A.; Virbitskaite, I.; Voronkov, A.

2010-01-01

Stochastic Petri Nets are a useful and well-known tool for performance analysis. However, an implicit assumption in the different types of Stochastic Petri Nets is the Markov property. It is assumed that a choice in the Petri net only depends on the current state and not on earlier choices. For many

Factors influencing lysis time stochasticity in bacteriophage λ

Directory of Open Access Journals (Sweden)

Dennehy John J

2011-08-01

Full Text Available Abstract Background Despite identical genotypes and seemingly uniform environments, stochastic gene expression and other dynamic intracellular processes can produce considerable phenotypic diversity within clonal microbes. One trait that provides a good model to explore the molecular basis of stochastic variation is the timing of host lysis by bacteriophage (phage. Results Individual lysis events of thermally-inducible λ lysogens were observed using a temperature-controlled perfusion chamber mounted on an inverted microscope. Both mean lysis time (MLT and its associated standard deviation (SD were estimated. Using the SD as a measure of lysis time stochasticity, we showed that lysogenic cells in controlled environments varied widely in lysis times, and that the level of lysis time stochasticity depended on allelic variation in the holin sequence, late promoter (pR' activity, and host growth rate. In general, the MLT was positively correlated with the SD. Both lower pR' activities and lower host growth rates resulted in larger SDs. Results from premature lysis, induced by adding KCN at different time points after lysogen induction, showed a negative correlation between the timing of KCN addition and lysis time stochasticity. Conclusions Taken together with results published by others, we conclude that a large fraction of λ lysis time stochasticity is the result of random events following the expression and diffusion of the holin protein. Consequently, factors influencing the timing of reaching critical holin concentrations in the cell membrane, such as holin production rate, strongly influence the mean lysis time and the lysis time stochasticity.

Memristor-based neural networks: Synaptic versus neuronal stochasticity

KAUST Repository

Naous, Rawan

2016-11-02

In neuromorphic circuits, stochasticity in the cortex can be mapped into the synaptic or neuronal components. The hardware emulation of these stochastic neural networks are currently being extensively studied using resistive memories or memristors. The ionic process involved in the underlying switching behavior of the memristive elements is considered as the main source of stochasticity of its operation. Building on its inherent variability, the memristor is incorporated into abstract models of stochastic neurons and synapses. Two approaches of stochastic neural networks are investigated. Aside from the size and area perspective, the impact on the system performance, in terms of accuracy, recognition rates, and learning, among these two approaches and where the memristor would fall into place are the main comparison points to be considered.

Long-time correlations in the stochastic regime

International Nuclear Information System (INIS)

Karney, C.F.F.

1982-11-01

The phase space for Hamiltonians of two degrees of freedom is usually divided into stochastic and integrable components. Even when well into the stochastic regime, integrable orbits may surround small stable regions or islands. The effect of these islands on the correlation function for the stochastic trajectories is examined. Depending on the value of the parameter describing the rotation number for the elliptic fixed point at the center of the island, the long-time correlation function may decay as t -5 or exponentially, but more commonly it decays much more slowly (roughly as t -1 ). As a consequence these small islands may have a profound effect on the properties such as the diffusion coefficient, of the stochastic orbits

Tuning of an optimal fuzzy PID controller with stochastic algorithms for networked control systems with random time delay.

Science.gov (United States)

Pan, Indranil; Das, Saptarshi; Gupta, Amitava

2011-01-01

An optimal PID and an optimal fuzzy PID have been tuned by minimizing the Integral of Time multiplied Absolute Error (ITAE) and squared controller output for a networked control system (NCS). The tuning is attempted for a higher order and a time delay system using two stochastic algorithms viz. the Genetic Algorithm (GA) and two variants of Particle Swarm Optimization (PSO) and the closed loop performances are compared. The paper shows that random variation in network delay can be handled efficiently with fuzzy logic based PID controllers over conventional PID controllers. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

Elucidation of time-dependent systems biology cell response patterns with time course network enrichment

DEFF Research Database (Denmark)

Wiwie, Christian; Rauch, Alexander; Haakonsson, Anders

2018-01-01

, no methods exist to integrate time series data with networks, thus preventing the identification of time-dependent systems biology responses. We close this gap with Time Course Network Enrichment (TiCoNE). It combines a new kind of human-augmented clustering with a novel approach to network enrichment...

Stochastic analysis of complex reaction networks using binomial moment equations.

Science.gov (United States)

Barzel, Baruch; Biham, Ofer

2012-09-01

The stochastic analysis of complex reaction networks is a difficult problem because the number of microscopic states in such systems increases exponentially with the number of reactive species. Direct integration of the master equation is thus infeasible and is most often replaced by Monte Carlo simulations. While Monte Carlo simulations are a highly effective tool, equation-based formulations are more amenable to analytical treatment and may provide deeper insight into the dynamics of the network. Here, we present a highly efficient equation-based method for the analysis of stochastic reaction networks. The method is based on the recently introduced binomial moment equations [Barzel and Biham, Phys. Rev. Lett. 106, 150602 (2011)]. The binomial moments are linear combinations of the ordinary moments of the probability distribution function of the population sizes of the interacting species. They capture the essential combinatorics of the reaction processes reflecting their stoichiometric structure. This leads to a simple and transparent form of the equations, and allows a highly efficient and surprisingly simple truncation scheme. Unlike ordinary moment equations, in which the inclusion of high order moments is prohibitively complicated, the binomial moment equations can be easily constructed up to any desired order. The result is a set of equations that enables the stochastic analysis of complex reaction networks under a broad range of conditions. The number of equations is dramatically reduced from the exponential proliferation of the master equation to a polynomial (and often quadratic) dependence on the number of reactive species in the binomial moment equations. The aim of this paper is twofold: to present a complete derivation of the binomial moment equations; to demonstrate the applicability of the moment equations for a representative set of example networks, in which stochastic effects play an important role.

Stochastic Power Control for Time-Varying Long-Term Fading Wireless Networks

Directory of Open Access Journals (Sweden)

Charalambous Charalambos D

2006-01-01

Full Text Available A new time-varying (TV long-term fading (LTF channel model which captures both the space and time variations of wireless systems is developed. The proposed TV LTF model is based on a stochastic differential equation driven by Brownian motion. This model is more realistic than the static models usually encountered in the literature. It allows viewing the wireless channel as a dynamical system, thus enabling well-developed tools of adaptive and nonadaptive estimation and identification techniques to be applied to this class of problems. In contrast with the traditional models, the statistics of the proposed model are shown to be TV, but converge in steady state to their static counterparts. Moreover, optimal power control algorithms (PCAs based on the new model are proposed. A centralized PCA is shown to reduce to a simple linear programming problem if predictable power control strategies (PPCS are used. In addition, an iterative distributed stochastic PCA is used to solve for the optimization problem using stochastic approximations. The latter solely requires each mobile to know its received signal-to-interference ratio. Generalizations of the power control problem based on convex optimization techniques are provided if PPCS are not assumed. Numerical results show that there are potentially large gains to be achieved by using TV stochastic models, and the distributed stochastic PCA provides better power stability and consumption than the distributed deterministic PCA.

Drift-Implicit Multi-Level Monte Carlo Tau-Leap Methods for Stochastic Reaction Networks

KAUST Repository

Ben Hammouda, Chiheb

2015-01-01

-space and deterministic ones. These stochastic models constitute the theory of stochastic reaction networks (SRNs). Furthermore, in some cases, the dynamics of fast and slow time scales can be well separated and this is characterized by what is called sti

Optimization of stochastic discrete systems and control on complex networks computational networks

CERN Document Server

Lozovanu, Dmitrii

2014-01-01

This book presents the latest findings on stochastic dynamic programming models and on solving optimal control problems in networks. It includes the authors' new findings on determining the optimal solution of discrete optimal control problems in networks and on solving game variants of Markov decision problems in the context of computational networks. First, the book studies the finite state space of Markov processes and reviews the existing methods and algorithms for determining the main characteristics in Markov chains, before proposing new approaches based on dynamic programming and combinatorial methods. Chapter two is dedicated to infinite horizon stochastic discrete optimal control models and Markov decision problems with average and expected total discounted optimization criteria, while Chapter three develops a special game-theoretical approach to Markov decision processes and stochastic discrete optimal control problems. In closing, the book's final chapter is devoted to finite horizon stochastic con...

Endogenous fields enhanced stochastic resonance in a randomly coupled neuronal network

International Nuclear Information System (INIS)

Deng, Bin; Wang, Lin; Wang, Jiang; Wei, Xi-le; Yu, Hai-tao

2014-01-01

Highlights: • We study effects of endogenous fields on stochastic resonance in a neural network. • Stochastic resonance can be notably enhanced by endogenous field feedback. • Endogenous field feedback delay plays a vital role in stochastic resonance. • The parameters of low-passed filter play a subtle role in SR. - Abstract: Endogenous field, evoked by structured neuronal network activity in vivo, is correlated with many vital neuronal processes. In this paper, the effects of endogenous fields on stochastic resonance (SR) in a randomly connected neuronal network are investigated. The network consists of excitatory and inhibitory neurons and the axonal conduction delays between neurons are also considered. Numerical results elucidate that endogenous field feedback results in more rhythmic macroscope activation of the network for proper time delay and feedback coefficient. The response of the network to the weak periodic stimulation can be notably enhanced by endogenous field feedback. Moreover, the endogenous field feedback delay plays a vital role in SR. We reveal that appropriately tuned delays of the feedback can either induce the enhancement of SR, appearing at every integer multiple of the weak input signal’s oscillation period, or the depression of SR, appearing at every integer multiple of half the weak input signal’s oscillation period for the same feedback coefficient. Interestingly, the parameters of low-passed filter which is used in obtaining the endogenous field feedback signal play a subtle role in SR

An improved stochastic algorithm for temperature-dependent homogeneous gas phase reactions

CERN Document Server

Kraft, M

2003-01-01

We propose an improved stochastic algorithm for temperature-dependent homogeneous gas phase reactions. By combining forward and reverse reaction rates, a significant gain in computational efficiency is achieved. Two modifications of modelling the temperature dependence (with and without conservation of enthalpy) are introduced and studied quantitatively. The algorithm is tested for the combustion of n-heptane, which is a reference fuel component for internal combustion engines. The convergence of the algorithm is studied by a series of numerical experiments and the computational cost of the stochastic algorithm is compared with the DAE code DASSL. If less accuracy is needed the stochastic algorithm is faster on short simulation time intervals. The new stochastic algorithm is significantly faster than the original direct simulation algorithm in all cases considered.

Modeling stochasticity and robustness in gene regulatory networks.

Science.gov (United States)

Garg, Abhishek; Mohanram, Kartik; Di Cara, Alessandro; De Micheli, Giovanni; Xenarios, Ioannis

2009-06-15

Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.

Synchronization of coupled stochastic complex-valued dynamical networks with time-varying delays via aperiodically intermittent adaptive control

Science.gov (United States)

Wang, Pengfei; Jin, Wei; Su, Huan

2018-04-01

This paper deals with the synchronization problem of a class of coupled stochastic complex-valued drive-response networks with time-varying delays via aperiodically intermittent adaptive control. Different from the previous works, the intermittent control is aperiodic and adaptive, and the restrictions on the control width and time delay are removed, which lead to a larger application scope for this control strategy. Then, based on the Lyapunov method and Kirchhoff's Matrix Tree Theorem as well as differential inequality techniques, several novel synchronization conditions are derived for the considered model. Specially, impulsive control is also considered, which can be seen as a special case of the aperiodically intermittent control when the control width tends to zero. And the corresponding synchronization criteria are given as well. As an application of the theoretical results, a class of stochastic complex-valued coupled oscillators with time-varying delays is studied, and the numerical simulations are also given to demonstrate the effectiveness of the control strategies.

Stability results for stochastic delayed recurrent neural networks with discrete and distributed delays

Science.gov (United States)

Chen, Guiling; Li, Dingshi; Shi, Lin; van Gaans, Onno; Verduyn Lunel, Sjoerd

2018-03-01

We present new conditions for asymptotic stability and exponential stability of a class of stochastic recurrent neural networks with discrete and distributed time varying delays. Our approach is based on the method using fixed point theory, which do not resort to any Liapunov function or Liapunov functional. Our results neither require the boundedness, monotonicity and differentiability of the activation functions nor differentiability of the time varying delays. In particular, a class of neural networks without stochastic perturbations is also considered. Examples are given to illustrate our main results.

A Stochastic Multiobjective Optimization Framework for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shibo He

2010-01-01

Full Text Available In wireless sensor networks (WSNs, there generally exist many different objective functions to be optimized. In this paper, we propose a stochastic multiobjective optimization approach to solve such kind of problem. We first formulate a general multiobjective optimization problem. We then decompose the optimization formulation through Lagrange dual decomposition and adopt the stochastic quasigradient algorithm to solve the primal-dual problem in a distributed way. We show theoretically that our algorithm converges to the optimal solution of the primal problem by using the knowledge of stochastic programming. Furthermore, the formulation provides a general stochastic multiobjective optimization framework for WSNs. We illustrate how the general framework works by considering an example of the optimal rate allocation problem in multipath WSNs with time-varying channel. Extensive simulation results are given to demonstrate the effectiveness of our algorithm.

Enabling time-dependent uncertain eco-weights for road networks

DEFF Research Database (Denmark)

Hu, Jilin; Yang, Bin; Jensen, Christian S.

2017-01-01

travel costs. Based on the techniques above, different histogram aggregation methods are proposed to accurately estimate time-dependent GHG emissions for routes. Based on a 200-million GPS record data set collected from 150 vehicles in Denmark over two years, a comprehensive empirical study is conducted...... transportation. The foundation of eco-routing is a weighted-graph representation of a road network in which road segments, or edges, are associated with eco-weights that capture the GHG emissions caused by traversing the edges. Due to the dynamics of traffic, the eco-weights are best modeled as being time...... dependent and uncertain. We formalize the problem of assigning a time-dependent, uncertain eco-weight to each edge in a road network based on historical GPS records. In particular, a sequence of histograms is employed to describe the uncertain eco-weight of an edge at different time intervals. Compression...

Assessing and accounting for time heterogeneity in stochastic actor oriented models

NARCIS (Netherlands)

Lospinoso, Joshua A.; Schweinberger, Michael; Snijders, Tom A. B.; Ripley, Ruth M.

This paper explores time heterogeneity in stochastic actor oriented models (SAOM) proposed by Snijders (Sociological methodology. Blackwell, Boston, pp 361-395, 2001) which are meant to study the evolution of networks. SAOMs model social networks as directed graphs with nodes representing people,

FERN - a Java framework for stochastic simulation and evaluation of reaction networks.

Science.gov (United States)

Erhard, Florian; Friedel, Caroline C; Zimmer, Ralf

2008-08-29

Stochastic simulation can be used to illustrate the development of biological systems over time and the stochastic nature of these processes. Currently available programs for stochastic simulation, however, are limited in that they either a) do not provide the most efficient simulation algorithms and are difficult to extend, b) cannot be easily integrated into other applications or c) do not allow to monitor and intervene during the simulation process in an easy and intuitive way. Thus, in order to use stochastic simulation in innovative high-level modeling and analysis approaches more flexible tools are necessary. In this article, we present FERN (Framework for Evaluation of Reaction Networks), a Java framework for the efficient simulation of chemical reaction networks. FERN is subdivided into three layers for network representation, simulation and visualization of the simulation results each of which can be easily extended. It provides efficient and accurate state-of-the-art stochastic simulation algorithms for well-mixed chemical systems and a powerful observer system, which makes it possible to track and control the simulation progress on every level. To illustrate how FERN can be easily integrated into other systems biology applications, plugins to Cytoscape and CellDesigner are included. These plugins make it possible to run simulations and to observe the simulation progress in a reaction network in real-time from within the Cytoscape or CellDesigner environment. FERN addresses shortcomings of currently available stochastic simulation programs in several ways. First, it provides a broad range of efficient and accurate algorithms both for exact and approximate stochastic simulation and a simple interface for extending to new algorithms. FERN's implementations are considerably faster than the C implementations of gillespie2 or the Java implementations of ISBJava. Second, it can be used in a straightforward way both as a stand-alone program and within new

Noise transmission and delay-induced stochastic oscillations in biochemical network motifs

International Nuclear Information System (INIS)

Liu Sheng-Jun; Wang Qi; Liu Bo; Yan Shi-Wei; Sakata Fumihiko

2011-01-01

With the aid of stochastic delayed-feedback differential equations, we derive an analytic expression for the power spectra of reacting molecules included in a generic biological network motif that is incorporated with a feedback mechanism and time delays in gene regulation. We systematically analyse the effects of time delays, the feedback mechanism, and biological stochasticity on the power spectra. It has been clarified that the time delays together with the feedback mechanism can induce stochastic oscillations at the molecular level and invalidate the noise addition rule for a modular description of the noise propagator. Delay-induced stochastic resonance can be expected, which is related to the stability loss of the reaction systems and Hopf bifurcation occurring for solutions of the corresponding deterministic reaction equations. Through the analysis of the power spectrum, a new approach is proposed to estimate the oscillation period. (interdisciplinary physics and related areas of science and technology)

Stochastic network optimization with application to communication and queueing systems

CERN Document Server

Neely, Michael

2010-01-01

This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are prov

Global stability of stochastic high-order neural networks with discrete and distributed delays

International Nuclear Information System (INIS)

Wang Zidong; Fang Jianan; Liu Xiaohui

2008-01-01

High-order neural networks can be considered as an expansion of Hopfield neural networks, and have stronger approximation property, faster convergence rate, greater storage capacity, and higher fault tolerance than lower-order neural networks. In this paper, the global asymptotic stability analysis problem is considered for a class of stochastic high-order neural networks with discrete and distributed time-delays. Based on an Lyapunov-Krasovskii functional and the stochastic stability analysis theory, several sufficient conditions are derived, which guarantee the global asymptotic convergence of the equilibrium point in the mean square. It is shown that the stochastic high-order delayed neural networks under consideration are globally asymptotically stable in the mean square if two linear matrix inequalities (LMIs) are feasible, where the feasibility of LMIs can be readily checked by the Matlab LMI toolbox. It is also shown that the main results in this paper cover some recently published works. A numerical example is given to demonstrate the usefulness of the proposed global stability criteria

Systemic risk in dynamical networks with stochastic failure criterion

Science.gov (United States)

Podobnik, B.; Horvatic, D.; Bertella, M. A.; Feng, L.; Huang, X.; Li, B.

2014-06-01

Complex non-linear interactions between banks and assets we model by two time-dependent Erdős-Renyi network models where each node, representing a bank, can invest either to a single asset (model I) or multiple assets (model II). We use a dynamical network approach to evaluate the collective financial failure —systemic risk— quantified by the fraction of active nodes. The systemic risk can be calculated over any future time period, divided into sub-periods, where within each sub-period banks may contiguously fail due to links to either i) assets or ii) other banks, controlled by two parameters, probability of internal failure p and threshold Th (“solvency” parameter). The systemic risk decreases with the average network degree faster when all assets are equally distributed across banks than if assets are randomly distributed. The more inactive banks each bank can sustain (smaller Th), the smaller the systemic risk —for some Th values in I we report a discontinuity in systemic risk. When contiguous spreading becomes stochastic ii) controlled by probability p2 —a condition for the bank to be solvent (active) is stochastic— the systemic risk decreases with decreasing p2. We analyse the asset allocation for the U.S. banks.

Space-time-modulated stochastic processes

Science.gov (United States)

Giona, Massimiliano

2017-10-01

Starting from the physical problem associated with the Lorentzian transformation of a Poisson-Kac process in inertial frames, the concept of space-time-modulated stochastic processes is introduced for processes possessing finite propagation velocity. This class of stochastic processes provides a two-way coupling between the stochastic perturbation acting on a physical observable and the evolution of the physical observable itself, which in turn influences the statistical properties of the stochastic perturbation during its evolution. The definition of space-time-modulated processes requires the introduction of two functions: a nonlinear amplitude modulation, controlling the intensity of the stochastic perturbation, and a time-horizon function, which modulates its statistical properties, providing irreducible feedback between the stochastic perturbation and the physical observable influenced by it. The latter property is the peculiar fingerprint of this class of models that makes them suitable for extension to generic curved-space times. Considering Poisson-Kac processes as prototypical examples of stochastic processes possessing finite propagation velocity, the balance equations for the probability density functions associated with their space-time modulations are derived. Several examples highlighting the peculiarities of space-time-modulated processes are thoroughly analyzed.

Memristor-based neural networks: Synaptic versus neuronal stochasticity

KAUST Repository

Naous, Rawan; Alshedivat, Maruan; Neftci, Emre; Cauwenberghs, Gert; Salama, Khaled N.

2016-01-01

In neuromorphic circuits, stochasticity in the cortex can be mapped into the synaptic or neuronal components. The hardware emulation of these stochastic neural networks are currently being extensively studied using resistive memories or memristors

Robust stability analysis of Takagi—Sugeno uncertain stochastic fuzzy recurrent neural networks with mixed time-varying delays

International Nuclear Information System (INIS)

Ali, M. Syed

2011-01-01

In this paper, the global stability of Takagi—Sugeno (TS) uncertain stochastic fuzzy recurrent neural networks with discrete and distributed time-varying delays (TSUSFRNNs) is considered. A novel LMI-based stability criterion is obtained by using Lyapunov functional theory to guarantee the asymptotic stability of TSUSFRNNs. The proposed stability conditions are demonstrated through numerical examples. Furthermore, the supplementary requirement that the time derivative of time-varying delays must be smaller than one is removed. Comparison results are demonstrated to show that the proposed method is more able to guarantee the widest stability region than the other methods available in the existing literature. (general)

TIME-DEPENDENT STOCHASTIC ACCELERATION MODEL FOR FERMI BUBBLES

Energy Technology Data Exchange (ETDEWEB)

Sasaki, Kento; Asano, Katsuaki; Terasawa, Toshio, E-mail: kentos@icrr.u-tokyo.ac.jp, E-mail: asanok@icrr.u-tokyo.ac.jp, E-mail: terasawa@icrr.u-tokyo.ac.jp [Institute for Cosmic Ray Research, The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 277-8582 (Japan)

2015-12-01

We study stochastic acceleration models for the Fermi bubbles. Turbulence is excited just behind the shock front via Kelvin–Helmholtz, Rayleigh–Taylor, or Richtmyer–Meshkov instabilities, and plasma particles are continuously accelerated by the interaction with the turbulence. The turbulence gradually decays as it goes away from the shock fronts. Adopting a phenomenological model for the stochastic acceleration, we explicitly solve the temporal evolution of the particle energy distribution in the turbulence. Our results show that the spatial distribution of high-energy particles is different from those for a steady solution. We also show that the contribution of electrons that escaped from the acceleration regions significantly softens the photon spectrum. The photon spectrum and surface brightness profile are reproduced by our models. If the escape efficiency is very high, the radio flux from the escaped low-energy electrons can be comparable to that of the WMAP haze. We also demonstrate hadronic models with the stochastic acceleration, but they are unlikely in the viewpoint of the energy budget.

Research on robust optimization of emergency logistics network considering the time dependence characteristic

Science.gov (United States)

WANG, Qingrong; ZHU, Changfeng; LI, Ying; ZHANG, Zhengkun

2017-06-01

Considering the time dependence of emergency logistic network and complexity of the environment that the network exists in, in this paper the time dependent network optimization theory and robust discrete optimization theory are combined, and the emergency logistics dynamic network optimization model with characteristics of robustness is built to maximize the timeliness of emergency logistics. On this basis, considering the complexity of dynamic network and the time dependence of edge weight, an improved ant colony algorithm is proposed to realize the coupling of the optimization algorithm and the network time dependence and robustness. Finally, a case study has been carried out in order to testify validity of this robustness optimization model and its algorithm, and the value of different regulation factors was analyzed considering the importance of the value of the control factor in solving the optimal path. Analysis results show that this model and its algorithm above-mentioned have good timeliness and strong robustness.

Reliability-based Dynamic Network Design with Stochastic Networks

NARCIS (Netherlands)

Li, H.

2009-01-01

Transportation systems are stochastic and dynamic systems. The road capacities and the travel demand are fluctuating from time to time within a day and at the same time from day to day. For road users, the travel time and travel costs experienced over time and space are stochastic, thus desire

Susceptibility of optimal train schedules to stochastic disturbances of process times

DEFF Research Database (Denmark)

Larsen, Rune; Pranzo, Marco; D’Ariano, Andrea

2013-01-01

study, an advanced branch and bound algorithm, on average, outperforms a First In First Out scheduling rule both in deterministic and stochastic traffic scenarios. However, the characteristic of the stochastic processes and the way a stochastic instance is handled turn out to have a serious impact...... and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced...

Neural Network Based Finite-Time Stabilization for Discrete-Time Markov Jump Nonlinear Systems with Time Delays

Directory of Open Access Journals (Sweden)

Fei Chen

2013-01-01

Full Text Available This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabilization of the closed-loop system. A numerical example is illustrated to verify the efficiency of the proposed technique.

Bounded-Degree Approximations of Stochastic Networks

Energy Technology Data Exchange (ETDEWEB)

Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

2017-06-01

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.

SELANSI: a toolbox for simulation of stochastic gene regulatory networks.

Science.gov (United States)

Pájaro, Manuel; Otero-Muras, Irene; Vázquez, Carlos; Alonso, Antonio A

2018-03-01

Gene regulation is inherently stochastic. In many applications concerning Systems and Synthetic Biology such as the reverse engineering and the de novo design of genetic circuits, stochastic effects (yet potentially crucial) are often neglected due to the high computational cost of stochastic simulations. With advances in these fields there is an increasing need of tools providing accurate approximations of the stochastic dynamics of gene regulatory networks (GRNs) with reduced computational effort. This work presents SELANSI (SEmi-LAgrangian SImulation of GRNs), a software toolbox for the simulation of stochastic multidimensional gene regulatory networks. SELANSI exploits intrinsic structural properties of gene regulatory networks to accurately approximate the corresponding Chemical Master Equation with a partial integral differential equation that is solved by a semi-lagrangian method with high efficiency. Networks under consideration might involve multiple genes with self and cross regulations, in which genes can be regulated by different transcription factors. Moreover, the validity of the method is not restricted to a particular type of kinetics. The tool offers total flexibility regarding network topology, kinetics and parameterization, as well as simulation options. SELANSI runs under the MATLAB environment, and is available under GPLv3 license at https://sites.google.com/view/selansi. antonio@iim.csic.es. © The Author(s) 2017. Published by Oxford University Press.

Mixed H-Infinity and Passive Filtering for Discrete Fuzzy Neural Networks With Stochastic Jumps and Time Delays.

Science.gov (United States)

Shi, Peng; Zhang, Yingqi; Chadli, Mohammed; Agarwal, Ramesh K

2016-04-01

In this brief, the problems of the mixed H-infinity and passivity performance analysis and design are investigated for discrete time-delay neural networks with Markovian jump parameters represented by Takagi-Sugeno fuzzy model. The main purpose of this brief is to design a filter to guarantee that the augmented Markovian jump fuzzy neural networks are stable in mean-square sense and satisfy a prescribed passivity performance index by employing the Lyapunov method and the stochastic analysis technique. Applying the matrix decomposition techniques, sufficient conditions are provided for the solvability of the problems, which can be formulated in terms of linear matrix inequalities. A numerical example is also presented to illustrate the effectiveness of the proposed techniques.

Analysis of multimedian problems on time dependent networks

OpenAIRE

Salman, F Sibel

1994-01-01

Ankara : The Department of Industrial Engineering and the Institute of Enginering and Science of Bilkent Univ., 1994. Thesis (Master's) -- Bilkent University, 1994. Includes bibliographical references leaves 81-85. Time dependency arises in transportation and computer-communication networks due to factors such as time varying demand, traffic intensity, and road conditions. This necessitates a locational decision to be based on an analysis involving a time horizon. In this st...

Pacemaker-driven stochastic resonance on diffusive and complex networks of bistable oscillators

Energy Technology Data Exchange (ETDEWEB)

Perc, Matjaz; Gosak, Marko [Department of Physics, Faculty of Natural Sciences and Mathematics, University of Maribor, Koroska cesta 160, SI-2000 Maribor (Slovenia)], E-mail: matjaz.perc@uni-mb.si

2008-05-15

We study the phenomenon of stochastic resonance on diffusive, small-world and scale-free networks consisting of bistable overdamped oscillators. Important thereby is the fact that the external subthreshold periodic forcing is introduced only to a single oscillator of the network. Hence, the forcing acts as a pacemaker trying to impose its rhythm on the whole network through the unit to which it is introduced. Without the addition of additive spatiotemporal noise, however, the whole network, including the unit that is directly exposed to the pacemaker, remains trapped forever in one of the two stable steady states of the local dynamics. We show that the correlation between the frequency of subthreshold pacemaker activity and the response of the network is resonantly dependent on the intensity of additive noise. The reported pacemaker-driven stochastic resonance depends most significantly on the coupling strength and the underlying network structure. Namely, the outreach of the pacemaker obeys the classic diffusion law in the case of nearest-neighbor interactions, thus being proportional to the square root of the coupling strength, whereas it becomes superdiffusive by an appropriate small-world or scale-free topology of the interaction network. In particular, the scale-free topology is identified as being optimal for the dissemination of localized rhythmic activity across the whole network. Also, we show that the ratio between the clustering coefficient and the characteristic path length is the crucial quantity defining the ability of a small-world network to facilitate the outreach of the pacemaker-emitted subthreshold rhythm. We additionally confirm these findings by using the FitzHugh-Nagumo excitable system as an alternative to the bistable overdamped oscillator.

Pacemaker-driven stochastic resonance on diffusive and complex networks of bistable oscillators

International Nuclear Information System (INIS)

Perc, Matjaz; Gosak, Marko

2008-01-01

We study the phenomenon of stochastic resonance on diffusive, small-world and scale-free networks consisting of bistable overdamped oscillators. Important thereby is the fact that the external subthreshold periodic forcing is introduced only to a single oscillator of the network. Hence, the forcing acts as a pacemaker trying to impose its rhythm on the whole network through the unit to which it is introduced. Without the addition of additive spatiotemporal noise, however, the whole network, including the unit that is directly exposed to the pacemaker, remains trapped forever in one of the two stable steady states of the local dynamics. We show that the correlation between the frequency of subthreshold pacemaker activity and the response of the network is resonantly dependent on the intensity of additive noise. The reported pacemaker-driven stochastic resonance depends most significantly on the coupling strength and the underlying network structure. Namely, the outreach of the pacemaker obeys the classic diffusion law in the case of nearest-neighbor interactions, thus being proportional to the square root of the coupling strength, whereas it becomes superdiffusive by an appropriate small-world or scale-free topology of the interaction network. In particular, the scale-free topology is identified as being optimal for the dissemination of localized rhythmic activity across the whole network. Also, we show that the ratio between the clustering coefficient and the characteristic path length is the crucial quantity defining the ability of a small-world network to facilitate the outreach of the pacemaker-emitted subthreshold rhythm. We additionally confirm these findings by using the FitzHugh-Nagumo excitable system as an alternative to the bistable overdamped oscillator

New exponential stability criteria for stochastic BAM neural networks with impulses

International Nuclear Information System (INIS)

Sakthivel, R; Samidurai, R; Anthoni, S M

2010-01-01

In this paper, we study the global exponential stability of time-delayed stochastic bidirectional associative memory neural networks with impulses and Markovian jumping parameters. A generalized activation function is considered, and traditional assumptions on the boundedness, monotony and differentiability of activation functions are removed. We obtain a new set of sufficient conditions in terms of linear matrix inequalities, which ensures the global exponential stability of the unique equilibrium point for stochastic BAM neural networks with impulses. The Lyapunov function method with the Ito differential rule is employed for achieving the required result. Moreover, a numerical example is provided to show that the proposed result improves the allowable upper bound of delays over some existing results in the literature.

New exponential stability criteria for stochastic BAM neural networks with impulses

Science.gov (United States)

Sakthivel, R.; Samidurai, R.; Anthoni, S. M.

2010-10-01

In this paper, we study the global exponential stability of time-delayed stochastic bidirectional associative memory neural networks with impulses and Markovian jumping parameters. A generalized activation function is considered, and traditional assumptions on the boundedness, monotony and differentiability of activation functions are removed. We obtain a new set of sufficient conditions in terms of linear matrix inequalities, which ensures the global exponential stability of the unique equilibrium point for stochastic BAM neural networks with impulses. The Lyapunov function method with the Itô differential rule is employed for achieving the required result. Moreover, a numerical example is provided to show that the proposed result improves the allowable upper bound of delays over some existing results in the literature.

Stochastic Tools for Network Intrusion Detection

OpenAIRE

Yu, Lu; Brooks, Richard R.

2017-01-01

With the rapid development of Internet and the sharp increase of network crime, network security has become very important and received a lot of attention. We model security issues as stochastic systems. This allows us to find weaknesses in existing security systems and propose new solutions. Exploring the vulnerabilities of existing security tools can prevent cyber-attacks from taking advantages of the system weaknesses. We propose a hybrid network security scheme including intrusion detecti...

Dynamic analysis of stochastic bidirectional associative memory neural networks with delays

International Nuclear Information System (INIS)

Zhao Hongyong; Ding Nan

2007-01-01

In this paper, stochastic bidirectional associative memory neural networks model with delays is considered. By constructing Lyapunov functionals, and using stochastic analysis method and inequality technique, we give some sufficient criteria ensuring almost sure exponential stability, pth exponential stability and mean value exponential stability. The obtained criteria can be used as theoretic guidance to stabilize neural networks in practical applications when stochastic noise is taken into consideration

Synchronization of a Class of Memristive Stochastic Bidirectional Associative Memory Neural Networks with Mixed Time-Varying Delays via Sampled-Data Control

Directory of Open Access Journals (Sweden)

Manman Yuan

2018-01-01

Full Text Available The paper addresses the issue of synchronization of memristive bidirectional associative memory neural networks (MBAMNNs with mixed time-varying delays and stochastic perturbation via a sampled-data controller. First, we propose a new model of MBAMNNs with mixed time-varying delays. In the proposed approach, the mixed delays include time-varying distributed delays and discrete delays. Second, we design a new method of sampled-data control for the stochastic MBAMNNs. Traditional control methods lack the capability of reflecting variable synaptic weights. In this paper, the methods are carefully designed to confirm the synchronization processes are suitable for the feather of the memristor. Third, sufficient criteria guaranteeing the synchronization of the systems are derived based on the derive-response concept. Finally, the effectiveness of the proposed mechanism is validated with numerical experiments.

Stochastic nature of series of waiting times

Science.gov (United States)

Anvari, Mehrnaz; Aghamohammadi, Cina; Dashti-Naserabadi, H.; Salehi, E.; Behjat, E.; Qorbani, M.; Khazaei Nezhad, M.; Zirak, M.; Hadjihosseini, Ali; Peinke, Joachim; Tabar, M. Reza Rahimi

2013-06-01

Although fluctuations in the waiting time series have been studied for a long time, some important issues such as its long-range memory and its stochastic features in the presence of nonstationarity have so far remained unstudied. Here we find that the “waiting times” series for a given increment level have long-range correlations with Hurst exponents belonging to the interval 1/2time distribution. We find that the logarithmic difference of waiting times series has a short-range correlation, and then we study its stochastic nature using the Markovian method and determine the corresponding Kramers-Moyal coefficients. As an example, we analyze the velocity fluctuations in high Reynolds number turbulence and determine the level dependence of Markov time scales, as well as the drift and diffusion coefficients. We show that the waiting time distributions exhibit power law tails, and we were able to model the distribution with a continuous time random walk.

Transcriptional dynamics with time-dependent reaction rates

Science.gov (United States)

Nandi, Shubhendu; Ghosh, Anandamohan

2015-02-01

Transcription is the first step in the process of gene regulation that controls cell response to varying environmental conditions. Transcription is a stochastic process, involving synthesis and degradation of mRNAs, that can be modeled as a birth-death process. We consider a generic stochastic model, where the fluctuating environment is encoded in the time-dependent reaction rates. We obtain an exact analytical expression for the mRNA probability distribution and are able to analyze the response for arbitrary time-dependent protocols. Our analytical results and stochastic simulations confirm that the transcriptional machinery primarily act as a low-pass filter. We also show that depending on the system parameters, the mRNA levels in a cell population can show synchronous/asynchronous fluctuations and can deviate from Poisson statistics.

Transcriptional dynamics with time-dependent reaction rates

International Nuclear Information System (INIS)

Nandi, Shubhendu; Ghosh, Anandamohan

2015-01-01

Transcription is the first step in the process of gene regulation that controls cell response to varying environmental conditions. Transcription is a stochastic process, involving synthesis and degradation of mRNAs, that can be modeled as a birth–death process. We consider a generic stochastic model, where the fluctuating environment is encoded in the time-dependent reaction rates. We obtain an exact analytical expression for the mRNA probability distribution and are able to analyze the response for arbitrary time-dependent protocols. Our analytical results and stochastic simulations confirm that the transcriptional machinery primarily act as a low-pass filter. We also show that depending on the system parameters, the mRNA levels in a cell population can show synchronous/asynchronous fluctuations and can deviate from Poisson statistics. (paper)

Investment timing under hybrid stochastic and local volatility

International Nuclear Information System (INIS)

Kim, Jeong-Hoon; Lee, Min-Ku; Sohn, So Young

2014-01-01

Highlights: • The effects of hybrid stochastic volatility on real option prices are studied. • The stochastic volatility consists of a fast mean-reverting component and a CEV type one. • A fast mean-reverting factor lowers real option prices and investment thresholds. • The increase of elasticity raises real option prices and investment thresholds. • The effects of the addition of a slowly varying factor depend upon the project value. - Abstract: We consider an investment timing problem under a real option model where the instantaneous volatility of the project value is given by a combination of a hidden stochastic process and the project value itself. The stochastic volatility part is given by a function of a fast mean-reverting process as well as a slowly varying process and the local volatility part is a power (the elasticity parameter) of the project value itself. The elasticity parameter controls directly the correlation between the project value and the volatility. Knowing that the project value represents the market price of a real asset in many applications and the value of the elasticity parameter depends on the asset, the elasticity parameter should be treated with caution for investment decision problems. Based on the hybrid structure of volatility, we investigate the simultaneous impact of the elasticity and the stochastic volatility on the real option value as well as the investment threshold

Stochastic stability analysis for delayed neural networks of neutral type with Markovian jump parameters

International Nuclear Information System (INIS)

Lou Xuyang; Cui Baotong

2009-01-01

In this paper, the problem of stochastic stability for a class of delayed neural networks of neutral type with Markovian jump parameters is investigated. The jumping parameters are modelled as a continuous-time, discrete-state Markov process. A sufficient condition guaranteeing the stochastic stability of the equilibrium point is derived for the Markovian jumping delayed neural networks (MJDNNs) with neutral type. The stability criterion not only eliminates the differences between excitatory and inhibitory effects on the neural networks, but also can be conveniently checked. The sufficient condition obtained can be essentially solved in terms of linear matrix inequality. A numerical example is given to show the effectiveness of the obtained results.

Stochastic sensitivity analysis and Langevin simulation for neural network learning

International Nuclear Information System (INIS)

Koda, Masato

1997-01-01

A comprehensive theoretical framework is proposed for the learning of a class of gradient-type neural networks with an additive Gaussian white noise process. The study is based on stochastic sensitivity analysis techniques, and formal expressions are obtained for stochastic learning laws in terms of functional derivative sensitivity coefficients. The present method, based on Langevin simulation techniques, uses only the internal states of the network and ubiquitous noise to compute the learning information inherent in the stochastic correlation between noise signals and the performance functional. In particular, the method does not require the solution of adjoint equations of the back-propagation type. Thus, the present algorithm has the potential for efficiently learning network weights with significantly fewer computations. Application to an unfolded multi-layered network is described, and the results are compared with those obtained by using a back-propagation method

Confinement and diffusion modulate bistability and stochastic switching in a reaction network with positive feedback

International Nuclear Information System (INIS)

Mlynarczyk, Paul J.; Pullen, Robert H.; Abel, Steven M.

2016-01-01

Positive feedback is a common feature in signal transduction networks and can lead to phenomena such as bistability and signal propagation by domain growth. Physical features of the cellular environment, such as spatial confinement and the mobility of proteins, play important but inadequately understood roles in shaping the behavior of signaling networks. Here, we use stochastic, spatially resolved kinetic Monte Carlo simulations to explore a positive feedback network as a function of system size, system shape, and mobility of molecules. We show that these physical properties can markedly alter characteristics of bistability and stochastic switching when compared with well-mixed simulations. Notably, systems of equal volume but different shapes can exhibit qualitatively different behaviors under otherwise identical conditions. We show that stochastic switching to a state maintained by positive feedback occurs by cluster formation and growth. Additionally, the frequency at which switching occurs depends nontrivially on the diffusion coefficient, which can promote or suppress switching relative to the well-mixed limit. Taken together, the results provide a framework for understanding how confinement and protein mobility influence emergent features of the positive feedback network by modulating molecular concentrations, diffusion-influenced rate parameters, and spatiotemporal correlations between molecules

Noisy time-dependent spectra

International Nuclear Information System (INIS)

Shore, B.W.; Eberly, J.H.

1983-01-01

The definition of a time-dependent spectrum registered by an idealized spectrometer responding to a time-varying electromagnetic field as proposed by Eberly and Wodkiewicz and subsequently applied to the spectrum of laser-induced fluorescence by Eberly, Kunasz, and Wodkiewicz is here extended to allow a stochastically fluctuating (interruption model) environment: we provide an algorithm for numerical determination of the time-dependent fluorescence spectrum of an atom subject to excitation by an intense noisy laser and interruptive relaxation

A Rigorous Temperature-Dependent Stochastic Modelling and Testing for MEMS-Based Inertial Sensor Errors

Directory of Open Access Journals (Sweden)

Spiros Pagiatakis

2009-10-01

Full Text Available In this paper, we examine the effect of changing the temperature points on MEMS-based inertial sensor random error. We collect static data under different temperature points using a MEMS-based inertial sensor mounted inside a thermal chamber. Rigorous stochastic models, namely Autoregressive-based Gauss-Markov (AR-based GM models are developed to describe the random error behaviour. The proposed AR-based GM model is initially applied to short stationary inertial data to develop the stochastic model parameters (correlation times. It is shown that the stochastic model parameters of a MEMS-based inertial unit, namely the ADIS16364, are temperature dependent. In addition, field kinematic test data collected at about 17 °C are used to test the performance of the stochastic models at different temperature points in the filtering stage using Unscented Kalman Filter (UKF. It is shown that the stochastic model developed at 20 °C provides a more accurate inertial navigation solution than the ones obtained from the stochastic models developed at −40 °C, −20 °C, 0 °C, +40 °C, and +60 °C. The temperature dependence of the stochastic model is significant and should be considered at all times to obtain optimal navigation solution for MEMS-based INS/GPS integration.

A Rigorous Temperature-Dependent Stochastic Modelling and Testing for MEMS-Based Inertial Sensor Errors.

Science.gov (United States)

El-Diasty, Mohammed; Pagiatakis, Spiros

2009-01-01

In this paper, we examine the effect of changing the temperature points on MEMS-based inertial sensor random error. We collect static data under different temperature points using a MEMS-based inertial sensor mounted inside a thermal chamber. Rigorous stochastic models, namely Autoregressive-based Gauss-Markov (AR-based GM) models are developed to describe the random error behaviour. The proposed AR-based GM model is initially applied to short stationary inertial data to develop the stochastic model parameters (correlation times). It is shown that the stochastic model parameters of a MEMS-based inertial unit, namely the ADIS16364, are temperature dependent. In addition, field kinematic test data collected at about 17 °C are used to test the performance of the stochastic models at different temperature points in the filtering stage using Unscented Kalman Filter (UKF). It is shown that the stochastic model developed at 20 °C provides a more accurate inertial navigation solution than the ones obtained from the stochastic models developed at -40 °C, -20 °C, 0 °C, +40 °C, and +60 °C. The temperature dependence of the stochastic model is significant and should be considered at all times to obtain optimal navigation solution for MEMS-based INS/GPS integration.

Stochastic Resonance in Neuronal Network Motifs with Ornstein-Uhlenbeck Colored Noise

Directory of Open Access Journals (Sweden)

Xuyang Lou

2014-01-01

Full Text Available We consider here the effect of the Ornstein-Uhlenbeck colored noise on the stochastic resonance of the feed-forward-loop (FFL network motif. The FFL motif is modeled through the FitzHugh-Nagumo neuron model as well as the chemical coupling. Our results show that the noise intensity and the correlation time of the noise process serve as the control parameters, which have great impacts on the stochastic dynamics of the FFL motif. We find that, with a proper choice of noise intensities and the correlation time of the noise process, the signal-to-noise ratio (SNR can display more than one peak.

A Multilevel Adaptive Reaction-splitting Simulation Method for Stochastic Reaction Networks

KAUST Repository

Moraes, Alvaro; Tempone, Raul; Vilanova, Pedro

2016-01-01

In this work, we present a novel multilevel Monte Carlo method for kinetic simulation of stochastic reaction networks characterized by having simultaneously fast and slow reaction channels. To produce efficient simulations, our method adaptively classifies the reactions channels into fast and slow channels. To this end, we first introduce a state-dependent quantity named level of activity of a reaction channel. Then, we propose a low-cost heuristic that allows us to adaptively split the set of reaction channels into two subsets characterized by either a high or a low level of activity. Based on a time-splitting technique, the increments associated with high-activity channels are simulated using the tau-leap method, while those associated with low-activity channels are simulated using an exact method. This path simulation technique is amenable for coupled path generation and a corresponding multilevel Monte Carlo algorithm. To estimate expected values of observables of the system at a prescribed final time, our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This goal is achieved with a computational complexity of order O(TOL-2), the same as with a pathwise-exact method, but with a smaller constant. We also present a novel low-cost control variate technique based on the stochastic time change representation by Kurtz, showing its performance on a numerical example. We present two numerical examples extracted from the literature that show how the reaction-splitting method obtains substantial gains with respect to the standard stochastic simulation algorithm and the multilevel Monte Carlo approach by Anderson and Higham. © 2016 Society for Industrial and Applied Mathematics.

A Multilevel Adaptive Reaction-splitting Simulation Method for Stochastic Reaction Networks

KAUST Repository

Moraes, Alvaro

2016-07-07

In this work, we present a novel multilevel Monte Carlo method for kinetic simulation of stochastic reaction networks characterized by having simultaneously fast and slow reaction channels. To produce efficient simulations, our method adaptively classifies the reactions channels into fast and slow channels. To this end, we first introduce a state-dependent quantity named level of activity of a reaction channel. Then, we propose a low-cost heuristic that allows us to adaptively split the set of reaction channels into two subsets characterized by either a high or a low level of activity. Based on a time-splitting technique, the increments associated with high-activity channels are simulated using the tau-leap method, while those associated with low-activity channels are simulated using an exact method. This path simulation technique is amenable for coupled path generation and a corresponding multilevel Monte Carlo algorithm. To estimate expected values of observables of the system at a prescribed final time, our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This goal is achieved with a computational complexity of order O(TOL-2), the same as with a pathwise-exact method, but with a smaller constant. We also present a novel low-cost control variate technique based on the stochastic time change representation by Kurtz, showing its performance on a numerical example. We present two numerical examples extracted from the literature that show how the reaction-splitting method obtains substantial gains with respect to the standard stochastic simulation algorithm and the multilevel Monte Carlo approach by Anderson and Higham. © 2016 Society for Industrial and Applied Mathematics.

Predicting Flow Breakdown Probability and Duration in Stochastic Network Models: Impact on Travel Time Reliability

Energy Technology Data Exchange (ETDEWEB)

Dong, Jing [ORNL; Mahmassani, Hani S. [Northwestern University, Evanston

2011-01-01

This paper proposes a methodology to produce random flow breakdown endogenously in a mesoscopic operational model, by capturing breakdown probability and duration. Based on previous research findings that probability of flow breakdown can be represented as a function of flow rate and the duration can be characterized by a hazard model. By generating random flow breakdown at various levels and capturing the traffic characteristics at the onset of the breakdown, the stochastic network simulation model provides a tool for evaluating travel time variability. The proposed model can be used for (1) providing reliability related traveler information; (2) designing ITS (intelligent transportation systems) strategies to improve reliability; and (3) evaluating reliability-related performance measures of the system.

Mean Square Synchronization of Stochastic Nonlinear Delayed Coupled Complex Networks

Directory of Open Access Journals (Sweden)

Chengrong Xie

2013-01-01

Full Text Available We investigate the problem of adaptive mean square synchronization for nonlinear delayed coupled complex networks with stochastic perturbation. Based on the LaSalle invariance principle and the properties of the Weiner process, the controller and adaptive laws are designed to ensure achieving stochastic synchronization and topology identification of complex networks. Sufficient conditions are given to ensure the complex networks to be mean square synchronization. Furthermore, numerical simulations are also given to demonstrate the effectiveness of the proposed scheme.

Complex network approach to fractional time series

Energy Technology Data Exchange (ETDEWEB)

Manshour, Pouya [Physics Department, Persian Gulf University, Bushehr 75169 (Iran, Islamic Republic of)

2015-10-15

In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility algorithm is not an appropriate one to study the correlation aspects of a time series. We then employ the horizontal visibility algorithm, as a much simpler one, to map fractional processes onto complex networks. The degree distributions are shown to have parabolic exponential forms with Hurst dependent fitting parameter. Further, we take into account other topological properties such as maximum eigenvalue of the adjacency matrix and the degree assortativity, and show that such topological quantities can also be used to predict the Hurst exponent, with an exception for anti-persistent fractional Gaussian noises. To solve this problem, we take into account the Spearman correlation coefficient between nodes' degrees and their corresponding data values in the original time series.

Stochastic resonance on Newman-Watts networks of Hodgkin-Huxley neurons with local periodic driving

Energy Technology Data Exchange (ETDEWEB)

Ozer, Mahmut [Zonguldak Karaelmas University, Engineering Faculty, Department of Electrical and Electronics Engineering, 67100 Zonguldak (Turkey)], E-mail: mahmutozer2002@yahoo.com; Perc, Matjaz [University of Maribor, Faculty of Natural Sciences and Mathematics, Department of Physics, Koroska cesta 160, SI-2000 Maribor (Slovenia); Uzuntarla, Muhammet [Zonguldak Karaelmas University, Engineering Faculty, Department of Electrical and Electronics Engineering, 67100 Zonguldak (Turkey)

2009-03-02

We study the phenomenon of stochastic resonance on Newman-Watts small-world networks consisting of biophysically realistic Hodgkin-Huxley neurons with a tunable intensity of intrinsic noise via voltage-gated ion channels embedded in neuronal membranes. Importantly thereby, the subthreshold periodic driving is introduced to a single neuron of the network, thus acting as a pacemaker trying to impose its rhythm on the whole ensemble. We show that there exists an optimal intensity of intrinsic ion channel noise by which the outreach of the pacemaker extends optimally across the whole network. This stochastic resonance phenomenon can be further amplified via fine-tuning of the small-world network structure, and depends significantly also on the coupling strength among neurons and the driving frequency of the pacemaker. In particular, we demonstrate that the noise-induced transmission of weak localized rhythmic activity peaks when the pacemaker frequency matches the intrinsic frequency of subthreshold oscillations. The implications of our findings for weak signal detection and information propagation across neural networks are discussed.

Broadcast Abstraction in a Stochastic Calculus for Mobile Networks

DEFF Research Database (Denmark)

Song, Lei; Godskesen, Jens Christian

2012-01-01

topology constraint. We allow continuous time stochastic behavior of processes running at network nodes, e.g. in order to be able to model randomized protocols. The introduction of group broadcast and an operator to help avoid flooding allows us to define a novel notion of broadcast abstraction. Finally......, we define a weak bisimulation congruence and apply our theory on an example of a leader election protocol....

Stochastic Geometric Network Models for Groups of Functional and Structural Connectomes

Science.gov (United States)

Friedman, Eric J.; Landsberg, Adam S.; Owen, Julia P.; Li, Yi-Ou; Mukherjee, Pratik

2014-01-01

Structural and functional connectomes are emerging as important instruments in the study of normal brain function and in the development of new biomarkers for a variety of brain disorders. In contrast to single-network studies that presently dominate the (non-connectome) network literature, connectome analyses typically examine groups of empirical networks and then compare these against standard (stochastic) network models. Current practice in connectome studies is to employ stochastic network models derived from social science and engineering contexts as the basis for the comparison. However, these are not necessarily best suited for the analysis of connectomes, which often contain groups of very closely related networks, such as occurs with a set of controls or a set of patients with a specific disorder. This paper studies important extensions of standard stochastic models that make them better adapted for analysis of connectomes, and develops new statistical fitting methodologies that account for inter-subject variations. The extensions explicitly incorporate geometric information about a network based on distances and inter/intra hemispherical asymmetries (to supplement ordinary degree-distribution information), and utilize a stochastic choice of networks' density levels (for fixed threshold networks) to better capture the variance in average connectivity among subjects. The new statistical tools introduced here allow one to compare groups of networks by matching both their average characteristics and the variations among them. A notable finding is that connectomes have high “smallworldness” beyond that arising from geometric and degree considerations alone. PMID:25067815

Learn-and-Adapt Stochastic Dual Gradients for Network Resource Allocation

OpenAIRE

Chen, Tianyi; Ling, Qing; Giannakis, Georgios B.

2017-01-01

Network resource allocation shows revived popularity in the era of data deluge and information explosion. Existing stochastic optimization approaches fall short in attaining a desirable cost-delay tradeoff. Recognizing the central role of Lagrange multipliers in network resource allocation, a novel learn-and-adapt stochastic dual gradient (LA-SDG) method is developed in this paper to learn the sample-optimal Lagrange multiplier from historical data, and accordingly adapt the upcoming resource...

Evolving Stochastic Learning Algorithm based on Tsallis entropic index

Science.gov (United States)

Anastasiadis, A. D.; Magoulas, G. D.

2006-03-01

In this paper, inspired from our previous algorithm, which was based on the theory of Tsallis statistical mechanics, we develop a new evolving stochastic learning algorithm for neural networks. The new algorithm combines deterministic and stochastic search steps by employing a different adaptive stepsize for each network weight, and applies a form of noise that is characterized by the nonextensive entropic index q, regulated by a weight decay term. The behavior of the learning algorithm can be made more stochastic or deterministic depending on the trade off between the temperature T and the q values. This is achieved by introducing a formula that defines a time-dependent relationship between these two important learning parameters. Our experimental study verifies that there are indeed improvements in the convergence speed of this new evolving stochastic learning algorithm, which makes learning faster than using the original Hybrid Learning Scheme (HLS). In addition, experiments are conducted to explore the influence of the entropic index q and temperature T on the convergence speed and stability of the proposed method.

Autapse-induced multiple stochastic resonances in a modular neuronal network

Science.gov (United States)

Yang, XiaoLi; Yu, YanHu; Sun, ZhongKui

2017-08-01

This study investigates the nontrivial effects of autapse on stochastic resonance in a modular neuronal network subjected to bounded noise. The resonance effect of autapse is detected by imposing a self-feedback loop with autaptic strength and autaptic time delay to each constituent neuron. Numerical simulations have demonstrated that bounded noise with the proper level of amplitude can induce stochastic resonance; moreover, the noise induced resonance dynamics can be significantly shaped by the autapse. In detail, for a specific range of autaptic strength, multiple stochastic resonances can be induced when the autaptic time delays are appropriately adjusted. These appropriately adjusted delays are detected to nearly approach integer multiples of the period of the external weak signal when the autaptic strength is very near zero; otherwise, they do not match the period of the external weak signal when the autaptic strength is slightly greater than zero. Surprisingly, in both cases, the differences between arbitrary two adjacent adjusted autaptic delays are always approximately equal to the period of the weak signal. The phenomenon of autaptic delay induced multiple stochastic resonances is further confirmed to be robust against the period of the external weak signal and the intramodule probability of subnetwork. These findings could have important implications for weak signal detection and information propagation in realistic neural systems.

HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks

International Nuclear Information System (INIS)

Marchetti, Luca; Priami, Corrado; Thanh, Vo Hong

2016-01-01

This paper introduces HRSSA (Hybrid Rejection-based Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage time-varying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.

HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks

Energy Technology Data Exchange (ETDEWEB)

Marchetti, Luca, E-mail: marchetti@cosbi.eu [The Microsoft Research – University of Trento Centre for Computational and Systems Biology (COSBI), Piazza Manifattura, 1, 38068 Rovereto (Italy); Priami, Corrado, E-mail: priami@cosbi.eu [The Microsoft Research – University of Trento Centre for Computational and Systems Biology (COSBI), Piazza Manifattura, 1, 38068 Rovereto (Italy); University of Trento, Department of Mathematics (Italy); Thanh, Vo Hong, E-mail: vo@cosbi.eu [The Microsoft Research – University of Trento Centre for Computational and Systems Biology (COSBI), Piazza Manifattura, 1, 38068 Rovereto (Italy)

2016-07-15

This paper introduces HRSSA (Hybrid Rejection-based Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage time-varying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.

Maximal network reliability for a stochastic power transmission network

International Nuclear Information System (INIS)

Lin, Yi-Kuei; Yeh, Cheng-Ta

2011-01-01

Many studies regarded a power transmission network as a binary-state network and constructed it with several arcs and vertices to evaluate network reliability. In practice, the power transmission network should be stochastic because each arc (transmission line) combined with several physical lines is multistate. Network reliability is the probability that the network can transmit d units of electric power from a power plant (source) to a high voltage substation at a specific area (sink). This study focuses on searching for the optimal transmission line assignment to the power transmission network such that network reliability is maximized. A genetic algorithm based method integrating the minimal paths and the Recursive Sum of Disjoint Products is developed to solve this assignment problem. A real power transmission network is adopted to demonstrate the computational efficiency of the proposed method while comparing with the random solution generation approach.

Study on the influence of stochastic properties of correction terms on the reliability of instantaneous network RTK

Science.gov (United States)

Próchniewicz, Dominik

2014-03-01

The reliability of precision GNSS positioning primarily depends on correct carrier-phase ambiguity resolution. An optimal estimation and correct validation of ambiguities necessitates a proper definition of mathematical positioning model. Of particular importance in the model definition is the taking into account of the atmospheric errors (ionospheric and tropospheric refraction) as well as orbital errors. The use of the network of reference stations in kinematic positioning, known as Network-based Real-Time Kinematic (Network RTK) solution, facilitates the modeling of such errors and their incorporation, in the form of correction terms, into the functional description of positioning model. Lowered accuracy of corrections, especially during atmospheric disturbances, results in the occurrence of unaccounted biases, the so-called residual errors. The taking into account of such errors in Network RTK positioning model is possible by incorporating the accuracy characteristics of the correction terms into the stochastic model of observations. In this paper we investigate the impact of the expansion of the stochastic model to include correction term variances on the reliability of the model solution. In particular the results of instantaneous solution that only utilizes a single epoch of GPS observations, is analyzed. Such a solution mode due to the low number of degrees of freedom is very sensitive to an inappropriate mathematical model definition. Thus the high level of the solution reliability is very difficult to achieve. Numerical tests performed for a test network located in mountain area during ionospheric disturbances allows to verify the described method for the poor measurement conditions. The results of the ambiguity resolution as well as the rover positioning accuracy shows that the proposed method of stochastic modeling can increase the reliability of instantaneous Network RTK performance.

A stochastic approach to anelastic creep

International Nuclear Information System (INIS)

Venkataraman, G.

1976-01-01

Anelastic creep or the time-dependent yielding or a material subjected to external stresses has been found to be of great importantance in technology in the recent years, particularly in engineering structures including nuclear reactors wherein structural members may be under stress. The physics aspects underlying this phenomenon is dealt with in detail. The basics of time-dependent elasticity, constitutive relation, network models, constitutive equation in the frequency domain and its mearurements, and stochastic approach to creep are discussed. (K.B.)

On the Use of Information Quality in Stochastic Networked Control Systems

DEFF Research Database (Denmark)

Olsen, Rasmus Løvenstein; Madsen, Jacob Theilgaard; Rasmussen, Jakob Gulddahl

2017-01-01

Networked control is challenged by stochastic delays that are caused by the communication networks as well as by the approach taken to exchange information about system state and set-points. Combined with stochastic changing information, there is a probability that information at the controller....... This is first analyzed in simulation models for the example system of a wind-farm controller. As simulation analysis is subject to stochastic variability and requires large computational effort, the paper develops a Markov model of a simplified networked control system and uses numerical results from the Markov...... is not matching the true system observation, which we call mismatch probability (mmPr). The hypothesis is that the optimization of certain parameters of networked control systems targeting mmPr is equivalent to the optimization targeting control performance, while the former is practically much easier to conduct...

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

International Nuclear Information System (INIS)

Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin

2015-01-01

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing

Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule

Energy Technology Data Exchange (ETDEWEB)

Liu, Hui; Song, Yongduan; Xue, Fangzheng; Li, Xiumin, E-mail: xmli@cqu.edu.cn [Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education, Chongqing University, Chongqing 400044 (China); College of Automation, Chongqing University, Chongqing 400044 (China)

2015-11-15

In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.

Modeling stochasticity in biochemical reaction networks

International Nuclear Information System (INIS)

Constantino, P H; Vlysidis, M; Smadbeck, P; Kaznessis, Y N

2016-01-01

Small biomolecular systems are inherently stochastic. Indeed, fluctuations of molecular species are substantial in living organisms and may result in significant variation in cellular phenotypes. The chemical master equation (CME) is the most detailed mathematical model that can describe stochastic behaviors. However, because of its complexity the CME has been solved for only few, very small reaction networks. As a result, the contribution of CME-based approaches to biology has been very limited. In this review we discuss the approach of solving CME by a set of differential equations of probability moments, called moment equations. We present different approaches to produce and to solve these equations, emphasizing the use of factorial moments and the zero information entropy closure scheme. We also provide information on the stability analysis of stochastic systems. Finally, we speculate on the utility of CME-based modeling formalisms, especially in the context of synthetic biology efforts. (topical review)

Collective stochastic coherence in recurrent neuronal networks

Science.gov (United States)

Sancristóbal, Belén; Rebollo, Beatriz; Boada, Pol; Sanchez-Vives, Maria V.; Garcia-Ojalvo, Jordi

2016-09-01

Recurrent networks of dynamic elements frequently exhibit emergent collective oscillations, which can show substantial regularity even when the individual elements are considerably noisy. How noise-induced dynamics at the local level coexists with regular oscillations at the global level is still unclear. Here we show that a combination of stochastic recurrence-based initiation with deterministic refractoriness in an excitable network can reconcile these two features, leading to maximum collective coherence for an intermediate noise level. We report this behaviour in the slow oscillation regime exhibited by a cerebral cortex network under dynamical conditions resembling slow-wave sleep and anaesthesia. Computational analysis of a biologically realistic network model reveals that an intermediate level of background noise leads to quasi-regular dynamics. We verify this prediction experimentally in cortical slices subject to varying amounts of extracellular potassium, which modulates neuronal excitability and thus synaptic noise. The model also predicts that this effectively regular state should exhibit noise-induced memory of the spatial propagation profile of the collective oscillations, which is also verified experimentally. Taken together, these results allow us to construe the high regularity observed experimentally in the brain as an instance of collective stochastic coherence.

Phase transitions and self-organized criticality in networks of stochastic spiking neurons.

Science.gov (United States)

Brochini, Ludmila; de Andrade Costa, Ariadne; Abadi, Miguel; Roque, Antônio C; Stolfi, Jorge; Kinouchi, Osame

2016-11-07

Phase transitions and critical behavior are crucial issues both in theoretical and experimental neuroscience. We report analytic and computational results about phase transitions and self-organized criticality (SOC) in networks with general stochastic neurons. The stochastic neuron has a firing probability given by a smooth monotonic function Φ(V) of the membrane potential V, rather than a sharp firing threshold. We find that such networks can operate in several dynamic regimes (phases) depending on the average synaptic weight and the shape of the firing function Φ. In particular, we encounter both continuous and discontinuous phase transitions to absorbing states. At the continuous transition critical boundary, neuronal avalanches occur whose distributions of size and duration are given by power laws, as observed in biological neural networks. We also propose and test a new mechanism to produce SOC: the use of dynamic neuronal gains - a form of short-term plasticity probably located at the axon initial segment (AIS) - instead of depressing synapses at the dendrites (as previously studied in the literature). The new self-organization mechanism produces a slightly supercritical state, that we called SOSC, in accord to some intuitions of Alan Turing.

Stochastic lag time in nucleated linear self-assembly

Energy Technology Data Exchange (ETDEWEB)

Tiwari, Nitin S. [Group Theory of Polymers and Soft Matter, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven (Netherlands); Schoot, Paul van der [Group Theory of Polymers and Soft Matter, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven (Netherlands); Institute for Theoretical Physics, Utrecht University, Leuvenlaan 4, 3584 CE Utrecht (Netherlands)

2016-06-21

Protein aggregation is of great importance in biology, e.g., in amyloid fibrillation. The aggregation processes that occur at the cellular scale must be highly stochastic in nature because of the statistical number fluctuations that arise on account of the small system size at the cellular scale. We study the nucleated reversible self-assembly of monomeric building blocks into polymer-like aggregates using the method of kinetic Monte Carlo. Kinetic Monte Carlo, being inherently stochastic, allows us to study the impact of fluctuations on the polymerization reactions. One of the most important characteristic features in this kind of problem is the existence of a lag phase before self-assembly takes off, which is what we focus attention on. We study the associated lag time as a function of system size and kinetic pathway. We find that the leading order stochastic contribution to the lag time before polymerization commences is inversely proportional to the system volume for large-enough system size for all nine reaction pathways tested. Finite-size corrections to this do depend on the kinetic pathway.

Stochastic simulation of karst conduit networks

Science.gov (United States)

Pardo-Igúzquiza, Eulogio; Dowd, Peter A.; Xu, Chaoshui; Durán-Valsero, Juan José

2012-01-01

Karst aquifers have very high spatial heterogeneity. Essentially, they comprise a system of pipes (i.e., the network of conduits) superimposed on rock porosity and on a network of stratigraphic surfaces and fractures. This heterogeneity strongly influences the hydraulic behavior of the karst and it must be reproduced in any realistic numerical model of the karst system that is used as input to flow and transport modeling. However, the directly observed karst conduits are only a small part of the complete karst conduit system and knowledge of the complete conduit geometry and topology remains spatially limited and uncertain. Thus, there is a special interest in the stochastic simulation of networks of conduits that can be combined with fracture and rock porosity models to provide a realistic numerical model of the karst system. Furthermore, the simulated model may be of interest per se and other uses could be envisaged. The purpose of this paper is to present an efficient method for conditional and non-conditional stochastic simulation of karst conduit networks. The method comprises two stages: generation of conduit geometry and generation of topology. The approach adopted is a combination of a resampling method for generating conduit geometries from templates and a modified diffusion-limited aggregation method for generating the network topology. The authors show that the 3D karst conduit networks generated by the proposed method are statistically similar to observed karst conduit networks or to a hypothesized network model. The statistical similarity is in the sense of reproducing the tortuosity index of conduits, the fractal dimension of the network, the direction rose of directions, the Z-histogram and Ripley's K-function of the bifurcation points (which differs from a random allocation of those bifurcation points). The proposed method (1) is very flexible, (2) incorporates any experimental data (conditioning information) and (3) can easily be modified when

Delay-Dependent Exponential Stability for Discrete-Time BAM Neural Networks with Time-Varying Delays

Directory of Open Access Journals (Sweden)

Yonggang Chen

2008-01-01

Full Text Available This paper considers the delay-dependent exponential stability for discrete-time BAM neural networks with time-varying delays. By constructing the new Lyapunov functional, the improved delay-dependent exponential stability criterion is derived in terms of linear matrix inequality (LMI. Moreover, in order to reduce the conservativeness, some slack matrices are introduced in this paper. Two numerical examples are presented to show the effectiveness and less conservativeness of the proposed method.

Redesign of a supply network by considering stochastic demand

Directory of Open Access Journals (Sweden)

Juan Camilo Paz

2015-09-01

Full Text Available This paper presents the problem of redesigning a supply network of large scale by considering variability of the demand. The central problematic takes root in determining strategic decisions of closing and adjusting of capacity of some network echelons and the tactical decisions concerning to the distribution channels used for transporting products. We have formulated a deterministic Mixed Integer Linear Programming Model (MILP and a stochastic MILP model (SMILP whose objective functions are the maximization of the EBITDA (Earnings before Interest, Taxes, Depreciation and Amortization. The decisions of Network Design on stochastic model as capacities, number of warehouses in operation, material and product flows between echelons, are determined in a single stage by defining an objective function that penalizes unsatisfied demand and surplus of demand due to demand changes. The solution strategy adopted for the stochastic model is a scheme denominated as Sample Average Approximation (SAA. The model is based on the case of a Colombian company dedicated to production and marketing of foodstuffs and supplies for the bakery industry. The results show that the proposed methodology was a solid reference for decision support regarding to the supply networks redesign by considering the expected economic contribution of products and variability of the demand.

Stochastic exponential stability of the delayed reaction-diffusion recurrent neural networks with Markovian jumping parameters

International Nuclear Information System (INIS)

Wang Linshan; Zhang Zhe; Wang Yangfan

2008-01-01

Some criteria for the global stochastic exponential stability of the delayed reaction-diffusion recurrent neural networks with Markovian jumping parameters are presented. The jumping parameters considered here are generated from a continuous-time discrete-state homogeneous Markov process, which are governed by a Markov process with discrete and finite state space. By employing a new Lyapunov-Krasovskii functional, a linear matrix inequality (LMI) approach is developed to establish some easy-to-test criteria of global exponential stability in the mean square for the stochastic neural networks. The criteria are computationally efficient, since they are in the forms of some linear matrix inequalities

Modeling and simulating the adaptive electrical properties of stochastic polymeric 3D networks

International Nuclear Information System (INIS)

Sigala, R; Smerieri, A; Camorani, P; Schüz, A; Erokhin, V

2013-01-01

Memristors are passive two-terminal circuit elements that combine resistance and memory. Although in theory memristors are a very promising approach to fabricate hardware with adaptive properties, there are only very few implementations able to show their basic properties. We recently developed stochastic polymeric matrices with a functionality that evidences the formation of self-assembled three-dimensional (3D) networks of memristors. We demonstrated that those networks show the typical hysteretic behavior observed in the ‘one input-one output’ memristive configuration. Interestingly, using different protocols to electrically stimulate the networks, we also observed that their adaptive properties are similar to those present in the nervous system. Here, we model and simulate the electrical properties of these self-assembled polymeric networks of memristors, the topology of which is defined stochastically. First, we show that the model recreates the hysteretic behavior observed in the real experiments. Second, we demonstrate that the networks modeled indeed have a 3D instead of a planar functionality. Finally, we show that the adaptive properties of the networks depend on their connectivity pattern. Our model was able to replicate fundamental qualitative behavior of the real organic 3D memristor networks; yet, through the simulations, we also explored other interesting properties, such as the relation between connectivity patterns and adaptive properties. Our model and simulations represent an interesting tool to understand the very complex behavior of self-assembled memristor networks, which can finally help to predict and formulate hypotheses for future experiments. (paper)

Stochastic petri nets for wireless networks

CERN Document Server

Lei, Lei; Zhong, Zhangdui

2015-01-01

This SpringerBrief presents research in the application of Stochastic Petri Nets (SPN) to the performance evaluation of wireless networks under bursty traffic. It covers typical Quality-of-Service performance metrics such as mean throughput, average delay and packet dropping probability. Along with an introduction of SPN basics, the authors introduce the key motivation and challenges of using SPN to analyze the resource sharing performance in wireless networks. The authors explain two powerful modeling techniques that treat the well-known state space explosion problem: model decomposition and

Time-dependent deformation of polymer network in polymer-stabilized cholesteric liquid crystals (Conference Presentation)

Science.gov (United States)

Lee, Kyung Min; Tondiglia, Vincent P.; Bunning, Timothy J.; White, Timothy J.

2017-02-01

Recently, we reported direct current (DC) field controllable electro-optic (EO) responses of negative dielectric anisotropy polymer stabilized cholesteric liquid crystals (PSCLCs). A potential mechanism is: Ions in the liquid crystal mixtures are trapped in/on the polymer network during the fast photopolymerization process, and the movement of ions by the application of the DC field distorts polymer network toward the negative electrode, inducing pitch variation through the cell thickness, i.e., pitch compression on the negative electrode side and pitch expansion on positive electrode side. As the DC voltage is directly applied to a target voltage, charged polymer network is deformed and the reflection band is tuned. Interestingly, the polymer network deforms further (red shift of reflection band) with time when constantly applied DC voltage, illustrating DC field induced time dependent deformation of polymer network (creep-like behavior). This time dependent reflection band changes in PSCLCs are investigated by varying the several factors, such as type and concentration of photoinitiators, liquid crystal monomer content, and curing condition (UV intensity and curing time). In addition, simple linear viscoelastic spring-dashpot models, such as 2-parameter Kelvin and 3-parameter linear models, are used to investigate the time-dependent viscoelastic behaviors of polymer networks in PSCLC.

Multiobjective Output Feedback Control of a Class of Stochastic Hybrid Systems with State-Dependent Noise

Directory of Open Access Journals (Sweden)

S. Aberkane

2007-01-01

Full Text Available This paper deals with dynamic output feedback control of continuous-time active fault tolerant control systems with Markovian parameters (AFTCSMP and state-dependent noise. The main contribution is to formulate conditions for multiperformance design, related to this class of stochastic hybrid systems, that take into account the problematic resulting from the fact that the controller only depends on the fault detection and isolation (FDI process. The specifications and objectives under consideration include stochastic stability, ℋ2 and ℋ∞ (or more generally, stochastic integral quadratic constraints performances. Results are formulated as matrix inequalities. The theoretical results are illustrated using a classical example from literature.

Neural dynamics as sampling: a model for stochastic computation in recurrent networks of spiking neurons.

Science.gov (United States)

Buesing, Lars; Bill, Johannes; Nessler, Bernhard; Maass, Wolfgang

2011-11-01

The organization of computations in networks of spiking neurons in the brain is still largely unknown, in particular in view of the inherently stochastic features of their firing activity and the experimentally observed trial-to-trial variability of neural systems in the brain. In principle there exists a powerful computational framework for stochastic computations, probabilistic inference by sampling, which can explain a large number of macroscopic experimental data in neuroscience and cognitive science. But it has turned out to be surprisingly difficult to create a link between these abstract models for stochastic computations and more detailed models of the dynamics of networks of spiking neurons. Here we create such a link and show that under some conditions the stochastic firing activity of networks of spiking neurons can be interpreted as probabilistic inference via Markov chain Monte Carlo (MCMC) sampling. Since common methods for MCMC sampling in distributed systems, such as Gibbs sampling, are inconsistent with the dynamics of spiking neurons, we introduce a different approach based on non-reversible Markov chains that is able to reflect inherent temporal processes of spiking neuronal activity through a suitable choice of random variables. We propose a neural network model and show by a rigorous theoretical analysis that its neural activity implements MCMC sampling of a given distribution, both for the case of discrete and continuous time. This provides a step towards closing the gap between abstract functional models of cortical computation and more detailed models of networks of spiking neurons.

Accelerated Sensitivity Analysis in High-Dimensional Stochastic Reaction Networks.

Science.gov (United States)

Arampatzis, Georgios; Katsoulakis, Markos A; Pantazis, Yannis

2015-01-01

Existing sensitivity analysis approaches are not able to handle efficiently stochastic reaction networks with a large number of parameters and species, which are typical in the modeling and simulation of complex biochemical phenomena. In this paper, a two-step strategy for parametric sensitivity analysis for such systems is proposed, exploiting advantages and synergies between two recently proposed sensitivity analysis methodologies for stochastic dynamics. The first method performs sensitivity analysis of the stochastic dynamics by means of the Fisher Information Matrix on the underlying distribution of the trajectories; the second method is a reduced-variance, finite-difference, gradient-type sensitivity approach relying on stochastic coupling techniques for variance reduction. Here we demonstrate that these two methods can be combined and deployed together by means of a new sensitivity bound which incorporates the variance of the quantity of interest as well as the Fisher Information Matrix estimated from the first method. The first step of the proposed strategy labels sensitivities using the bound and screens out the insensitive parameters in a controlled manner. In the second step of the proposed strategy, a finite-difference method is applied only for the sensitivity estimation of the (potentially) sensitive parameters that have not been screened out in the first step. Results on an epidermal growth factor network with fifty parameters and on a protein homeostasis with eighty parameters demonstrate that the proposed strategy is able to quickly discover and discard the insensitive parameters and in the remaining potentially sensitive parameters it accurately estimates the sensitivities. The new sensitivity strategy can be several times faster than current state-of-the-art approaches that test all parameters, especially in "sloppy" systems. In particular, the computational acceleration is quantified by the ratio between the total number of parameters over the

Accelerated Sensitivity Analysis in High-Dimensional Stochastic Reaction Networks.

Directory of Open Access Journals (Sweden)

Georgios Arampatzis

Full Text Available Existing sensitivity analysis approaches are not able to handle efficiently stochastic reaction networks with a large number of parameters and species, which are typical in the modeling and simulation of complex biochemical phenomena. In this paper, a two-step strategy for parametric sensitivity analysis for such systems is proposed, exploiting advantages and synergies between two recently proposed sensitivity analysis methodologies for stochastic dynamics. The first method performs sensitivity analysis of the stochastic dynamics by means of the Fisher Information Matrix on the underlying distribution of the trajectories; the second method is a reduced-variance, finite-difference, gradient-type sensitivity approach relying on stochastic coupling techniques for variance reduction. Here we demonstrate that these two methods can be combined and deployed together by means of a new sensitivity bound which incorporates the variance of the quantity of interest as well as the Fisher Information Matrix estimated from the first method. The first step of the proposed strategy labels sensitivities using the bound and screens out the insensitive parameters in a controlled manner. In the second step of the proposed strategy, a finite-difference method is applied only for the sensitivity estimation of the (potentially sensitive parameters that have not been screened out in the first step. Results on an epidermal growth factor network with fifty parameters and on a protein homeostasis with eighty parameters demonstrate that the proposed strategy is able to quickly discover and discard the insensitive parameters and in the remaining potentially sensitive parameters it accurately estimates the sensitivities. The new sensitivity strategy can be several times faster than current state-of-the-art approaches that test all parameters, especially in "sloppy" systems. In particular, the computational acceleration is quantified by the ratio between the total number of

Dependence of the number of dealers in a stochastic dealer model

Science.gov (United States)

Yamada, Kenta; Takayasu, Hideki; Takayasu, Misako

2010-04-01

We numerically analyze an artificial market model consisted of N dealers with time dependent stochastic strategy. Observing the change of market price statistics for different values of N, it is shown that the statistical properties are almost same when the dealer number is larger than about 30.

Mean Square Exponential Stability of Stochastic Switched System with Interval Time-Varying Delays

Directory of Open Access Journals (Sweden)

Manlika Rajchakit

2012-01-01

Full Text Available This paper is concerned with mean square exponential stability of switched stochastic system with interval time-varying delays. The time delay is any continuous function belonging to a given interval, but not necessary to be differentiable. By constructing a suitable augmented Lyapunov-Krasovskii functional combined with Leibniz-Newton’s formula, a switching rule for the mean square exponential stability of switched stochastic system with interval time-varying delays and new delay-dependent sufficient conditions for the mean square exponential stability of the switched stochastic system are first established in terms of LMIs. Numerical example is given to show the effectiveness of the obtained result.

Improved Criteria on Delay-Dependent Stability for Discrete-Time Neural Networks with Interval Time-Varying Delays

Directory of Open Access Journals (Sweden)

O. M. Kwon

2012-01-01

Full Text Available The purpose of this paper is to investigate the delay-dependent stability analysis for discrete-time neural networks with interval time-varying delays. Based on Lyapunov method, improved delay-dependent criteria for the stability of the networks are derived in terms of linear matrix inequalities (LMIs by constructing a suitable Lyapunov-Krasovskii functional and utilizing reciprocally convex approach. Also, a new activation condition which has not been considered in the literature is proposed and utilized for derivation of stability criteria. Two numerical examples are given to illustrate the effectiveness of the proposed method.

Responsive and resilient supply chain network design under operational and disruption risks with delivery lead-time sensitive customers

DEFF Research Database (Denmark)

Fattahi, Mohammad; Govindan, Kannan; Keyvanshokooh, Esmaeil

2017-01-01

We address a multi-period supply chain (SC) network design where demands of customers depend on facilities serving them based on their delivery lead-times. Potential customer demands are stochastic, and facilities’ capacity varies randomly because of possible disruptions. Accordingly, we develop...... a multi-stage stochastic program, and model disruptions’ effect on facilities’ capacity. The SC responsiveness risk is limited and, to obtain a resilient network, both mitigation and contingency strategies are exploited. Computational results on a real-life case study and randomly generated problem...... instances demonstrate the model's applicability, risk-measurement policies’ performance, and the influence of mitigation and contingency strategies on SC's resiliency....

Robust nonlinear autoregressive moving average model parameter estimation using stochastic recurrent artificial neural networks

DEFF Research Database (Denmark)

Chon, K H; Hoyer, D; Armoundas, A A

1999-01-01

In this study, we introduce a new approach for estimating linear and nonlinear stochastic autoregressive moving average (ARMA) model parameters, given a corrupt signal, using artificial recurrent neural networks. This new approach is a two-step approach in which the parameters of the deterministic...... part of the stochastic ARMA model are first estimated via a three-layer artificial neural network (deterministic estimation step) and then reestimated using the prediction error as one of the inputs to the artificial neural networks in an iterative algorithm (stochastic estimation step). The prediction...... error is obtained by subtracting the corrupt signal of the estimated ARMA model obtained via the deterministic estimation step from the system output response. We present computer simulation examples to show the efficacy of the proposed stochastic recurrent neural network approach in obtaining accurate...

Electricity price modeling with stochastic time change

International Nuclear Information System (INIS)

Borovkova, Svetlana; Schmeck, Maren Diane

2017-01-01

In this paper, we develop a novel approach to electricity price modeling, based on the powerful technique of stochastic time change. This technique allows us to incorporate the characteristic features of electricity prices (such as seasonal volatility, time varying mean reversion and seasonally occurring price spikes) into the model in an elegant and economically justifiable way. The stochastic time change introduces stochastic as well as deterministic (e.g., seasonal) features in the price process' volatility and in the jump component. We specify the base process as a mean reverting jump diffusion and the time change as an absolutely continuous stochastic process with seasonal component. The activity rate of the stochastic time change can be related to the factors that influence supply and demand. Here we use the temperature as a proxy for the demand and hence, as the driving factor of the stochastic time change, and show that this choice leads to realistic price paths. We derive properties of the resulting price process and develop the model calibration procedure. We calibrate the model to the historical EEX power prices and apply it to generating realistic price paths by Monte Carlo simulations. We show that the simulated price process matches the distributional characteristics of the observed electricity prices in periods of both high and low demand. - Highlights: • We develop a novel approach to electricity price modeling, based on the powerful technique of stochastic time change. • We incorporate the characteristic features of electricity prices, such as seasonal volatility and spikes into the model. • We use the temperature as a proxy for the demand and hence, as the driving factor of the stochastic time change • We derive properties of the resulting price process and develop the model calibration procedure. • We calibrate the model to the historical EEX power prices and apply it to generating realistic price paths.

Control of Networked Traffic Flow Distribution - A Stochastic Distribution System Perspective

Energy Technology Data Exchange (ETDEWEB)

Wang, Hong [Pacific Northwest National Laboratory (PNNL); Aziz, H M Abdul [ORNL; Young, Stan [National Renewable Energy Laboratory (NREL); Patil, Sagar [Pacific Northwest National Laboratory (PNNL)

2017-10-01

Networked traffic flow is a common scenario for urban transportation, where the distribution of vehicle queues either at controlled intersections or highway segments reflect the smoothness of the traffic flow in the network. At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic model for a one-way single-lane corridor traffic system based on theory of stochastic distribution control.. It has been shown that the developed stochastic model would provide the optimal probability density function (PDF) of the traffic queueing length as a dynamic function of the traffic signal setting parameters. Based upon such a stochastic distribution model, we have proposed a preliminary closed loop framework on stochastic distribution control for the traffic queueing system to make the traffic queueing length PDF follow a target PDF that potentially realizes the smooth traffic flow distribution in a concerned corridor.

H∞ Filtering for Networked Markovian Jump Systems with Multiple Stochastic Communication Delays

Directory of Open Access Journals (Sweden)

Hui Dong

2015-01-01

Full Text Available This paper is concerned with the H∞ filtering for a class of networked Markovian jump systems with multiple communication delays. Due to the existence of communication constraints, the measurement signal cannot arrive at the filter completely on time, and the stochastic communication delays are considered in the filter design. Firstly, a set of stochastic variables is introduced to model the occurrence probabilities of the delays. Then based on the stochastic system approach, a sufficient condition is obtained such that the filtering error system is stable in the mean-square sense and with a prescribed H∞ disturbance attenuation level. The optimal filter gain parameters can be determined by solving a convex optimization problem. Finally, a simulation example is given to show the effectiveness of the proposed filter design method.

Delay-Dependent Control for Networked Control Systems with Large Delays

Directory of Open Access Journals (Sweden)

Yilin Wang

2013-01-01

Full Text Available We consider the problems of robust stability and control for a class of networked control systems with long-time delays. Firstly, a nonlinear discrete time model with mode-dependent time delays is proposed by converting the uncertainty of time delay into the uncertainty of parameter matrices. We consider a probabilistic case where the system is switched among different subsystems, and the probability of each subsystem being active is defined as its occurrence probability. For a switched system with a known subsystem occurrence probabilities, we give a stochastic stability criterion in terms of linear matrix inequalities (LMIs. Then, we extend the results to a more practical case where the subsystem occurrence probabilities are uncertain. Finally, a simulation example is presented to show the efficacy of the proposed method.

An efficient forward-reverse expectation-maximization algorithm for statistical inference in stochastic reaction networks

KAUST Repository

Vilanova, Pedro

2016-01-01

reaction networks (SRNs). We apply this stochastic representation to the computation of efficient approximations of expected values of functionals of SRN bridges, i.e., SRNs conditional on their values in the extremes of given time-intervals. We then employ

Stochastic fluctuations and the detectability limit of network communities.

Science.gov (United States)

Floretta, Lucio; Liechti, Jonas; Flammini, Alessandro; De Los Rios, Paolo

2013-12-01

We have analyzed the detectability limits of network communities in the framework of the popular Girvan and Newman benchmark. By carefully taking into account the inevitable stochastic fluctuations that affect the construction of each and every instance of the benchmark, we come to the conclusion that the native, putative partition of the network is completely lost even before the in-degree/out-degree ratio becomes equal to that of a structureless Erdös-Rényi network. We develop a simple iterative scheme, analytically well described by an infinite branching process, to provide an estimate of the true detectability limit. Using various algorithms based on modularity optimization, we show that all of them behave (semiquantitatively) in the same way, with the same functional form of the detectability threshold as a function of the network parameters. Because the same behavior has also been found by further modularity-optimization methods and for methods based on different heuristics implementations, we conclude that indeed a correct definition of the detectability limit must take into account the stochastic fluctuations of the network construction.

Time-dependent 2-stream particle transport

International Nuclear Information System (INIS)

Corngold, Noel

2015-01-01

Highlights: • We consider time-dependent transport in the 2-stream or “rod” model via an attractive matrix formalism. • After reviewing some classical problems in homogeneous media we discuss transport in materials with whose density may vary. • There we achieve a significant contraction of the underlying Telegrapher’s equation. • We conclude with a discussion of stochastics, treated by the “first-order smoothing approximation.” - Abstract: We consider time-dependent transport in the 2-stream or “rod” model via an attractive matrix formalism. After reviewing some classical problems in homogeneous media we discuss transport in materials whose density may vary. There we achieve a significant contraction of the underlying Telegrapher’s equation. We conclude with a discussion of stochastics, treated by the “first-order smoothing approximation.”

Using Equation-Free Computation to Accelerate Network-Free Stochastic Simulation of Chemical Kinetics.

Science.gov (United States)

Lin, Yen Ting; Chylek, Lily A; Lemons, Nathan W; Hlavacek, William S

2018-06-21

The chemical kinetics of many complex systems can be concisely represented by reaction rules, which can be used to generate reaction events via a kinetic Monte Carlo method that has been termed network-free simulation. Here, we demonstrate accelerated network-free simulation through a novel approach to equation-free computation. In this process, variables are introduced that approximately capture system state. Derivatives of these variables are estimated using short bursts of exact stochastic simulation and finite differencing. The variables are then projected forward in time via a numerical integration scheme, after which a new exact stochastic simulation is initialized and the whole process repeats. The projection step increases efficiency by bypassing the firing of numerous individual reaction events. As we show, the projected variables may be defined as populations of building blocks of chemical species. The maximal number of connected molecules included in these building blocks determines the degree of approximation. Equation-free acceleration of network-free simulation is found to be both accurate and efficient.

Stochastic resonance and coherence resonance in groundwater-dependent plant ecosystems.

Science.gov (United States)

Borgogno, Fabio; D'Odorico, Paolo; Laio, Francesco; Ridolfi, Luca

2012-01-21

Several studies have shown that non-linear deterministic dynamical systems forced by external random components can give rise to unexpectedly regular temporal behaviors. Stochastic resonance and coherence resonance, the two best known processes of this type, have been studied in a number of physical and chemical systems. Here, we explore their possible occurrence in the dynamics of groundwater-dependent plant ecosystems. To this end, we develop two eco-hydrological models, which allow us to demonstrate that stochastic and coherence resonance may emerge in the dynamics of phreatophyte vegetation, depending on their deterministic properties and the intensity of external stochastic drivers. Copyright © 2011 Elsevier Ltd. All rights reserved.

Application of Stochastic Automata Networks for Creation of Continuous Time Markov Chain Models of Voltage Gating of Gap Junction Channels

Directory of Open Access Journals (Sweden)

Mindaugas Snipas

2015-01-01

Full Text Available The primary goal of this work was to study advantages of numerical methods used for the creation of continuous time Markov chain models (CTMC of voltage gating of gap junction (GJ channels composed of connexin protein. This task was accomplished by describing gating of GJs using the formalism of the stochastic automata networks (SANs, which allowed for very efficient building and storing of infinitesimal generator of the CTMC that allowed to produce matrices of the models containing a distinct block structure. All of that allowed us to develop efficient numerical methods for a steady-state solution of CTMC models. This allowed us to accelerate CPU time, which is necessary to solve CTMC models, ∼20 times.

Application of Stochastic Automata Networks for Creation of Continuous Time Markov Chain Models of Voltage Gating of Gap Junction Channels

Science.gov (United States)

Pranevicius, Henrikas; Pranevicius, Mindaugas; Pranevicius, Osvaldas; Bukauskas, Feliksas F.

2015-01-01

The primary goal of this work was to study advantages of numerical methods used for the creation of continuous time Markov chain models (CTMC) of voltage gating of gap junction (GJ) channels composed of connexin protein. This task was accomplished by describing gating of GJs using the formalism of the stochastic automata networks (SANs), which allowed for very efficient building and storing of infinitesimal generator of the CTMC that allowed to produce matrices of the models containing a distinct block structure. All of that allowed us to develop efficient numerical methods for a steady-state solution of CTMC models. This allowed us to accelerate CPU time, which is necessary to solve CTMC models, ∼20 times. PMID:25705700

Mean square exponential stability of stochastic delayed Hopfield neural networks

International Nuclear Information System (INIS)

Wan Li; Sun Jianhua

2005-01-01

Stochastic effects to the stability property of Hopfield neural networks (HNN) with discrete and continuously distributed delay are considered. By using the method of variation parameter, inequality technique and stochastic analysis, the sufficient conditions to guarantee the mean square exponential stability of an equilibrium solution are given. Two examples are also given to demonstrate our results

Estimation of parameter sensitivities for stochastic reaction networks

KAUST Repository

Gupta, Ankit

2016-01-01

Quantification of the effects of parameter uncertainty is an important and challenging problem in Systems Biology. We consider this problem in the context of stochastic models of biochemical reaction networks where the dynamics is described as a

The Forward-Reverse Algorithm for Stochastic Reaction Networks

KAUST Repository

Bayer, Christian; Moraes, Alvaro; Tempone, Raul; Vilanova, Pedro

2015-01-01

In this work, we present an extension of the forward-reverse algorithm by Bayer and Schoenmakers [2] to the context of stochastic reaction networks (SRNs). We then apply this bridge-generation technique to the statistical inference problem

Temporal motifs in time-dependent networks

International Nuclear Information System (INIS)

Kovanen, Lauri; Karsai, Márton; Kaski, Kimmo; Kertész, János; Saramäki, Jari

2011-01-01

Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as telecommunication, neural signal processing, biochemical reaction and human social interaction networks. We introduce the framework of temporal motifs to study the mesoscale topological–temporal structure of temporal networks in which the events of nodes do not overlap in time. Temporal motifs are classes of similar event sequences, where the similarity refers not only to topology but also to the temporal order of the events. We provide a mapping from event sequences to coloured directed graphs that enables an efficient algorithm for identifying temporal motifs. We discuss some aspects of temporal motifs, including causality and null models, and present basic statistics of temporal motifs in a large mobile call network

Stochastic Spiking Neural Networks Enabled by Magnetic Tunnel Junctions: From Nontelegraphic to Telegraphic Switching Regimes

Science.gov (United States)

Liyanagedera, Chamika M.; Sengupta, Abhronil; Jaiswal, Akhilesh; Roy, Kaushik

2017-12-01

Stochastic spiking neural networks based on nanoelectronic spin devices can be a possible pathway to achieving "brainlike" compact and energy-efficient cognitive intelligence. The computational model attempt to exploit the intrinsic device stochasticity of nanoelectronic synaptic or neural components to perform learning or inference. However, there has been limited analysis on the scaling effect of stochastic spin devices and its impact on the operation of such stochastic networks at the system level. This work attempts to explore the design space and analyze the performance of nanomagnet-based stochastic neuromorphic computing architectures for magnets with different barrier heights. We illustrate how the underlying network architecture must be modified to account for the random telegraphic switching behavior displayed by magnets with low barrier heights as they are scaled into the superparamagnetic regime. We perform a device-to-system-level analysis on a deep neural-network architecture for a digit-recognition problem on the MNIST data set.

Gamma processes and peaks-over-threshold distributions for time-dependent reliability

International Nuclear Information System (INIS)

Noortwijk, J.M. van; Weide, J.A.M. van der; Kallen, M.J.; Pandey, M.D.

2007-01-01

In the evaluation of structural reliability, a failure is defined as the event in which stress exceeds a resistance that is liable to deterioration. This paper presents a method to combine the two stochastic processes of deteriorating resistance and fluctuating load for computing the time-dependent reliability of a structural component. The deterioration process is modelled as a gamma process, which is a stochastic process with independent non-negative increments having a gamma distribution with identical scale parameter. The stochastic process of loads is generated by a Poisson process. The variability of the random loads is modelled by a peaks-over-threshold distribution (such as the generalised Pareto distribution). These stochastic processes of deterioration and load are combined to evaluate the time-dependent reliability

Value of Information for Optimal Adaptive Routing in Stochastic Time-Dependent Traffic Networks: Algorithms and Computational Tools

Science.gov (United States)

2010-10-25

Real-time information is important for travelers' routing decisions in uncertain networks by enabling online adaptation to revealed traffic conditions. Usually there are spatial and/or temporal limitations in traveler information. In this research, a...

Analysis for Ad Hoc Network Attack-Defense Based on Stochastic Game Model

Directory of Open Access Journals (Sweden)

Yuanjie LI

2014-06-01

Full Text Available The attack actions analysis for Ad Hoc networks can provide a reference for the design security mechanisms. This paper presents an analysis method of security of Ad Hoc networks based on Stochastic Game Nets (SGN. This method can establish a SGN model of Ad Hoc networks and calculate to get the Nash equilibrium strategy. After transforming the SGN model into a continuous-time Markov Chain (CTMC, the security of Ad Hoc networks can be evaluated and analyzed quantitatively by calculating the stationary probability of CTMC. Finally, the Matlab simulation results show that the probability of successful attack is related to the attack intensity and expected payoffs, but not attack rate.

Fluctuations and Noise in Stochastic Spread of Respiratory Infection Epidemics in Social Networks

Science.gov (United States)

Yulmetyev, Renat; Emelyanova, Natalya; Demin, Sergey; Gafarov, Fail; Hänggi, Peter; Yulmetyeva, Dinara

2003-05-01

For the analysis of epidemic and disease dynamics complexity, it is necessary to understand the basic principles and notions of its spreading in long-time memory media. Here we considering the problem from a theoretical and practical viewpoint, presenting the quantitative evidence confirming the existence of stochastic long-range memory and robust chaos in a real time series of respiratory infections of human upper respiratory track. In this work we present a new statistical method of analyzing the spread of grippe and acute respiratory track infections epidemic process of human upper respiratory track by means of the theory of discrete non-Markov stochastic processes. We use the results of our recent theory (Phys. Rev. E 65, 046107 (2002)) for the study of statistical effects of memory in real data series, describing the epidemic dynamics of human acute respiratory track infections and grippe. The obtained results testify to an opportunity of the strict quantitative description of the regular and stochastic components in epidemic dynamics of social networks with a view to time discreteness and effects of statistical memory.

Optimal timing of joint replacement using mathematical programming and stochastic programming models.

Science.gov (United States)

Keren, Baruch; Pliskin, Joseph S

2011-12-01

The optimal timing for performing radical medical procedures as joint (e.g., hip) replacement must be seriously considered. In this paper we show that under deterministic assumptions the optimal timing for joint replacement is a solution of a mathematical programming problem, and under stochastic assumptions the optimal timing can be formulated as a stochastic programming problem. We formulate deterministic and stochastic models that can serve as decision support tools. The results show that the benefit from joint replacement surgery is heavily dependent on timing. Moreover, for a special case where the patient's remaining life is normally distributed along with a normally distributed survival of the new joint, the expected benefit function from surgery is completely solved. This enables practitioners to draw the expected benefit graph, to find the optimal timing, to evaluate the benefit for each patient, to set priorities among patients and to decide if joint replacement should be performed and when.

Stochastic network interdiction optimization via capacitated network reliability modeling and probabilistic solution discovery

International Nuclear Information System (INIS)

Ramirez-Marquez, Jose Emmanuel; Rocco S, Claudio M.

2009-01-01

This paper introduces an evolutionary optimization approach that can be readily applied to solve stochastic network interdiction problems (SNIP). The network interdiction problem solved considers the minimization of the cost associated with an interdiction strategy such that the maximum flow that can be transmitted between a source node and a sink node for a fixed network design is greater than or equal to a given reliability requirement. Furthermore, the model assumes that the nominal capacity of each network link and the cost associated with their interdiction can change from link to link and that such interdiction has a probability of being successful. This version of the SNIP is for the first time modeled as a capacitated network reliability problem allowing for the implementation of computation and solution techniques previously unavailable. The solution process is based on an evolutionary algorithm that implements: (1) Monte-Carlo simulation, to generate potential network interdiction strategies, (2) capacitated network reliability techniques to analyze strategies' source-sink flow reliability and, (3) an evolutionary optimization technique to define, in probabilistic terms, how likely a link is to appear in the final interdiction strategy. Examples for different sizes of networks are used throughout the paper to illustrate the approach

Optimal condition-based maintenance decisions for systems with dependent stochastic degradation of components

International Nuclear Information System (INIS)

Hong, H.P.; Zhou, W.; Zhang, S.; Ye, W.

2014-01-01

Components in engineered systems are subjected to stochastic deterioration due to the operating environmental conditions, and the uncertainty in material properties. The components need to be inspected and possibly replaced based on preventive or failure replacement criteria to provide the intended and safe operation of the system. In the present study, we investigate the influence of dependent stochastic degradation of multiple components on the optimal maintenance decisions. We use copula to model the dependent stochastic degradation of components, and formulate the optimal decision problem based on the minimum expected cost rule and the stochastic dominance rules. The latter is used to cope with decision maker's risk attitude. We illustrate the developed probabilistic analysis approach and the influence of the dependency of the stochastic degradation on the preferred decisions through numerical examples

Stochastic volatility of volatility in continuous time

DEFF Research Database (Denmark)

Barndorff-Nielsen, Ole; Veraart, Almut

This paper introduces the concept of stochastic volatility of volatility in continuous time and, hence, extends standard stochastic volatility (SV) models to allow for an additional source of randomness associated with greater variability in the data. We discuss how stochastic volatility...... of volatility can be defined both non-parametrically, where we link it to the quadratic variation of the stochastic variance process, and parametrically, where we propose two new SV models which allow for stochastic volatility of volatility. In addition, we show that volatility of volatility can be estimated...

Frequency-difference-dependent stochastic resonance in neural systems

Science.gov (United States)

Guo, Daqing; Perc, Matjaž; Zhang, Yangsong; Xu, Peng; Yao, Dezhong

2017-08-01

Biological neurons receive multiple noisy oscillatory signals, and their dynamical response to the superposition of these signals is of fundamental importance for information processing in the brain. Here we study the response of neural systems to the weak envelope modulation signal, which is superimposed by two periodic signals with different frequencies. We show that stochastic resonance occurs at the beat frequency in neural systems at the single-neuron as well as the population level. The performance of this frequency-difference-dependent stochastic resonance is influenced by both the beat frequency and the two forcing frequencies. Compared to a single neuron, a population of neurons is more efficient in detecting the information carried by the weak envelope modulation signal at the beat frequency. Furthermore, an appropriate fine-tuning of the excitation-inhibition balance can further optimize the response of a neural ensemble to the superimposed signal. Our results thus introduce and provide insights into the generation and modulation mechanism of the frequency-difference-dependent stochastic resonance in neural systems.

Stochastic TDHF and the Boltzman-Langevin equation

International Nuclear Information System (INIS)

Suraud, E.; Reinhard, P.G.

1991-01-01

Outgoing from a time-dependent theory of correlations, we present a stochastic differential equation for the propagation of ensembles of Slater determinants, called Stochastic Time-Dependent Hartree-Fock (Stochastic TDHF). These ensembles are allowed to develop large fluctuations in the Hartree-Fock mean fields. An alternative stochastic differential equation, the Boltzmann-Langevin equation, can be derived from Stochastic TDHF by averaging over subensembles with small fluctuations

Interacting particle systems in time-dependent geometries

Science.gov (United States)

Ali, A.; Ball, R. C.; Grosskinsky, S.; Somfai, E.

2013-09-01

Many complex structures and stochastic patterns emerge from simple kinetic rules and local interactions, and are governed by scale invariance properties in combination with effects of the global geometry. We consider systems that can be described effectively by space-time trajectories of interacting particles, such as domain boundaries in two-dimensional growth or river networks. We study trajectories embedded in time-dependent geometries, and the main focus is on uniformly expanding or decreasing domains for which we obtain an exact mapping to simple fixed domain systems while preserving the local scale invariance properties. This approach was recently introduced in Ali et al (2013 Phys. Rev. E 87 020102(R)) and here we provide a detailed discussion on its applicability for self-affine Markovian models, and how it can be adapted to self-affine models with memory or explicit time dependence. The mapping corresponds to a nonlinear time transformation which converges to a finite value for a large class of trajectories, enabling an exact analysis of asymptotic properties in expanding domains. We further provide a detailed discussion of different particle interactions and generalized geometries. All our findings are based on exact computations and are illustrated numerically for various examples, including Lévy processes and fractional Brownian motion.

Spectrum-efficient multi-channel design for coexisting IEEE 802.15.4 networks: A stochastic geometry approach

KAUST Repository

Elsawy, Hesham

2014-07-01

For networks with random topologies (e.g., wireless ad-hoc and sensor networks) and dynamically varying channel gains, choosing the long term operating parameters that optimize the network performance metrics is very challenging. In this paper, we use stochastic geometry analysis to develop a novel framework to design spectrum-efficient multi-channel random wireless networks based on the IEEE 802.15.4 standard. The proposed framework maximizes both spatial and time domain frequency utilization under channel gain uncertainties to minimize the number of frequency channels required to accommodate a certain population of coexisting IEEE 802.15.4 networks. The performance metrics are the outage probability and the self admission failure probability. We relax the single channel assumption that has been used traditionally in the stochastic geometry analysis. We show that the intensity of the admitted networks does not increase linearly with the number of channels and the rate of increase of the intensity of the admitted networks decreases with the number of channels. By using graph theory, we obtain the minimum required number of channels to accommodate a certain intensity of coexisting networks under a self admission failure probability constraint. To this end, we design a superframe structure for the coexisting IEEE 802.15.4 networks and a method for time-domain interference alignment. © 2002-2012 IEEE.

Network evolution induced by asynchronous stimuli through spike-timing-dependent plasticity.

Directory of Open Access Journals (Sweden)

Wu-Jie Yuan

Full Text Available In sensory neural system, external asynchronous stimuli play an important role in perceptual learning, associative memory and map development. However, the organization of structure and dynamics of neural networks induced by external asynchronous stimuli are not well understood. Spike-timing-dependent plasticity (STDP is a typical synaptic plasticity that has been extensively found in the sensory systems and that has received much theoretical attention. This synaptic plasticity is highly sensitive to correlations between pre- and postsynaptic firings. Thus, STDP is expected to play an important role in response to external asynchronous stimuli, which can induce segregative pre- and postsynaptic firings. In this paper, we study the impact of external asynchronous stimuli on the organization of structure and dynamics of neural networks through STDP. We construct a two-dimensional spatial neural network model with local connectivity and sparseness, and use external currents to stimulate alternately on different spatial layers. The adopted external currents imposed alternately on spatial layers can be here regarded as external asynchronous stimuli. Through extensive numerical simulations, we focus on the effects of stimulus number and inter-stimulus timing on synaptic connecting weights and the property of propagation dynamics in the resulting network structure. Interestingly, the resulting feedforward structure induced by stimulus-dependent asynchronous firings and its propagation dynamics reflect both the underlying property of STDP. The results imply a possible important role of STDP in generating feedforward structure and collective propagation activity required for experience-dependent map plasticity in developing in vivo sensory pathways and cortices. The relevance of the results to cue-triggered recall of learned temporal sequences, an important cognitive function, is briefly discussed as well. Furthermore, this finding suggests a potential

Classical Solutions of Path-Dependent PDEs and Functional Forward-Backward Stochastic Systems

Directory of Open Access Journals (Sweden)

Shaolin Ji

2013-01-01

Full Text Available In this paper we study the relationship between functional forward-backward stochastic systems and path-dependent PDEs. In the framework of functional Itô calculus, we introduce a path-dependent PDE and prove that its solution is uniquely determined by a functional forward-backward stochastic system.

Stochastic noncooperative and cooperative evolutionary game strategies of a population of biological networks under natural selection.

Science.gov (United States)

Chen, Bor-Sen; Yeh, Chin-Hsun

2017-12-01

We review current static and dynamic evolutionary game strategies of biological networks and discuss the lack of random genetic variations and stochastic environmental disturbances in these models. To include these factors, a population of evolving biological networks is modeled as a nonlinear stochastic biological system with Poisson-driven genetic variations and random environmental fluctuations (stimuli). To gain insight into the evolutionary game theory of stochastic biological networks under natural selection, the phenotypic robustness and network evolvability of noncooperative and cooperative evolutionary game strategies are discussed from a stochastic Nash game perspective. The noncooperative strategy can be transformed into an equivalent multi-objective optimization problem and is shown to display significantly improved network robustness to tolerate genetic variations and buffer environmental disturbances, maintaining phenotypic traits for longer than the cooperative strategy. However, the noncooperative case requires greater effort and more compromises between partly conflicting players. Global linearization is used to simplify the problem of solving nonlinear stochastic evolutionary games. Finally, a simple stochastic evolutionary model of a metabolic pathway is simulated to illustrate the procedure of solving for two evolutionary game strategies and to confirm and compare their respective characteristics in the evolutionary process. Copyright © 2017 Elsevier B.V. All rights reserved.

Inhibitory Synaptic Plasticity - Spike timing dependence and putative network function.

Directory of Open Access Journals (Sweden)

Tim P Vogels

2013-07-01

Full Text Available While the plasticity of excitatory synaptic connections in the brain has been widely studied, the plasticity of inhibitory connections is much less understood. Here, we present recent experimental and theoretical □ndings concerning the rules of spike timing-dependent inhibitory plasticity and their putative network function. This is a summary of a workshop at the COSYNE conference 2012.

Effects of time-dependent diffusion behaviors on the rumor spreading in social networks

Energy Technology Data Exchange (ETDEWEB)

Qiu, Xiaoyan [School of Management, Shanghai University, Shanghai 200444 (China); Zhao, Laijun, E-mail: ljzhao70@sjtu.edu.cn [Sino–US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030 (China); Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200052 (China); Wang, Jiajia [Sino–US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai 200030 (China); Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200052 (China); Wang, Xiaoli [School of Management, Shanghai University of Engineering Science, Shanghai 201620 (China); Wang, Qin [College of Transport & Communications, Shanghai Maritime University, Shanghai 201306 (China)

2016-05-27

When considering roles of realistic external forces (e.g. authorities) and internal forces (e.g. the forgetting nature of human), diffusion behaviors like spreading, stifling and forgetting behaviors are time-dependent. They were incorporated in an SIR-like rumor spreading model to investigate the effects to rumor spreading dynamics. Mean-field equations were derived, and the steady state analysis was conducted. Simulations were carried out on different complex networks. We demonstrated that the combination of the three variable diffusion behaviors provides a faster and larger spreading expansion capacity. Network structure matters considerably in rumor spreading dynamics. - Highlights: • We incorporate time-dependent diffusion behaviors into a SIR-like rumor spreading model. • The combination of the three variable diffusion behaviors provides a faster and larger spreading expansion capacity. • Network structure matters considerably in rumor spreading dynamics.

Effects of time-dependent diffusion behaviors on the rumor spreading in social networks

International Nuclear Information System (INIS)

Qiu, Xiaoyan; Zhao, Laijun; Wang, Jiajia; Wang, Xiaoli; Wang, Qin

2016-01-01

When considering roles of realistic external forces (e.g. authorities) and internal forces (e.g. the forgetting nature of human), diffusion behaviors like spreading, stifling and forgetting behaviors are time-dependent. They were incorporated in an SIR-like rumor spreading model to investigate the effects to rumor spreading dynamics. Mean-field equations were derived, and the steady state analysis was conducted. Simulations were carried out on different complex networks. We demonstrated that the combination of the three variable diffusion behaviors provides a faster and larger spreading expansion capacity. Network structure matters considerably in rumor spreading dynamics. - Highlights: • We incorporate time-dependent diffusion behaviors into a SIR-like rumor spreading model. • The combination of the three variable diffusion behaviors provides a faster and larger spreading expansion capacity. • Network structure matters considerably in rumor spreading dynamics.

Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints

Directory of Open Access Journals (Sweden)

Wangtu Xu

2012-01-01

Full Text Available This paper proposes a stochastic user equilibrium (SUE assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost function encompassing five components: (1 ride time, which is composed of in-vehicle and waiting times, (2 overload delay, (3 fare, (4 transfer constraints, and (5 departure time difference. We split passenger demands among connections which are the space-time paths between OD pairs of the network. All transit vehicles have a fixed capacity and operate according to some preset timetables. When the capacity constraint of the transit line segment is reached, we show that the Lagrange multipliers of the mathematical programming problem are equivalent to the equilibrium passenger overload delay in the congested transit network. The proposed model can simultaneously predict how passengers choose their transit vehicles to minimize their travel costs and estimate the associated costs in a schedule-based congested transit network. A numerical example is used to illustrate the performance of the proposed model.

Neural network approach to time-dependent dividing surfaces in classical reaction dynamics

Science.gov (United States)

Schraft, Philippe; Junginger, Andrej; Feldmaier, Matthias; Bardakcioglu, Robin; Main, Jörg; Wunner, Günter; Hernandez, Rigoberto

2018-04-01

In a dynamical system, the transition between reactants and products is typically mediated by an energy barrier whose properties determine the corresponding pathways and rates. The latter is the flux through a dividing surface (DS) between the two corresponding regions, and it is exact only if it is free of recrossings. For time-independent barriers, the DS can be attached to the top of the corresponding saddle point of the potential energy surface, and in time-dependent systems, the DS is a moving object. The precise determination of these direct reaction rates, e.g., using transition state theory, requires the actual construction of a DS for a given saddle geometry, which is in general a demanding methodical and computational task, especially in high-dimensional systems. In this paper, we demonstrate how such time-dependent, global, and recrossing-free DSs can be constructed using neural networks. In our approach, the neural network uses the bath coordinates and time as input, and it is trained in a way that its output provides the position of the DS along the reaction coordinate. An advantage of this procedure is that, once the neural network is trained, the complete information about the dynamical phase space separation is stored in the network's parameters, and a precise distinction between reactants and products can be made for all possible system configurations, all times, and with little computational effort. We demonstrate this general method for two- and three-dimensional systems and explain its straightforward extension to even more degrees of freedom.

Trapped modes in linear quantum stochastic networks with delays

Energy Technology Data Exchange (ETDEWEB)

Tabak, Gil [Stanford University, Department of Applied Physics, Stanford, CA (United States); Mabuchi, Hideo

2016-12-15

Networks of open quantum systems with feedback have become an active area of research for applications such as quantum control, quantum communication and coherent information processing. A canonical formalism for the interconnection of open quantum systems using quantum stochastic differential equations (QSDEs) has been developed by Gough, James and co-workers and has been used to develop practical modeling approaches for complex quantum optical, microwave and optomechanical circuits/networks. In this paper we fill a significant gap in existing methodology by showing how trapped modes resulting from feedback via coupled channels with finite propagation delays can be identified systematically in a given passive linear network. Our method is based on the Blaschke-Potapov multiplicative factorization theorem for inner matrix-valued functions, which has been applied in the past to analog electronic networks. Our results provide a basis for extending the Quantum Hardware Description Language (QHDL) framework for automated quantum network model construction (Tezak et al. in Philos. Trans. R. Soc. A, Math. Phys. Eng. Sci. 370(1979):5270-5290, 2012) to efficiently treat scenarios in which each interconnection of components has an associated signal propagation time delay. (orig.)

Accelerating deep neural network training with inconsistent stochastic gradient descent.

Science.gov (United States)

Wang, Linnan; Yang, Yi; Min, Renqiang; Chakradhar, Srimat

2017-09-01

Stochastic Gradient Descent (SGD) updates Convolutional Neural Network (CNN) with a noisy gradient computed from a random batch, and each batch evenly updates the network once in an epoch. This model applies the same training effort to each batch, but it overlooks the fact that the gradient variance, induced by Sampling Bias and Intrinsic Image Difference, renders different training dynamics on batches. In this paper, we develop a new training strategy for SGD, referred to as Inconsistent Stochastic Gradient Descent (ISGD) to address this problem. The core concept of ISGD is the inconsistent training, which dynamically adjusts the training effort w.r.t the loss. ISGD models the training as a stochastic process that gradually reduces down the mean of batch's loss, and it utilizes a dynamic upper control limit to identify a large loss batch on the fly. ISGD stays on the identified batch to accelerate the training with additional gradient updates, and it also has a constraint to penalize drastic parameter changes. ISGD is straightforward, computationally efficient and without requiring auxiliary memories. A series of empirical evaluations on real world datasets and networks demonstrate the promising performance of inconsistent training. Copyright © 2017 Elsevier Ltd. All rights reserved.

Effects of demographic stochasticity on biological community assembly on evolutionary time scales

KAUST Repository

Murase, Yohsuke; Shimada, Takashi; Ito, Nobuyasu; Rikvold, Per Arne

2010-01-01

We study the effects of demographic stochasticity on the long-term dynamics of biological coevolution models of community assembly. The noise is induced in order to check the validity of deterministic population dynamics. While mutualistic communities show little dependence on the stochastic population fluctuations, predator-prey models show strong dependence on the stochasticity, indicating the relevance of the finiteness of the populations. For a predator-prey model, the noise causes drastic decreases in diversity and total population size. The communities that emerge under influence of the noise consist of species strongly coupled with each other and have stronger linear stability around the fixed-point populations than the corresponding noiseless model. The dynamics on evolutionary time scales for the predator-prey model are also altered by the noise. Approximate 1/f fluctuations are observed with noise, while 1/ f2 fluctuations are found for the model without demographic noise. © 2010 The American Physical Society.

Effects of demographic stochasticity on biological community assembly on evolutionary time scales

KAUST Repository

Murase, Yohsuke

2010-04-13

We study the effects of demographic stochasticity on the long-term dynamics of biological coevolution models of community assembly. The noise is induced in order to check the validity of deterministic population dynamics. While mutualistic communities show little dependence on the stochastic population fluctuations, predator-prey models show strong dependence on the stochasticity, indicating the relevance of the finiteness of the populations. For a predator-prey model, the noise causes drastic decreases in diversity and total population size. The communities that emerge under influence of the noise consist of species strongly coupled with each other and have stronger linear stability around the fixed-point populations than the corresponding noiseless model. The dynamics on evolutionary time scales for the predator-prey model are also altered by the noise. Approximate 1/f fluctuations are observed with noise, while 1/ f2 fluctuations are found for the model without demographic noise. © 2010 The American Physical Society.

Modelling and simulating decision processes of linked lives: An approach based on concurrent processes and stochastic race.

Science.gov (United States)

Warnke, Tom; Reinhardt, Oliver; Klabunde, Anna; Willekens, Frans; Uhrmacher, Adelinde M

2017-10-01

Individuals' decision processes play a central role in understanding modern migration phenomena and other demographic processes. Their integration into agent-based computational demography depends largely on suitable support by a modelling language. We are developing the Modelling Language for Linked Lives (ML3) to describe the diverse decision processes of linked lives succinctly in continuous time. The context of individuals is modelled by networks the individual is part of, such as family ties and other social networks. Central concepts, such as behaviour conditional on agent attributes, age-dependent behaviour, and stochastic waiting times, are tightly integrated in the language. Thereby, alternative decisions are modelled by concurrent processes that compete by stochastic race. Using a migration model, we demonstrate how this allows for compact description of complex decisions, here based on the Theory of Planned Behaviour. We describe the challenges for the simulation algorithm posed by stochastic race between multiple concurrent complex decisions.

Improved PPP Ambiguity Resolution Considering the Stochastic Characteristics of Atmospheric Corrections from Regional Networks

Science.gov (United States)

Li, Yihe; Li, Bofeng; Gao, Yang

2015-01-01

With the increased availability of regional reference networks, Precise Point Positioning (PPP) can achieve fast ambiguity resolution (AR) and precise positioning by assimilating the satellite fractional cycle biases (FCBs) and atmospheric corrections derived from these networks. In such processing, the atmospheric corrections are usually treated as deterministic quantities. This is however unrealistic since the estimated atmospheric corrections obtained from the network data are random and furthermore the interpolated corrections diverge from the realistic corrections. This paper is dedicated to the stochastic modelling of atmospheric corrections and analyzing their effects on the PPP AR efficiency. The random errors of the interpolated corrections are processed as two components: one is from the random errors of estimated corrections at reference stations, while the other arises from the atmospheric delay discrepancies between reference stations and users. The interpolated atmospheric corrections are then applied by users as pseudo-observations with the estimated stochastic model. Two data sets are processed to assess the performance of interpolated corrections with the estimated stochastic models. The results show that when the stochastic characteristics of interpolated corrections are properly taken into account, the successful fix rate reaches 93.3% within 5 min for a medium inter-station distance network and 80.6% within 10 min for a long inter-station distance network. PMID:26633400

State estimation for discrete-time Markovian jumping neural networks with mixed mode-dependent delays

International Nuclear Information System (INIS)

Liu Yurong; Wang Zidong; Liu Xiaohui

2008-01-01

In this Letter, we investigate the state estimation problem for a new class of discrete-time neural networks with Markovian jumping parameters as well as mode-dependent mixed time-delays. The parameters of the discrete-time neural networks are subject to the switching from one mode to another at different times according to a Markov chain, and the mixed time-delays consist of both discrete and distributed delays that are dependent on the Markovian jumping mode. New techniques are developed to deal with the mixed time-delays in the discrete-time setting, and a novel Lyapunov-Krasovskii functional is put forward to reflect the mode-dependent time-delays. Sufficient conditions are established in terms of linear matrix inequalities (LMIs) that guarantee the existence of the state estimators. We show that both the existence conditions and the explicit expression of the desired estimator can be characterized in terms of the solution to an LMI. A numerical example is exploited to show the usefulness of the derived LMI-based conditions

Complex behavior in a network with time-dependent connections and silent nodes

International Nuclear Information System (INIS)

Marro, J; Torres, J J; Cortes, J M

2008-01-01

We studied, both analytically and numerically, excitable networks in which connections are time-dependent and some of the nodes remain silent at each time step, and we show that these two features may induce intriguing functional complexity. More specifically, we consider (a) a heterogeneous distribution of connection weights such that, depending on the current degree of order, some connections are reinforced/weakened with strength Φ on short timescales, and (b) that only a fraction ρ of nodes are simultaneously active. The resulting dynamics has attractors which, for a range of Φ values and ρ exceeding a threshold, become unstable, the instability depending critically on the value of ρ. We observe that (i) the activity describes a trajectory in which the close neighborhood of some of the attractors is constantly visited, (ii) the number of attractors visited increases with ρ, and (iii) the trajectory may change from regular to chaotic and vice versa as ρ is, even slightly modified. Furthermore, (iv) time series show a power-law spectra under conditions in which the attractors' space tends to be most efficiently explored. We argue on the possible qualitative relevance of this phenomenology to networks in several natural contexts

Stability and synchronization control of stochastic neural networks

CERN Document Server

Zhou, Wuneng; Zhou, Liuwei; Tong, Dongbing

2016-01-01

This book reports on the latest findings in the study of Stochastic Neural Networks (SNN). The book collects the novel model of the disturbance driven by Levy process, the research method of M-matrix, and the adaptive control method of the SNN in the context of stability and synchronization control. The book will be of interest to university researchers, graduate students in control science and engineering and neural networks who wish to learn the core principles, methods, algorithms and applications of SNN.

Hardware implementation of stochastic spiking neural networks.

Science.gov (United States)

Rosselló, Josep L; Canals, Vincent; Morro, Antoni; Oliver, Antoni

2012-08-01

Spiking Neural Networks, the last generation of Artificial Neural Networks, are characterized by its bio-inspired nature and by a higher computational capacity with respect to other neural models. In real biological neurons, stochastic processes represent an important mechanism of neural behavior and are responsible of its special arithmetic capabilities. In this work we present a simple hardware implementation of spiking neurons that considers this probabilistic nature. The advantage of the proposed implementation is that it is fully digital and therefore can be massively implemented in Field Programmable Gate Arrays. The high computational capabilities of the proposed model are demonstrated by the study of both feed-forward and recurrent networks that are able to implement high-speed signal filtering and to solve complex systems of linear equations.

Investment timing decisions in a stochastic duopoly model

Energy Technology Data Exchange (ETDEWEB)

Marseguerra, Giovanni [Istituto di Econometria e CRANEC, Universita Cattolica del Sacro Cuore di Milan (Italy)]. E-mail: giovanni.marseguerra@unicatt.it; Cortelezzi, Flavia [Dipartimento di Diritto ed Economia delle Persone e delle Imprese, Universita dell' Insubria (Italy)]. E-mail: flavia.cortelezzi@uninsubria.it; Dominioni, Armando [CORE-Catholique de Louvain la Neuve (Belgium)]. E-mail: dominioni@core.ucl.ac.be

2006-08-15

We investigate the role of strategic considerations on the optimal timing of investment when firms compete for a new market (e.g., the provision of an innovative product) under demand uncertainty. Within a continuous time model of stochastic oligopoly, we show that strategic considerations are likely to be of limited impact when the new product is radically innovative whilst the fear of a rival's entry may deeply affect firms' decisions whenever innovation is to some extent limited. The welfare analysis shows surprisingly that the desirability of the different market structures considered does not depend on the fixed entry cost.

Investment timing decisions in a stochastic duopoly model

International Nuclear Information System (INIS)

Marseguerra, Giovanni; Cortelezzi, Flavia; Dominioni, Armando

2006-01-01

We investigate the role of strategic considerations on the optimal timing of investment when firms compete for a new market (e.g., the provision of an innovative product) under demand uncertainty. Within a continuous time model of stochastic oligopoly, we show that strategic considerations are likely to be of limited impact when the new product is radically innovative whilst the fear of a rival's entry may deeply affect firms' decisions whenever innovation is to some extent limited. The welfare analysis shows surprisingly that the desirability of the different market structures considered does not depend on the fixed entry cost

Adaptive control of chaotic systems with stochastic time varying unknown parameters

Energy Technology Data Exchange (ETDEWEB)

Salarieh, Hassan [Center of Excellence in Design, Robotics and Automation, Department of Mechanical Engineering, Sharif University of Technology, P.O. Box 11365-9567, Azadi Avenue, Tehran (Iran, Islamic Republic of)], E-mail: salarieh@mech.sharif.edu; Alasty, Aria [Center of Excellence in Design, Robotics and Automation, Department of Mechanical Engineering, Sharif University of Technology, P.O. Box 11365-9567, Azadi Avenue, Tehran (Iran, Islamic Republic of)], E-mail: aalasti@sharif.edu

2008-10-15

In this paper based on the Lyapunov stability theorem, an adaptive control scheme is proposed for stabilizing the unstable periodic orbits (UPO) of chaotic systems. It is assumed that the chaotic system has some linearly dependent unknown parameters which are stochastically time varying. The stochastic parameters are modeled through the Weiner process derivative. To demonstrate the effectiveness of the proposed technique it has been applied to the Lorenz, Chen and Rossler dynamical systems, as some case studies. Simulation results indicate that the proposed adaptive controller has a high performance in stabilizing the UPO of chaotic systems in noisy environment.

Simulation of biochemical reactions with time-dependent rates by the rejection-based algorithm

Energy Technology Data Exchange (ETDEWEB)

Thanh, Vo Hong, E-mail: vo@cosbi.eu [The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Piazza Manifattura 1, Rovereto 38068 (Italy); Priami, Corrado, E-mail: priami@cosbi.eu [The Microsoft Research - University of Trento Centre for Computational and Systems Biology, Piazza Manifattura 1, Rovereto 38068 (Italy); Department of Mathematics, University of Trento, Trento (Italy)

2015-08-07

We address the problem of simulating biochemical reaction networks with time-dependent rates and propose a new algorithm based on our rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)]. The computation for selecting next reaction firings by our time-dependent RSSA (tRSSA) is computationally efficient. Furthermore, the generated trajectory is exact by exploiting the rejection-based mechanism. We benchmark tRSSA on different biological systems with varying forms of reaction rates to demonstrate its applicability and efficiency. We reveal that for nontrivial cases, the selection of reaction firings in existing algorithms introduces approximations because the integration of reaction rates is very computationally demanding and simplifying assumptions are introduced. The selection of the next reaction firing by our approach is easier while preserving the exactness.

Modeling reliability of power systems substations by using stochastic automata networks

International Nuclear Information System (INIS)

Šnipas, Mindaugas; Radziukynas, Virginijus; Valakevičius, Eimutis

2017-01-01

In this paper, stochastic automata networks (SANs) formalism to model reliability of power systems substations is applied. The proposed strategy allows reducing the size of state space of Markov chain model and simplifying system specification. Two case studies of standard configurations of substations are considered in detail. SAN models with different assumptions were created. SAN approach is compared with exact reliability calculation by using a minimal path set method. Modeling results showed that total independence of automata can be assumed for relatively small power systems substations with reliable equipment. In this case, the implementation of Markov chain model by a using SAN method is a relatively easy task. - Highlights: • We present the methodology to apply stochastic automata network formalism to create Markov chain models of power systems. • The stochastic automata network approach is combined with minimal path sets and structural functions. • Two models of substation configurations with different model assumptions are presented to illustrate the proposed methodology. • Modeling results of system with independent automata and functional transition rates are similar. • The conditions when total independence of automata can be assumed are addressed.

Simulation and Statistical Inference of Stochastic Reaction Networks with Applications to Epidemic Models

KAUST Repository

Moraes, Alvaro

2015-01-01

Epidemics have shaped, sometimes more than wars and natural disasters, demo- graphic aspects of human populations around the world, their health habits and their economies. Ebola and the Middle East Respiratory Syndrome (MERS) are clear and current examples of potential hazards at planetary scale. During the spread of an epidemic disease, there are phenomena, like the sudden extinction of the epidemic, that can not be captured by deterministic models. As a consequence, stochastic models have been proposed during the last decades. A typical forward problem in the stochastic setting could be the approximation of the expected number of infected individuals found in one month from now. On the other hand, a typical inverse problem could be, given a discretely observed set of epidemiological data, infer the transmission rate of the epidemic or its basic reproduction number. Markovian epidemic models are stochastic models belonging to a wide class of pure jump processes known as Stochastic Reaction Networks (SRNs), that are intended to describe the time evolution of interacting particle systems where one particle interacts with the others through a finite set of reaction channels. SRNs have been mainly developed to model biochemical reactions but they also have applications in neural networks, virus kinetics, and dynamics of social networks, among others. 4 This PhD thesis is focused on novel fast simulation algorithms and statistical inference methods for SRNs. Our novel Multi-level Monte Carlo (MLMC) hybrid simulation algorithms provide accurate estimates of expected values of a given observable of SRNs at a prescribed final time. They are designed to control the global approximation error up to a user-selected accuracy and up to a certain confidence level, and with near optimal computational work. We also present novel dual-weighted residual expansions for fast estimation of weak and strong errors arising from the MLMC methodology. Regarding the statistical inference

Evaluation of the reliability of transport networks based on the stochastic flow of moving objects

International Nuclear Information System (INIS)

Wu Weiwei; Ning, Angelika; Ning Xuanxi

2008-01-01

In transport networks, human beings are moving objects whose moving direction is stochastic in emergency situations. Based on this idea, a new model-stochastic moving network (SMN) is proposed. It is different from binary-state networks and stochastic-flow networks. The flow of SMNs has multiple-saturated states, that correspond to different flow values in each arc. In this paper, we try to evaluate the system reliability, defined as the probability that the saturated flow of the network is not less than a given demand d. Based on this new model, we obtain the flow probability distribution of every arc by simulation. An algorithm based on the blocking cutset of the SMN is proposed to evaluate the network reliability. An example is used to show how to calculate the corresponding reliabilities for different given demands of the SMN. Simulation experiments of different size were made and the system reliability precision was calculated. The precision of simulation results also discussed

Nonlinear stochastic systems with network-induced phenomena recursive filtering and sliding-mode design

CERN Document Server

Hu, Jun; Gao, Huijun

2014-01-01

This monograph introduces methods for handling filtering and control problems in nonlinear stochastic systems arising from network-induced phenomena consequent on limited communication capacity. Such phenomena include communication delay, packet dropout, signal quantization or saturation, randomly occurring nonlinearities and randomly occurring uncertainties.The text is self-contained, beginning with an introduction to nonlinear stochastic systems, network-induced phenomena and filtering and control, moving through a collection of the latest research results which focuses on the three aspects

Stochastic multiresonance for a fractional linear oscillator with time-delayed kernel and quadratic noise

Science.gov (United States)

Guo, Feng; Wang, Xue-Yuan; Zhu, Cheng-Yin; Cheng, Xiao-Feng; Zhang, Zheng-Yu; Huang, Xu-Hui

2017-12-01

The stochastic resonance for a fractional oscillator with time-delayed kernel and quadratic trichotomous noise is investigated. Applying linear system theory and Laplace transform, the system output amplitude (SPA) for the fractional oscillator is obtained. It is found that the SPA is a periodical function of the kernel delayed-time. Stochastic multiplicative phenomenon appears on the SPA versus the driving frequency, versus the noise amplitude, and versus the fractional exponent. The non-monotonous dependence of the SPA on the system parameters is also discussed.

Importance Sampling for Stochastic Timed Automata

DEFF Research Database (Denmark)

Jegourel, Cyrille; Larsen, Kim Guldstrand; Legay, Axel

2016-01-01

We present an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata. By means of symbolic exploration, our framework first identifies states that cannot reach the goal. A state-wise cha......We present an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata. By means of symbolic exploration, our framework first identifies states that cannot reach the goal. A state...

Modeling Aggregation Processes of Lennard-Jones particles Via Stochastic Networks

Science.gov (United States)

Forman, Yakir; Cameron, Maria

2017-07-01

We model an isothermal aggregation process of particles/atoms interacting according to the Lennard-Jones pair potential by mapping the energy landscapes of each cluster size N onto stochastic networks, computing transition probabilities from the network for an N-particle cluster to the one for N+1, and connecting these networks into a single joint network. The attachment rate is a control parameter. The resulting network representing the aggregation of up to 14 particles contains 6427 vertices. It is not only time-irreversible but also reducible. To analyze its transient dynamics, we introduce the sequence of the expected initial and pre-attachment distributions and compute them for a wide range of attachment rates and three values of temperature. As a result, we find the configurations most likely to be observed in the process of aggregation for each cluster size. We examine the attachment process and conduct a structural analysis of the sets of local energy minima for every cluster size. We show that both processes taking place in the network, attachment and relaxation, lead to the dominance of icosahedral packing in small (up to 14 atom) clusters.

Cascades on a stochastic pulse-coupled network

Science.gov (United States)

Wray, C. M.; Bishop, S. R.

2014-09-01

While much recent research has focused on understanding isolated cascades of networks, less attention has been given to dynamical processes on networks exhibiting repeated cascades of opposing influence. An example of this is the dynamic behaviour of financial markets where cascades of buying and selling can occur, even over short timescales. To model these phenomena, a stochastic pulse-coupled oscillator network with upper and lower thresholds is described and analysed. Numerical confirmation of asynchronous and synchronous regimes of the system is presented, along with analytical identification of the fixed point state vector of the asynchronous mean field system. A lower bound for the finite system mean field critical value of network coupling probability is found that separates the asynchronous and synchronous regimes. For the low-dimensional mean field system, a closed-form equation is found for cascade size, in terms of the network coupling probability. Finally, a description of how this model can be applied to interacting agents in a financial market is provided.

Resolution-of-identity stochastic time-dependent configuration interaction for dissipative electron dynamics in strong fields.

Science.gov (United States)

Klinkusch, Stefan; Tremblay, Jean Christophe

2016-05-14

In this contribution, we introduce a method for simulating dissipative, ultrafast many-electron dynamics in intense laser fields. The method is based on the norm-conserving stochastic unraveling of the dissipative Liouville-von Neumann equation in its Lindblad form. The N-electron wave functions sampling the density matrix are represented in the basis of singly excited configuration state functions. The interaction with an external laser field is treated variationally and the response of the electronic density is included to all orders in this basis. The coupling to an external environment is included via relaxation operators inducing transition between the configuration state functions. Single electron ionization is represented by irreversible transition operators from the ionizing states to an auxiliary continuum state. The method finds its efficiency in the representation of the operators in the interaction picture, where the resolution-of-identity is used to reduce the size of the Hamiltonian eigenstate basis. The zeroth-order eigenstates can be obtained either at the configuration interaction singles level or from a time-dependent density functional theory reference calculation. The latter offers an alternative to explicitly time-dependent density functional theory which has the advantage of remaining strictly valid for strong field excitations while improving the description of the correlation as compared to configuration interaction singles. The method is tested on a well-characterized toy system, the excitation of the low-lying charge transfer state in LiCN.

Resolution-of-identity stochastic time-dependent configuration interaction for dissipative electron dynamics in strong fields

Energy Technology Data Exchange (ETDEWEB)

Klinkusch, Stefan; Tremblay, Jean Christophe [Institute for Chemistry and Biochemistry, Freie Universität Berlin, Takustr. 3, D-14195 Berlin (Germany)

2016-05-14

In this contribution, we introduce a method for simulating dissipative, ultrafast many-electron dynamics in intense laser fields. The method is based on the norm-conserving stochastic unraveling of the dissipative Liouville-von Neumann equation in its Lindblad form. The N-electron wave functions sampling the density matrix are represented in the basis of singly excited configuration state functions. The interaction with an external laser field is treated variationally and the response of the electronic density is included to all orders in this basis. The coupling to an external environment is included via relaxation operators inducing transition between the configuration state functions. Single electron ionization is represented by irreversible transition operators from the ionizing states to an auxiliary continuum state. The method finds its efficiency in the representation of the operators in the interaction picture, where the resolution-of-identity is used to reduce the size of the Hamiltonian eigenstate basis. The zeroth-order eigenstates can be obtained either at the configuration interaction singles level or from a time-dependent density functional theory reference calculation. The latter offers an alternative to explicitly time-dependent density functional theory which has the advantage of remaining strictly valid for strong field excitations while improving the description of the correlation as compared to configuration interaction singles. The method is tested on a well-characterized toy system, the excitation of the low-lying charge transfer state in LiCN.

Bridging time scales in cellular decision making with a stochastic bistable switch

Directory of Open Access Journals (Sweden)

Waldherr Steffen

2010-08-01

Full Text Available Abstract Background Cellular transformations which involve a significant phenotypical change of the cell's state use bistable biochemical switches as underlying decision systems. Some of these transformations act over a very long time scale on the cell population level, up to the entire lifespan of the organism. Results In this work, we aim at linking cellular decisions taking place on a time scale of years to decades with the biochemical dynamics in signal transduction and gene regulation, occuring on a time scale of minutes to hours. We show that a stochastic bistable switch forms a viable biochemical mechanism to implement decision processes on long time scales. As a case study, the mechanism is applied to model the initiation of follicle growth in mammalian ovaries, where the physiological time scale of follicle pool depletion is on the order of the organism's lifespan. We construct a simple mathematical model for this process based on experimental evidence for the involved genetic mechanisms. Conclusions Despite the underlying stochasticity, the proposed mechanism turns out to yield reliable behavior in large populations of cells subject to the considered decision process. Our model explains how the physiological time constant may emerge from the intrinsic stochasticity of the underlying gene regulatory network. Apart from ovarian follicles, the proposed mechanism may also be of relevance for other physiological systems where cells take binary decisions over a long time scale.

Error performance analysis in K-tier uplink cellular networks using a stochastic geometric approach

KAUST Repository

Afify, Laila H.; Elsawy, Hesham; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

-in-Distribution approach that utilizes stochastic geometric tools to account for the network geometry in the performance characterization. Different from the other stochastic geometry models adopted in the literature, the developed analysis accounts for important

a Stochastic Approach to Multiobjective Optimization of Large-Scale Water Reservoir Networks

Science.gov (United States)

Bottacin-Busolin, A.; Worman, A. L.

2013-12-01

A main challenge for the planning and management of water resources is the development of multiobjective strategies for operation of large-scale water reservoir networks. The optimal sequence of water releases from multiple reservoirs depends on the stochastic variability of correlated hydrologic inflows and on various processes that affect water demand and energy prices. Although several methods have been suggested, large-scale optimization problems arising in water resources management are still plagued by the high dimensional state space and by the stochastic nature of the hydrologic inflows. In this work, the optimization of reservoir operation is approached using approximate dynamic programming (ADP) with policy iteration and function approximators. The method is based on an off-line learning process in which operating policies are evaluated for a number of stochastic inflow scenarios, and the resulting value functions are used to design new, improved policies until convergence is attained. A case study is presented of a multi-reservoir system in the Dalälven River, Sweden, which includes 13 interconnected reservoirs and 36 power stations. Depending on the late spring and summer peak discharges, the lowlands adjacent to Dalälven can often be flooded during the summer period, and the presence of stagnating floodwater during the hottest months of the year is the cause of a large proliferation of mosquitos, which is a major problem for the people living in the surroundings. Chemical pesticides are currently being used as a preventive countermeasure, which do not provide an effective solution to the problem and have adverse environmental impacts. In this study, ADP was used to analyze the feasibility of alternative operating policies for reducing the flood risk at a reasonable economic cost for the hydropower companies. To this end, mid-term operating policies were derived by combining flood risk reduction with hydropower production objectives. The performance

Delay-Dependent Stability Criteria of Uncertain Periodic Switched Recurrent Neural Networks with Time-Varying Delays

Directory of Open Access Journals (Sweden)

Xing Yin

2011-01-01

uncertain periodic switched recurrent neural networks with time-varying delays. When uncertain discrete-time recurrent neural network is a periodic system, it is expressed as switched neural network for the finite switching state. Based on the switched quadratic Lyapunov functional approach (SQLF and free-weighting matrix approach (FWM, some linear matrix inequality criteria are found to guarantee the delay-dependent asymptotical stability of these systems. Two examples illustrate the exactness of the proposed criteria.

THE MATRYOSHKA RUN. II. TIME-DEPENDENT TURBULENCE STATISTICS, STOCHASTIC PARTICLE ACCELERATION, AND MICROPHYSICS IMPACT IN A MASSIVE GALAXY CLUSTER

International Nuclear Information System (INIS)

Miniati, Francesco

2015-01-01

We use the Matryoshka run to study the time-dependent statistics of structure-formation-driven turbulence in the intracluster medium of a 10 15 M ☉ galaxy cluster. We investigate the turbulent cascade in the inner megaparsec for both compressional and incompressible velocity components. The flow maintains approximate conditions of fully developed turbulence, with departures thereof settling in about an eddy-turnover time. Turbulent velocity dispersion remains above 700 km s –1 even at low mass accretion rate, with the fraction of compressional energy between 10% and 40%. The normalization and the slope of the compressional turbulence are susceptible to large variations on short timescales, unlike the incompressible counterpart. A major merger occurs around redshift z ≅ 0 and is accompanied by a long period of enhanced turbulence, ascribed to temporal clustering of mass accretion related to spatial clustering of matter. We test models of stochastic acceleration by compressional modes for the origin of diffuse radio emission in galaxy clusters. The turbulence simulation model constrains an important unknown of this complex problem and brings forth its dependence on the elusive microphysics of the intracluster plasma. In particular, the specifics of the plasma collisionality and the dissipation physics of weak shocks affect the cascade of compressional modes with strong impact on the acceleration rates. In this context radio halos emerge as complex phenomena in which a hierarchy of processes acting on progressively smaller scales are at work. Stochastic acceleration by compressional modes implies statistical correlation of radio power and spectral index with merging cores distance, both testable in principle with radio surveys

Limits for Stochastic Reaction Networks

DEFF Research Database (Denmark)

Cappelletti, Daniele

Reaction systems have been introduced in the 70s to model biochemical systems. Nowadays their range of applications has increased and they are fruitfully used in dierent elds. The concept is simple: some chemical species react, the set of chemical reactions form a graph and a rate function...... is associated with each reaction. Such functions describe the speed of the dierent reactions, or their propensities. Two modelling regimes are then available: the evolution of the dierent species concentrations can be deterministically modelled through a system of ODE, while the counts of the dierent species...... at a certain time are stochastically modelled by means of a continuous-time Markov chain. Our work concerns primarily stochastic reaction systems, and their asymptotic properties. In Paper I, we consider a reaction system with intermediate species, i.e. species that are produced and fast degraded along a path...

State-dependent intrinsic predictability of cortical network dynamics.

Directory of Open Access Journals (Sweden)

Leila Fakhraei

Full Text Available The information encoded in cortical circuit dynamics is fleeting, changing from moment to moment as new input arrives and ongoing intracortical interactions progress. A combination of deterministic and stochastic biophysical mechanisms governs how cortical dynamics at one moment evolve from cortical dynamics in recently preceding moments. Such temporal continuity of cortical dynamics is fundamental to many aspects of cortex function but is not well understood. Here we study temporal continuity by attempting to predict cortical population dynamics (multisite local field potential based on its own recent history in somatosensory cortex of anesthetized rats and in a computational network-level model. We found that the intrinsic predictability of cortical dynamics was dependent on multiple factors including cortical state, synaptic inhibition, and how far into the future the prediction extends. By pharmacologically tuning synaptic inhibition, we obtained a continuum of cortical states with asynchronous population activity at one extreme and stronger, spatially extended synchrony at the other extreme. Intermediate between these extremes we observed evidence for a special regime of population dynamics called criticality. Predictability of the near future (10-100 ms increased as the cortical state was tuned from asynchronous to synchronous. Predictability of the more distant future (>1 s was generally poor, but, surprisingly, was higher for asynchronous states compared to synchronous states. These experimental results were confirmed in a computational network model of spiking excitatory and inhibitory neurons. Our findings demonstrate that determinism and predictability of network dynamics depend on cortical state and the time-scale of the dynamics.

Generation Expansion Planning With Large Amounts of Wind Power via Decision-Dependent Stochastic Programming

Energy Technology Data Exchange (ETDEWEB)

Zhan, Yiduo; Zheng, Qipeng P.; Wang, Jianhui; Pinson, Pierre

2017-07-01

Power generation expansion planning needs to deal with future uncertainties carefully, given that the invested generation assets will be in operation for a long time. Many stochastic programming models have been proposed to tackle this challenge. However, most previous works assume predetermined future uncertainties (i.e., fixed random outcomes with given probabilities). In several recent studies of generation assets' planning (e.g., thermal versus renewable), new findings show that the investment decisions could affect the future uncertainties as well. To this end, this paper proposes a multistage decision-dependent stochastic optimization model for long-term large-scale generation expansion planning, where large amounts of wind power are involved. In the decision-dependent model, the future uncertainties are not only affecting but also affected by the current decisions. In particular, the probability distribution function is determined by not only input parameters but also decision variables. To deal with the nonlinear constraints in our model, a quasi-exact solution approach is then introduced to reformulate the multistage stochastic investment model to a mixed-integer linear programming model. The wind penetration, investment decisions, and the optimality of the decision-dependent model are evaluated in a series of multistage case studies. The results show that the proposed decision-dependent model provides effective optimization solutions for long-term generation expansion planning.

Clustering network layers with the strata multilayer stochastic block model.

Science.gov (United States)

Stanley, Natalie; Shai, Saray; Taylor, Dane; Mucha, Peter J

2016-01-01

Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to discover and quantify underlying relational patterns between nodes. To concisely extract information from a multilayer network, we propose to identify and combine sets of layers with meaningful similarities in community structure. In this paper, we describe the "strata multilayer stochastic block model" (sMLSBM), a probabilistic model for multilayer community structure. The central extension of the model is that there exist groups of layers, called "strata", which are defined such that all layers in a given stratum have community structure described by a common stochastic block model (SBM). That is, layers in a stratum exhibit similar node-to-community assignments and SBM probability parameters. Fitting the sMLSBM to a multilayer network provides a joint clustering that yields node-to-community and layer-to-stratum assignments, which cooperatively aid one another during inference. We describe an algorithm for separating layers into their appropriate strata and an inference technique for estimating the SBM parameters for each stratum. We demonstrate our method using synthetic networks and a multilayer network inferred from data collected in the Human Microbiome Project.

Anti-synchronization control of BAM memristive neural networks with multiple proportional delays and stochastic perturbations

Science.gov (United States)

Wang, Weiping; Yuan, Manman; Luo, Xiong; Liu, Linlin; Zhang, Yao

2018-01-01

Proportional delay is a class of unbounded time-varying delay. A class of bidirectional associative memory (BAM) memristive neural networks with multiple proportional delays is concerned in this paper. First, we propose the model of BAM memristive neural networks with multiple proportional delays and stochastic perturbations. Furthermore, by choosing suitable nonlinear variable transformations, the BAM memristive neural networks with multiple proportional delays can be transformed into the BAM memristive neural networks with constant delays. Based on the drive-response system concept, differential inclusions theory and Lyapunov stability theory, some anti-synchronization criteria are obtained. Finally, the effectiveness of proposed criteria are demonstrated through numerical examples.

Pinning impulsive synchronization of stochastic delayed coupled networks

International Nuclear Information System (INIS)

Tang Yang; Fang Jian-An; Wong W K; Miao Qing-Ying

2011-01-01

In this paper, the pinning synchronization problem of stochastic delayed complex network (SDCN) is investigated by using a novel hybrid pinning controller. The proposed hybrid pinning controller is composed of adaptive controller and impulsive controller, where the two controllers are both added to a fraction of nodes in the network. Using the Lyapunov stability theory and the novel hybrid pinning controller, some sufficient conditions are derived for the exponential synchronization of such dynamical networks in mean square. Two numerical simulation examples are provided to verify the effectiveness of the proposed approach. The simulation results show that the proposed control scheme has a fast convergence rate compared with the conventional adaptive pinning method. (general)

A compositional Translation of Stochastic Automata into Timed Automata

NARCIS (Netherlands)

d' Argenio, P.R.

We present a translation from stochastic automata [17, 16] into timed automata with deadlines [37, 13]. The translation preserves traces when the stochastic characteristics, namely the probability measures, are abstracted from the original stochastic automaton. Moreover, we show that the translation

Stochastic formalism-based seafloor feature discrimination using multifractality of time-dependent acoustic backscatter

Digital Repository Service at National Institute of Oceanography (India)

Haris, K.; Chakraborty, B.

Nonlin. Processes Geophys., 21, 101–113, 2014 www.nonlin-processes-geophys.net/21/101/2014/ doi:10.5194/npg-21-101-2014 © Author(s) 2014. CC Attribution 3.0 License. Nonlinear Processes in Geophysics O pen A ccess Stochastic formalism-based seafloor... shifted in time to align with the selected feature (Fig. 2). The aligned echo envelopes were averaged to obtain stable acoustic signals to Nonlin. Processes Geophys., 21, 101–113, 2014 www.nonlin-processes-geophys.net/21/101/2014/ K. Haris and B...

Fixation and escape times in stochastic game learning

International Nuclear Information System (INIS)

Realpe-Gomez, John; Szczesny, Bartosz; Galla, Tobias; Dall’Asta, Luca

2012-01-01

Evolutionary dynamics in finite populations is known to fixate eventually in the absence of mutation. We here show that a similar phenomenon can be found in stochastic game dynamical batch learning, and investigate fixation in learning processes in a simple 2×2 game, for two-player games with cyclic interaction, and in the context of the best-shot network game. The analogues of finite populations in evolution are here finite batches of observations between strategy updates. We study when and how such fixation can occur, and present results on the average time-to-fixation from numerical simulations. Simple cases are also amenable to analytical approaches and we provide estimates of the behaviour of so-called escape times as a function of the batch size. The differences and similarities with escape and fixation in evolutionary dynamics are discussed. (paper)

Stochastic space-time and quantum theory

International Nuclear Information System (INIS)

Frederick, C.

1976-01-01

Much of quantum mechanics may be derived if one adopts a very strong form of Mach's principle such that in the absence of mass, space-time becomes not flat, but stochastic. This is manifested in the metric tensor which is considered to be a collection of stochastic variables. The stochastic-metric assumption is sufficient to generate the spread of the wave packet in empty space. If one further notes that all observations of dynamical variables in the laboratory frame are contravariant components of tensors, and if one assumes that a Lagrangian can be constructed, then one can obtain an explanation of conjugate variables and also a derivation of the uncertainty principle. Finally the superposition of stochastic metrics and the identification of root -g in the four-dimensional invariant volume element root -g dV as the indicator of relative probability yields the phenomenon of interference as will be described for the two-slit experiment

Modeling noninvasive neurostimulation in epilepsy as stochastic interference in brain networks.

Science.gov (United States)

Stamoulis, Catherine; Chang, Bernard S

2013-05-01

Noninvasive brain stimulation is one of very few potential therapies for medically refractory epilepsy. However, its efficacy remains suboptimal and its therapeutic value has not been consistently assessed. This is in part due to the nonoptimized spatio-temporal application of stimulation protocols for seizure prevention or arrest, and incomplete knowledge of the neurodynamics of seizure evolution. Through simulations, this study investigated electroencephalography (EEG)-guided, stochastic interference with aberrantly coordinated neuronal networks, to prevent seizure onset or interrupt a propagating partial seizure, and prevent it from spreading to large areas of the brain. Brain stimulation was modeled as additive white or band-limited noise, and simulations using real EEGs and data generated from a network of integrate-and-fire neuronal ensembles were used to quantify spatio-temporal noise effects. It was shown that additive stochastic signals (noise) may destructively interfere with network dynamics and decrease or abolish synchronization associated with progressively coupled networks. Furthermore, stimulation parameters, particularly amplitude and spatio-temporal application, may be optimized based on patient-specific neurodynamics estimated directly from noninvasive EEGs.

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

Science.gov (United States)

Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan

2010-01-01

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Degenerate time-dependent network dynamics anticipate seizures in human epileptic brain.

Science.gov (United States)

Tauste Campo, Adrià; Principe, Alessandro; Ley, Miguel; Rocamora, Rodrigo; Deco, Gustavo

2018-04-01

Epileptic seizures are known to follow specific changes in brain dynamics. While some algorithms can nowadays robustly detect these changes, a clear understanding of the mechanism by which these alterations occur and generate seizures is still lacking. Here, we provide crossvalidated evidence that such changes are initiated by an alteration of physiological network state dynamics. Specifically, our analysis of long intracranial electroencephalography (iEEG) recordings from a group of 10 patients identifies a critical phase of a few hours in which time-dependent network states become less variable ("degenerate"), and this phase is followed by a global functional connectivity reduction before seizure onset. This critical phase is characterized by an abnormal occurrence of highly correlated network instances and is shown to be particularly associated with the activity of the resected regions in patients with validated postsurgical outcome. Our approach characterizes preseizure network dynamics as a cascade of 2 sequential events providing new insights into seizure prediction and control.

Finite-time stability of neutral-type neural networks with random time-varying delays

Science.gov (United States)

Ali, M. Syed; Saravanan, S.; Zhu, Quanxin

2017-11-01

This paper is devoted to the finite-time stability analysis of neutral-type neural networks with random time-varying delays. The randomly time-varying delays are characterised by Bernoulli stochastic variable. This result can be extended to analysis and design for neutral-type neural networks with random time-varying delays. On the basis of this paper, we constructed suitable Lyapunov-Krasovskii functional together and established a set of sufficient linear matrix inequalities approach to guarantee the finite-time stability of the system concerned. By employing the Jensen's inequality, free-weighting matrix method and Wirtinger's double integral inequality, the proposed conditions are derived and two numerical examples are addressed for the effectiveness of the developed techniques.

Time dependent accessibility

OpenAIRE

Kaza, Nikhil

2015-01-01

Many place based accessibility studies ignore the time component. Relying on theoretical frameworks that treat distance between two fixed points as constant, these methods ignore the diurnal and seasonal changes in accessibility. Network distances between two nodes are dependent on the network structure and weight distribution on the edges. These weights can change quite frequently and the network structure itself is subject to modification because of availability and unavailability of links ...

Individualism in plant populations: using stochastic differential equations to model individual neighbourhood-dependent plant growth.

Science.gov (United States)

Lv, Qiming; Schneider, Manuel K; Pitchford, Jonathan W

2008-08-01

We study individual plant growth and size hierarchy formation in an experimental population of Arabidopsis thaliana, within an integrated analysis that explicitly accounts for size-dependent growth, size- and space-dependent competition, and environmental stochasticity. It is shown that a Gompertz-type stochastic differential equation (SDE) model, involving asymmetric competition kernels and a stochastic term which decreases with the logarithm of plant weight, efficiently describes individual plant growth, competition, and variability in the studied population. The model is evaluated within a Bayesian framework and compared to its deterministic counterpart, and to several simplified stochastic models, using distributional validation. We show that stochasticity is an important determinant of size hierarchy and that SDE models outperform the deterministic model if and only if structural components of competition (asymmetry; size- and space-dependence) are accounted for. Implications of these results are discussed in the context of plant ecology and in more general modelling situations.

Doubly stochastic coherence in complex neuronal networks

Science.gov (United States)

Gao, Yang; Wang, Jianjun

2012-11-01

A system composed of coupled FitzHugh-Nagumo neurons with various topological structures is investigated under the co-presence of two independently additive and multiplicative Gaussian white noises, in which particular attention is paid to the neuronal networks spiking regularity. As the additive noise intensity and the multiplicative noise intensity are simultaneously adjusted to optimal values, the temporal periodicity of the output of the system reaches the maximum, indicating the occurrence of doubly stochastic coherence. The network topology randomness exerts different influences on the temporal coherence of the spiking oscillation for dissimilar coupling strength regimes. At a small coupling strength, the spiking regularity shows nearly no difference in the regular, small-world, and completely random networks. At an intermediate coupling strength, the temporal periodicity in a small-world neuronal network can be improved slightly by adding a small fraction of long-range connections. At a large coupling strength, the dynamical behavior of the neurons completely loses the resonance property with regard to the additive noise intensity or the multiplicative noise intensity, and the spiking regularity decreases considerably with the increase of the network topology randomness. The network topology randomness plays more of a depressed role than a favorable role in improving the temporal coherence of the spiking oscillation in the neuronal network research study.

Stochastic simulation of enzyme-catalyzed reactions with disparate timescales.

Science.gov (United States)

Barik, Debashis; Paul, Mark R; Baumann, William T; Cao, Yang; Tyson, John J

2008-10-01

Many physiological characteristics of living cells are regulated by protein interaction networks. Because the total numbers of these protein species can be small, molecular noise can have significant effects on the dynamical properties of a regulatory network. Computing these stochastic effects is made difficult by the large timescale separations typical of protein interactions (e.g., complex formation may occur in fractions of a second, whereas catalytic conversions may take minutes). Exact stochastic simulation may be very inefficient under these circumstances, and methods for speeding up the simulation without sacrificing accuracy have been widely studied. We show that the "total quasi-steady-state approximation" for enzyme-catalyzed reactions provides a useful framework for efficient and accurate stochastic simulations. The method is applied to three examples: a simple enzyme-catalyzed reaction where enzyme and substrate have comparable abundances, a Goldbeter-Koshland switch, where a kinase and phosphatase regulate the phosphorylation state of a common substrate, and coupled Goldbeter-Koshland switches that exhibit bistability. Simulations based on the total quasi-steady-state approximation accurately capture the steady-state probability distributions of all components of these reaction networks. In many respects, the approximation also faithfully reproduces time-dependent aspects of the fluctuations. The method is accurate even under conditions of poor timescale separation.

Mean square stabilization and mean square exponential stabilization of stochastic BAM neural networks with Markovian jumping parameters

International Nuclear Information System (INIS)

Ye, Zhiyong; Zhang, He; Zhang, Hongyu; Zhang, Hua; Lu, Guichen

2015-01-01

Highlights: •This paper introduces a non-conservative Lyapunov functional. •The achieved results impose non-conservative and can be widely used. •The conditions are easily checked by the Matlab LMI Tool Box. The desired state feedback controller can be well represented by the conditions. -- Abstract: This paper addresses the mean square exponential stabilization problem of stochastic bidirectional associative memory (BAM) neural networks with Markovian jumping parameters and time-varying delays. By establishing a proper Lyapunov–Krasovskii functional and combining with LMIs technique, several sufficient conditions are derived for ensuring exponential stabilization in the mean square sense of such stochastic BAM neural networks. In addition, the achieved results are not difficult to verify for determining the mean square exponential stabilization of delayed BAM neural networks with Markovian jumping parameters and impose less restrictive and less conservative than the ones in previous papers. Finally, numerical results are given to show the effectiveness and applicability of the achieved results

A scalable computational framework for establishing long-term behavior of stochastic reaction networks.

Directory of Open Access Journals (Sweden)

Ankit Gupta

2014-06-01

Full Text Available Reaction networks are systems in which the populations of a finite number of species evolve through predefined interactions. Such networks are found as modeling tools in many biological disciplines such as biochemistry, ecology, epidemiology, immunology, systems biology and synthetic biology. It is now well-established that, for small population sizes, stochastic models for biochemical reaction networks are necessary to capture randomness in the interactions. The tools for analyzing such models, however, still lag far behind their deterministic counterparts. In this paper, we bridge this gap by developing a constructive framework for examining the long-term behavior and stability properties of the reaction dynamics in a stochastic setting. In particular, we address the problems of determining ergodicity of the reaction dynamics, which is analogous to having a globally attracting fixed point for deterministic dynamics. We also examine when the statistical moments of the underlying process remain bounded with time and when they converge to their steady state values. The framework we develop relies on a blend of ideas from probability theory, linear algebra and optimization theory. We demonstrate that the stability properties of a wide class of biological networks can be assessed from our sufficient theoretical conditions that can be recast as efficient and scalable linear programs, well-known for their tractability. It is notably shown that the computational complexity is often linear in the number of species. We illustrate the validity, the efficiency and the wide applicability of our results on several reaction networks arising in biochemistry, systems biology, epidemiology and ecology. The biological implications of the results as well as an example of a non-ergodic biological network are also discussed.

Existence and exponential stability of almost periodic solution for stochastic cellular neural networks with delay

International Nuclear Information System (INIS)

Huang Zaitang; Yang Qigui

2009-01-01

The paper considers the problems of existence of quadratic mean almost periodic and global exponential stability for stochastic cellular neural networks with delays. By employing the Holder's inequality and fixed points principle, we present some new criteria ensuring existence and uniqueness of a quadratic mean almost periodic and global exponential stability. These criteria are important in signal processing and the design of networks. Moreover, these criteria are also applied in others stochastic biological neural systems.

COST Action ES1401 TIDES: a European network on TIme DEpendent Seismology

Science.gov (United States)

Morelli, Andrea

2016-04-01

Using the full-length records of seismic events and background ambient noise, today seismology is going beyond still-life snapshots of the interior of the Earth, and look into time-dependent changes of its properties. Data availability has grown dramatically with the expansion of seismographic networks and data centers, so as to enable much more detailed and accurate analyses. COST Action ES1401 TIDES (TIme DEpendent Seismology; http://tides-cost.eu) aims at structuring the EU seismological community to enable development of data-intensive, time-dependent techniques for monitoring Earth active processes (e.g., earthquakes, volcanic eruptions, landslides, glacial earthquakes) as well as oil/gas reservoirs. The main structure of TIDES is organised around working groups on: Workflow integration of data and computing resources; Seismic interferometry and ambient noise; Forward problems and High-performance computing applications; Seismic tomography, full waveform inversion and uncertainties; Applications in the natural environment and industry. TIDES is an open network of European laboratories with complementary skills, and is organising a series of events - workshops and advanced training schools - as well as supporting short-duration scientific stays. The first advanced training school was held in Bertinoro (Italy) on June 2015, with attendance of about 100 participants from 20 European countries, was devoted to how to manage and model seismic data with modern tools. The next school, devoted to ambient noise, will be held in 2016 Portugal: the program will be announced at the time of this conference. TIDES will strengthen Europe's role in a critical field for natural hazards and natural resource management.

Stochastic processes in cell biology

CERN Document Server

Bressloff, Paul C

2014-01-01

This book develops the theory of continuous and discrete stochastic processes within the context of cell biology.  A wide range of biological topics are covered including normal and anomalous diffusion in complex cellular environments, stochastic ion channels and excitable systems, stochastic calcium signaling, molecular motors, intracellular transport, signal transduction, bacterial chemotaxis, robustness in gene networks, genetic switches and oscillators, cell polarization, polymerization, cellular length control, and branching processes. The book also provides a pedagogical introduction to the theory of stochastic process – Fokker Planck equations, stochastic differential equations, master equations and jump Markov processes, diffusion approximations and the system size expansion, first passage time problems, stochastic hybrid systems, reaction-diffusion equations, exclusion processes, WKB methods, martingales and branching processes, stochastic calculus, and numerical methods.   This text is primarily...

Drift-Implicit Multi-Level Monte Carlo Tau-Leap Methods for Stochastic Reaction Networks

KAUST Repository

Ben Hammouda, Chiheb

2015-05-12

In biochemical systems, stochastic e↵ects can be caused by the presence of small numbers of certain reactant molecules. In this setting, discrete state-space and stochastic simulation approaches were proved to be more relevant than continuous state-space and deterministic ones. These stochastic models constitute the theory of stochastic reaction networks (SRNs). Furthermore, in some cases, the dynamics of fast and slow time scales can be well separated and this is characterized by what is called sti↵ness. For such problems, the existing discrete space-state stochastic path simulation methods, such as the stochastic simulation algorithm (SSA) and the explicit tau-leap method, can be very slow. Therefore, implicit tau-leap approxima- tions were developed to improve the numerical stability and provide more e cient simulation algorithms for these systems. One of the interesting tasks for SRNs is to approximate the expected values of some observables of the process at a certain fixed time T. This is can be achieved using Monte Carlo (MC) techniques. However, in a recent work, Anderson and Higham in 2013, proposed a more computationally e cient method which combines multi-level Monte Carlo (MLMC) technique with explicit tau-leap schemes. In this MSc thesis, we propose new fast stochastic algorithm, particularly designed 5 to address sti↵ systems, for approximating the expected values of some observables of SRNs. In fact, we take advantage of the idea of MLMC techniques and drift-implicit tau-leap approximation to construct a drift-implicit MLMC tau-leap estimator. In addition to accurately estimating the expected values of a given observable of SRNs at a final time T , our proposed estimator ensures the numerical stability with a lower cost than the MLMC explicit tau-leap algorithm, for systems including simultane- ously fast and slow species. The key contribution of our work is the coupling of two drift-implicit tau-leap paths, which is the basic brick for

Development of a generalized stochastic model for the analysis of monoenergetic space-time nuclear factor Kinetics

International Nuclear Information System (INIS)

Pham, Nhu Viet Ha

2011-02-01

To predict the space-time dependent behavior of a nuclear reactor, the conventional space-dependent kinetics equations are widely used for treating the spatial variables. However, the solutions of such deterministic space-dependent kinetics equations, which give only the mean values of the neutron population and the delayed neutron precursor concentrations, do not offer sufficient insight into the actual dynamic processes within a reactor, where the interacting populations vary randomly with space and time. It is also noted that at high power levels, the random behavior of a reactor is negligible but at low power levels, such as at start-up, random fluctuations in population dynamics can be significant. To mathematically describe the evolution of the state of a nuclear reactor using a set of stochastic kinetics equations, the forward stochastic model (FSM) in stochastic kinetics theory is devised through the concept of reactor transition probability and its probability generating function as the spatial domain of a reactor is partitioned into a number of space cells. Nevertheless, the FSM equations for the mean value of neutron and precursor distribution are deterministic-like. Furthermore, the numerical treatment of the FSM equations for the means, variances, and covariances is quite complicated and time-consuming. In the present study, a generalized stochastic model (called the stochastic space-dependent kinetics model or SSKM) based on the FSM and the Its stochastic differential equations was newly developed for the analysis of monoenergetic spacetime nuclear reactor kinetics in one dimension. First, the FSM equations for determining the mean values of neutron and delayed-neutron precursor populations were considered as the deterministic ones without taking into account their variances and covariances. Second, the system of interest was randomized again in the light of the Its stochastic differential equations in order to derive the SSKM. The proposed model

A Simplified Network Model for Travel Time Reliability Analysis in a Road Network

Directory of Open Access Journals (Sweden)

Kenetsu Uchida

2017-01-01

Full Text Available This paper proposes a simplified network model which analyzes travel time reliability in a road network. A risk-averse driver is assumed in the simplified model. The risk-averse driver chooses a path by taking into account both a path travel time variance and a mean path travel time. The uncertainty addressed in this model is that of traffic flows (i.e., stochastic demand flows. In the simplified network model, the path travel time variance is not calculated by considering all travel time covariance between two links in the network. The path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. Numerical experiments are carried out to illustrate the applicability and validity of the proposed model. The experiments introduce the path choice behavior of a risk-neutral driver and several types of risk-averse drivers. It is shown that the mean link flows calculated by introducing the risk-neutral driver differ as a whole from those calculated by introducing several types of risk-averse drivers. It is also shown that the mean link flows calculated by the simplified network model are almost the same as the flows calculated by using the exact path travel time variance.

Hybrid Multilevel Monte Carlo Simulation of Stochastic Reaction Networks

KAUST Repository

Moraes, Alvaro

2015-01-07

Stochastic reaction networks (SRNs) is a class of continuous-time Markov chains intended to describe, from the kinetic point of view, the time-evolution of chemical systems in which molecules of different chemical species undergo a finite set of reaction channels. This talk is based on articles [4, 5, 6], where we are interested in the following problem: given a SRN, X, defined though its set of reaction channels, and its initial state, x0, estimate E (g(X(T))); that is, the expected value of a scalar observable, g, of the process, X, at a fixed time, T. This problem lead us to define a series of Monte Carlo estimators, M, such that, with high probability can produce values close to the quantity of interest, E (g(X(T))). More specifically, given a user-selected tolerance, TOL, and a small confidence level, η, find an estimator, M, based on approximate sampled paths of X, such that, P (|E (g(X(T))) − M| ≤ TOL) ≥ 1 − η; even more, we want to achieve this objective with near optimal computational work. We first introduce a hybrid path-simulation scheme based on the well-known stochastic simulation algorithm (SSA)[3] and the tau-leap method [2]. Then, we introduce a Multilevel Monte Carlo strategy that allows us to achieve a computational complexity of order O(T OL−2), this is the same computational complexity as in an exact method but with a smaller constant. We provide numerical examples to show our results.

Almost sure exponential stability of stochastic fuzzy cellular neural networks with delays

International Nuclear Information System (INIS)

Zhao Hongyong; Ding Nan; Chen Ling

2009-01-01

This paper is concerned with the problem of exponential stability analysis for fuzzy cellular neural network with delays. By constructing suitable Lyapunov functional and using stochastic analysis we present some sufficient conditions ensuring almost sure exponential stability for the network. Moreover, an example is given to demonstrate the advantages of our method.

A delay-dependent LMI approach to dynamics analysis of discrete-time recurrent neural networks with time-varying delays

International Nuclear Information System (INIS)

Song, Qiankun; Wang, Zidong

2007-01-01

In this Letter, the analysis problem for the existence and stability of periodic solutions is investigated for a class of general discrete-time recurrent neural networks with time-varying delays. For the neural networks under study, a generalized activation function is considered, and the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. By employing the latest free-weighting matrix method, an appropriate Lyapunov-Krasovskii functional is constructed and several sufficient conditions are established to ensure the existence, uniqueness, and globally exponential stability of the periodic solution for the addressed neural network. The conditions are dependent on both the lower bound and upper bound of the time-varying time delays. Furthermore, the conditions are expressed in terms of the linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. Two simulation examples are given to show the effectiveness and less conservatism of the proposed criteria

Probabilistic Inference in General Graphical Models through Sampling in Stochastic Networks of Spiking Neurons

Science.gov (United States)

Pecevski, Dejan; Buesing, Lars; Maass, Wolfgang

2011-01-01

An important open problem of computational neuroscience is the generic organization of computations in networks of neurons in the brain. We show here through rigorous theoretical analysis that inherent stochastic features of spiking neurons, in combination with simple nonlinear computational operations in specific network motifs and dendritic arbors, enable networks of spiking neurons to carry out probabilistic inference through sampling in general graphical models. In particular, it enables them to carry out probabilistic inference in Bayesian networks with converging arrows (“explaining away”) and with undirected loops, that occur in many real-world tasks. Ubiquitous stochastic features of networks of spiking neurons, such as trial-to-trial variability and spontaneous activity, are necessary ingredients of the underlying computational organization. We demonstrate through computer simulations that this approach can be scaled up to neural emulations of probabilistic inference in fairly large graphical models, yielding some of the most complex computations that have been carried out so far in networks of spiking neurons. PMID:22219717

Probabilistic inference in general graphical models through sampling in stochastic networks of spiking neurons.

Directory of Open Access Journals (Sweden)

Dejan Pecevski

2011-12-01

Full Text Available An important open problem of computational neuroscience is the generic organization of computations in networks of neurons in the brain. We show here through rigorous theoretical analysis that inherent stochastic features of spiking neurons, in combination with simple nonlinear computational operations in specific network motifs and dendritic arbors, enable networks of spiking neurons to carry out probabilistic inference through sampling in general graphical models. In particular, it enables them to carry out probabilistic inference in Bayesian networks with converging arrows ("explaining away" and with undirected loops, that occur in many real-world tasks. Ubiquitous stochastic features of networks of spiking neurons, such as trial-to-trial variability and spontaneous activity, are necessary ingredients of the underlying computational organization. We demonstrate through computer simulations that this approach can be scaled up to neural emulations of probabilistic inference in fairly large graphical models, yielding some of the most complex computations that have been carried out so far in networks of spiking neurons.

Probabilistic inference in general graphical models through sampling in stochastic networks of spiking neurons.

Science.gov (United States)

Pecevski, Dejan; Buesing, Lars; Maass, Wolfgang

2011-12-01

An important open problem of computational neuroscience is the generic organization of computations in networks of neurons in the brain. We show here through rigorous theoretical analysis that inherent stochastic features of spiking neurons, in combination with simple nonlinear computational operations in specific network motifs and dendritic arbors, enable networks of spiking neurons to carry out probabilistic inference through sampling in general graphical models. In particular, it enables them to carry out probabilistic inference in Bayesian networks with converging arrows ("explaining away") and with undirected loops, that occur in many real-world tasks. Ubiquitous stochastic features of networks of spiking neurons, such as trial-to-trial variability and spontaneous activity, are necessary ingredients of the underlying computational organization. We demonstrate through computer simulations that this approach can be scaled up to neural emulations of probabilistic inference in fairly large graphical models, yielding some of the most complex computations that have been carried out so far in networks of spiking neurons.

Two-boundary first exit time of Gauss-Markov processes for stochastic modeling of acto-myosin dynamics.

Science.gov (United States)

D'Onofrio, Giuseppe; Pirozzi, Enrica

2017-05-01

We consider a stochastic differential equation in a strip, with coefficients suitably chosen to describe the acto-myosin interaction subject to time-varying forces. By simulating trajectories of the stochastic dynamics via an Euler discretization-based algorithm, we fit experimental data and determine the values of involved parameters. The steps of the myosin are represented by the exit events from the strip. Motivated by these results, we propose a specific stochastic model based on the corresponding time-inhomogeneous Gauss-Markov and diffusion process evolving between two absorbing boundaries. We specify the mean and covariance functions of the stochastic modeling process taking into account time-dependent forces including the effect of an external load. We accurately determine the probability density function (pdf) of the first exit time (FET) from the strip by solving a system of two non singular second-type Volterra integral equations via a numerical quadrature. We provide numerical estimations of the mean of FET as approximations of the dwell-time of the proteins dynamics. The percentage of backward steps is given in agreement to experimental data. Numerical and simulation results are compared and discussed.

Time evolution of one-dimensional gapless models from a domain wall initial state: stochastic Loewner evolution continued?

International Nuclear Information System (INIS)

Calabrese, Pasquale; Hagendorf, Christian; Doussal, Pierre Le

2008-01-01

We study the time evolution of quantum one-dimensional gapless systems evolving from initial states with a domain wall. We generalize the path integral imaginary time approach that together with boundary conformal field theory allows us to derive the time and space dependence of general correlation functions. The latter are explicitly obtained for the Ising universality class, and the typical behavior of one- and two-point functions is derived for the general case. Possible connections with the stochastic Loewner evolution are discussed and explicit results for one-point time dependent averages are obtained for generic κ for boundary conditions corresponding to stochastic Loewner evolution. We use this set of results to predict the time evolution of the entanglement entropy and obtain the universal constant shift due to the presence of a domain wall in the initial state

Effective stochastic generator with site-dependent interactions

Science.gov (United States)

Khamehchi, Masoumeh; Jafarpour, Farhad H.

2017-11-01

It is known that the stochastic generators of effective processes associated with the unconditioned dynamics of rare events might consist of non-local interactions; however, it can be shown that there are special cases for which these generators can include local interactions. In this paper, we investigate this possibility by considering systems of classical particles moving on a one-dimensional lattice with open boundaries. The particles might have hard-core interactions similar to the particles in an exclusion process, or there can be many arbitrary particles at a single site in a zero-range process. Assuming that the interactions in the original process are local and site-independent, we will show that under certain constraints on the microscopic reaction rules, the stochastic generator of an unconditioned process can be local but site-dependent. As two examples, the asymmetric zero-temperature Glauber model and the A-model with diffusion are presented and studied under the above-mentioned constraints.

Temporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks.

Science.gov (United States)

Vestergaard, Christian L; Génois, Mathieu

2015-10-01

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling.

Stochastic Online Learning in Dynamic Networks under Unknown Models

Science.gov (United States)

2016-08-02

The key is to develop online learning strategies at each individual node. Specifically, through local information exchange with its neighbors, each...infinitely repeated game with incomplete information and developed a dynamic pricing strategy referred to as Competitive and Cooperative Demand Learning...Stochastic Online Learning in Dynamic Networks under Unknown Models This research aims to develop fundamental theories and practical algorithms for

Convergence analysis of stochastic hybrid bidirectional associative memory neural networks with delays

International Nuclear Information System (INIS)

Wan Li; Zhou Qinghua

2007-01-01

The stability property of stochastic hybrid bidirectional associate memory (BAM) neural networks with discrete delays is considered. Without assuming the symmetry of synaptic connection weights and the monotonicity and differentiability of activation functions, the delay-independent sufficient conditions to guarantee the exponential stability of the equilibrium solution for such networks are given by using the nonnegative semimartingale convergence theorem

Convergence analysis of stochastic hybrid bidirectional associative memory neural networks with delays

Science.gov (United States)

Wan, Li; Zhou, Qinghua

2007-10-01

The stability property of stochastic hybrid bidirectional associate memory (BAM) neural networks with discrete delays is considered. Without assuming the symmetry of synaptic connection weights and the monotonicity and differentiability of activation functions, the delay-independent sufficient conditions to guarantee the exponential stability of the equilibrium solution for such networks are given by using the nonnegative semimartingale convergence theorem.

Stochastic time series analysis of hydrology data for water resources

Science.gov (United States)

Sathish, S.; Khadar Babu, S. K.

2017-11-01

The prediction to current publication of stochastic time series analysis in hydrology and seasonal stage. The different statistical tests for predicting the hydrology time series on Thomas-Fiering model. The hydrology time series of flood flow have accept a great deal of consideration worldwide. The concentration of stochastic process areas of time series analysis method are expanding with develop concerns about seasonal periods and global warming. The recent trend by the researchers for testing seasonal periods in the hydrologic flowseries using stochastic process on Thomas-Fiering model. The present article proposed to predict the seasonal periods in hydrology using Thomas-Fiering model.

Stochastic lumping analysis for linear kinetics and its application to the fluctuation relations between hierarchical kinetic networks

Energy Technology Data Exchange (ETDEWEB)

Deng, De-Ming; Chang, Cheng-Hung [Institute of Physics, National Chiao Tung University, Hsinchu 300, Taiwan (China)

2015-05-14

Conventional studies of biomolecular behaviors rely largely on the construction of kinetic schemes. Since the selection of these networks is not unique, a concern is raised whether and under which conditions hierarchical schemes can reveal the same experimentally measured fluctuating behaviors and unique fluctuation related physical properties. To clarify these questions, we introduce stochasticity into the traditional lumping analysis, generalize it from rate equations to chemical master equations and stochastic differential equations, and extract the fluctuation relations between kinetically and thermodynamically equivalent networks under intrinsic and extrinsic noises. The results provide a theoretical basis for the legitimate use of low-dimensional models in the studies of macromolecular fluctuations and, more generally, for exploring stochastic features in different levels of contracted networks in chemical and biological kinetic systems.

Stochastic lumping analysis for linear kinetics and its application to the fluctuation relations between hierarchical kinetic networks.

Science.gov (United States)

Deng, De-Ming; Chang, Cheng-Hung

2015-05-14

Conventional studies of biomolecular behaviors rely largely on the construction of kinetic schemes. Since the selection of these networks is not unique, a concern is raised whether and under which conditions hierarchical schemes can reveal the same experimentally measured fluctuating behaviors and unique fluctuation related physical properties. To clarify these questions, we introduce stochasticity into the traditional lumping analysis, generalize it from rate equations to chemical master equations and stochastic differential equations, and extract the fluctuation relations between kinetically and thermodynamically equivalent networks under intrinsic and extrinsic noises. The results provide a theoretical basis for the legitimate use of low-dimensional models in the studies of macromolecular fluctuations and, more generally, for exploring stochastic features in different levels of contracted networks in chemical and biological kinetic systems.

Stochastic time scale for the Universe

International Nuclear Information System (INIS)

Szydlowski, M.; Golda, Z.

1986-01-01

An intrinsic time scale is naturally defined within stochastic gradient dynamical systems. It should be interpreted as a ''relaxation time'' to a local potential minimum after the system has been randomly perturbed. It is shown that for a flat Friedman-like cosmological model this time scale is of order of the age of the Universe. 7 refs. (author)

Network-based stochastic competitive learning approach to disambiguation in collaborative networks

Science.gov (United States)

Christiano Silva, Thiago; Raphael Amancio, Diego

2013-03-01

Many patterns have been uncovered in complex systems through the application of concepts and methodologies of complex networks. Unfortunately, the validity and accuracy of the unveiled patterns are strongly dependent on the amount of unavoidable noise pervading the data, such as the presence of homonymous individuals in social networks. In the current paper, we investigate the problem of name disambiguation in collaborative networks, a task that plays a fundamental role on a myriad of scientific contexts. In special, we use an unsupervised technique which relies on a particle competition mechanism in a networked environment to detect the clusters. It has been shown that, in this kind of environment, the learning process can be improved because the network representation of data can capture topological features of the input data set. Specifically, in the proposed disambiguating model, a set of particles is randomly spawned into the nodes constituting the network. As time progresses, the particles employ a movement strategy composed of a probabilistic convex mixture of random and preferential walking policies. In the former, the walking rule exclusively depends on the topology of the network and is responsible for the exploratory behavior of the particles. In the latter, the walking rule depends both on the topology and the domination levels that the particles impose on the neighboring nodes. This type of behavior compels the particles to perform a defensive strategy, because it will force them to revisit nodes that are already dominated by them, rather than exploring rival territories. Computer simulations conducted on the networks extracted from the arXiv repository of preprint papers and also from other databases reveal the effectiveness of the model, which turned out to be more accurate than traditional clustering methods.

Stochastic simulation of time-series models combined with geostatistics to predict water-table scenarios in a Guarani Aquifer System outcrop area, Brazil

Science.gov (United States)

Manzione, Rodrigo L.; Wendland, Edson; Tanikawa, Diego H.

2012-11-01

Stochastic methods based on time-series modeling combined with geostatistics can be useful tools to describe the variability of water-table levels in time and space and to account for uncertainty. Monitoring water-level networks can give information about the dynamic of the aquifer domain in both dimensions. Time-series modeling is an elegant way to treat monitoring data without the complexity of physical mechanistic models. Time-series model predictions can be interpolated spatially, with the spatial differences in water-table dynamics determined by the spatial variation in the system properties and the temporal variation driven by the dynamics of the inputs into the system. An integration of stochastic methods is presented, based on time-series modeling and geostatistics as a framework to predict water levels for decision making in groundwater management and land-use planning. The methodology is applied in a case study in a Guarani Aquifer System (GAS) outcrop area located in the southeastern part of Brazil. Communication of results in a clear and understandable form, via simulated scenarios, is discussed as an alternative, when translating scientific knowledge into applications of stochastic hydrogeology in large aquifers with limited monitoring network coverage like the GAS.

Risk-sensitive control of stochastic hybrid systems on infinite time horizon

Directory of Open Access Journals (Sweden)

Runolfsson Thordur

1999-01-01

Full Text Available A risk-sensitive optimal control problem is considered for a hybrid system that consists of continuous time diffusion process that depends on a discrete valued mode variable that is modeled as a Markov chain. Optimality conditions are presented and conditions for the existence of optimal controls are derived. It is shown that the optimal risk-sensitive control problem is equivalent to the upper value of an associated stochastic differential game, and insight into the contributions of the noise input and mode variable to the risk sensitivity of the cost functional is given. Furthermore, it is shown that due to the mode variable risk sensitivity, the equivalence relationship that has been observed between risk-sensitive and H ∞ control in the nonhybrid case does not hold for stochastic hybrid systems.

Conductance with stochastic resonance in Mn{sub 12} redox network without tuning

Energy Technology Data Exchange (ETDEWEB)

Hirano, Yoshiaki [Department of Chemistry, Graduate School of Science, Osaka University, 1-1 Machikaneyama-cho, Toyonaka, Osaka 560-0043 (Japan); Graduate School of Engineering, University of Fukui, 3-9-1 Bunkyo, Fukui 910-8507 (Japan); Segawa, Yuji; Kawai, Tomoji [Institute of Scientific and Industrial Research (ISIR), Osaka University, 8-1 Mihogaoka, Ibaraki, Osaka 567-0047 (Japan); Kuroda-Sowa, Takayoshi [Department of Chemistry, Faculty of Science and Engineering, Kinki University, 3-4-1 Kowakae, Higashi-Osaka, Osaka 577-8502 (Japan); Matsumoto, Takuya, E-mail: matsumoto-t@chem.sci.osaka-u.ac.jp [Department of Chemistry, Graduate School of Science, Osaka University, 1-1 Machikaneyama-cho, Toyonaka, Osaka 560-0043 (Japan)

2014-06-09

Artificial neuron-based information processing is one of the attractive approaches of molecular-scale electronics, which can exploit the ability of molecular system for self-assembling or self-organization. The self-organized Mn{sub 12}/DNA redox network shows nonlinear current-voltage characteristics that can be described by the Coulomb blockade network model. As a demonstration of the nonlinear network system, we have observed stochastic resonance without tuning for weak periodic input signals and thermal noise, which suggests a route to neural network composed of molecular materials.

Social networks: Evolving graphs with memory dependent edges

Science.gov (United States)

Grindrod, Peter; Parsons, Mark

2011-10-01

The plethora of digital communication technologies, and their mass take up, has resulted in a wealth of interest in social network data collection and analysis in recent years. Within many such networks the interactions are transient: thus those networks evolve over time. In this paper we introduce a class of models for such networks using evolving graphs with memory dependent edges, which may appear and disappear according to their recent history. We consider time discrete and time continuous variants of the model. We consider the long term asymptotic behaviour as a function of parameters controlling the memory dependence. In particular we show that such networks may continue evolving forever, or else may quench and become static (containing immortal and/or extinct edges). This depends on the existence or otherwise of certain infinite products and series involving age dependent model parameters. We show how to differentiate between the alternatives based on a finite set of observations. To test these ideas we show how model parameters may be calibrated based on limited samples of time dependent data, and we apply these concepts to three real networks: summary data on mobile phone use from a developing region; online social-business network data from China; and disaggregated mobile phone communications data from a reality mining experiment in the US. In each case we show that there is evidence for memory dependent dynamics, such as that embodied within the class of models proposed here.

A Markov model for the temporal dynamics of balanced random networks of finite size

Science.gov (United States)

Lagzi, Fereshteh; Rotter, Stefan

2014-01-01

The balanced state of recurrent networks of excitatory and inhibitory spiking neurons is characterized by fluctuations of population activity about an attractive fixed point. Numerical simulations show that these dynamics are essentially nonlinear, and the intrinsic noise (self-generated fluctuations) in networks of finite size is state-dependent. Therefore, stochastic differential equations with additive noise of fixed amplitude cannot provide an adequate description of the stochastic dynamics. The noise model should, rather, result from a self-consistent description of the network dynamics. Here, we consider a two-state Markovian neuron model, where spikes correspond to transitions from the active state to the refractory state. Excitatory and inhibitory input to this neuron affects the transition rates between the two states. The corresponding nonlinear dependencies can be identified directly from numerical simulations of networks of leaky integrate-and-fire neurons, discretized at a time resolution in the sub-millisecond range. Deterministic mean-field equations, and a noise component that depends on the dynamic state of the network, are obtained from this model. The resulting stochastic model reflects the behavior observed in numerical simulations quite well, irrespective of the size of the network. In particular, a strong temporal correlation between the two populations, a hallmark of the balanced state in random recurrent networks, are well represented by our model. Numerical simulations of such networks show that a log-normal distribution of short-term spike counts is a property of balanced random networks with fixed in-degree that has not been considered before, and our model shares this statistical property. Furthermore, the reconstruction of the flow from simulated time series suggests that the mean-field dynamics of finite-size networks are essentially of Wilson-Cowan type. We expect that this novel nonlinear stochastic model of the interaction between

Real-time forecasting of an epidemic using a discrete time stochastic model: a case study of pandemic influenza (H1N1-2009

Directory of Open Access Journals (Sweden)

Nishiura Hiroshi

2011-02-01

Full Text Available Abstract Background Real-time forecasting of epidemics, especially those based on a likelihood-based approach, is understudied. This study aimed to develop a simple method that can be used for the real-time epidemic forecasting. Methods A discrete time stochastic model, accounting for demographic stochasticity and conditional measurement, was developed and applied as a case study to the weekly incidence of pandemic influenza (H1N1-2009 in Japan. By imposing a branching process approximation and by assuming the linear growth of cases within each reporting interval, the epidemic curve is predicted using only two parameters. The uncertainty bounds of the forecasts are computed using chains of conditional offspring distributions. Results The quality of the forecasts made before the epidemic peak appears largely to depend on obtaining valid parameter estimates. The forecasts of both weekly incidence and final epidemic size greatly improved at and after the epidemic peak with all the observed data points falling within the uncertainty bounds. Conclusions Real-time forecasting using the discrete time stochastic model with its simple computation of the uncertainty bounds was successful. Because of the simplistic model structure, the proposed model has the potential to additionally account for various types of heterogeneity, time-dependent transmission dynamics and epidemiological details. The impact of such complexities on forecasting should be explored when the data become available as part of the disease surveillance.

Fully probabilistic control for stochastic nonlinear control systems with input dependent noise.

Science.gov (United States)

Herzallah, Randa

2015-03-01

Robust controllers for nonlinear stochastic systems with functional uncertainties can be consistently designed using probabilistic control methods. In this paper a generalised probabilistic controller design for the minimisation of the Kullback-Leibler divergence between the actual joint probability density function (pdf) of the closed loop control system, and an ideal joint pdf is presented emphasising how the uncertainty can be systematically incorporated in the absence of reliable systems models. To achieve this objective all probabilistic models of the system are estimated from process data using mixture density networks (MDNs) where all the parameters of the estimated pdfs are taken to be state and control input dependent. Based on this dependency of the density parameters on the input values, explicit formulations to the construction of optimal generalised probabilistic controllers are obtained through the techniques of dynamic programming and adaptive critic methods. Using the proposed generalised probabilistic controller, the conditional joint pdfs can be made to follow the ideal ones. A simulation example is used to demonstrate the implementation of the algorithm and encouraging results are obtained. Copyright © 2014 Elsevier Ltd. All rights reserved.

Robust classification using mixtures of dependency networks

DEFF Research Database (Denmark)

Gámez, José A.; Mateo, Juan L.; Nielsen, Thomas Dyhre

2008-01-01

Dependency networks have previously been proposed as alternatives to e.g. Bayesian networks by supporting fast algorithms for automatic learning. Recently dependency networks have also been proposed as classification models, but as with e.g. general probabilistic inference, the reported speed......-ups are often obtained at the expense of accuracy. In this paper we try to address this issue through the use of mixtures of dependency networks. To reduce learning time and improve robustness when dealing with data sparse classes, we outline methods for reusing calculations across mixture components. Finally...

Time-dependent reliability analysis of flood defences

International Nuclear Information System (INIS)

Buijs, F.A.; Hall, J.W.; Sayers, P.B.; Gelder, P.H.A.J.M. van

2009-01-01

This paper describes the underlying theory and a practical process for establishing time-dependent reliability models for components in a realistic and complex flood defence system. Though time-dependent reliability models have been applied frequently in, for example, the offshore, structural safety and nuclear industry, application in the safety-critical field of flood defence has to date been limited. The modelling methodology involves identifying relevant variables and processes, characterisation of those processes in appropriate mathematical terms, numerical implementation, parameter estimation and prediction. A combination of stochastic, hierarchical and parametric processes is employed. The approach is demonstrated for selected deterioration mechanisms in the context of a flood defence system. The paper demonstrates that this structured methodology enables the definition of credible statistical models for time-dependence of flood defences in data scarce situations. In the application of those models one of the main findings is that the time variability in the deterioration process tends to be governed the time-dependence of one or a small number of critical attributes. It is demonstrated how the need for further data collection depends upon the relevance of the time-dependence in the performance of the flood defence system.

NLP model and stochastic multi-start optimization approach for heat exchanger networks

International Nuclear Information System (INIS)

Núñez-Serna, Rosa I.; Zamora, Juan M.

2016-01-01

Highlights: • An NLP model for the optimal design of heat exchanger networks is proposed. • The NLP model is developed from a stage-wise grid diagram representation. • A two-phase stochastic multi-start optimization methodology is utilized. • Improved network designs are obtained with different heat load distributions. • Structural changes and reductions in the number of heat exchangers are produced. - Abstract: Heat exchanger network synthesis methodologies frequently identify good network structures, which nevertheless, might be accompanied by suboptimal values of design variables. The objective of this work is to develop a nonlinear programming (NLP) model and an optimization approach that aim at identifying the best values for intermediate temperatures, sub-stream flow rate fractions, heat loads and areas for a given heat exchanger network topology. The NLP model that minimizes the total annual cost of the network is constructed based on a stage-wise grid diagram representation. To improve the possibilities of obtaining global optimal designs, a two-phase stochastic multi-start optimization algorithm is utilized for the solution of the developed model. The effectiveness of the proposed optimization approach is illustrated with the optimization of two network designs proposed in the literature for two well-known benchmark problems. Results show that from the addressed base network topologies it is possible to achieve improved network designs, with redistributions in exchanger heat loads that lead to reductions in total annual costs. The results also show that the optimization of a given network design sometimes leads to structural simplifications and reductions in the total number of heat exchangers of the network, thereby exposing alternative viable network topologies initially not anticipated.

Super-transient scaling in time-delay autonomous Boolean network motifs

Energy Technology Data Exchange (ETDEWEB)

D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)

2016-09-15

Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.

Fitting Social Network Models Using Varying Truncation Stochastic Approximation MCMC Algorithm

KAUST Repository

Jin, Ick Hoon

2013-10-01

The exponential random graph model (ERGM) plays a major role in social network analysis. However, parameter estimation for the ERGM is a hard problem due to the intractability of its normalizing constant and the model degeneracy. The existing algorithms, such as Monte Carlo maximum likelihood estimation (MCMLE) and stochastic approximation, often fail for this problem in the presence of model degeneracy. In this article, we introduce the varying truncation stochastic approximation Markov chain Monte Carlo (SAMCMC) algorithm to tackle this problem. The varying truncation mechanism enables the algorithm to choose an appropriate starting point and an appropriate gain factor sequence, and thus to produce a reasonable parameter estimate for the ERGM even in the presence of model degeneracy. The numerical results indicate that the varying truncation SAMCMC algorithm can significantly outperform the MCMLE and stochastic approximation algorithms: for degenerate ERGMs, MCMLE and stochastic approximation often fail to produce any reasonable parameter estimates, while SAMCMC can do; for nondegenerate ERGMs, SAMCMC can work as well as or better than MCMLE and stochastic approximation. The data and source codes used for this article are available online as supplementary materials. © 2013 American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America.

Chronic ethanol exposure produces time- and brain region-dependent changes in gene coexpression networks.

Directory of Open Access Journals (Sweden)

Elizabeth A Osterndorff-Kahanek

Full Text Available Repeated ethanol exposure and withdrawal in mice increases voluntary drinking and represents an animal model of physical dependence. We examined time- and brain region-dependent changes in gene coexpression networks in amygdala (AMY, nucleus accumbens (NAC, prefrontal cortex (PFC, and liver after four weekly cycles of chronic intermittent ethanol (CIE vapor exposure in C57BL/6J mice. Microarrays were used to compare gene expression profiles at 0-, 8-, and 120-hours following the last ethanol exposure. Each brain region exhibited a large number of differentially expressed genes (2,000-3,000 at the 0- and 8-hour time points, but fewer changes were detected at the 120-hour time point (400-600. Within each region, there was little gene overlap across time (~20%. All brain regions were significantly enriched with differentially expressed immune-related genes at the 8-hour time point. Weighted gene correlation network analysis identified modules that were highly enriched with differentially expressed genes at the 0- and 8-hour time points with virtually no enrichment at 120 hours. Modules enriched for both ethanol-responsive and cell-specific genes were identified in each brain region. These results indicate that chronic alcohol exposure causes global 'rewiring' of coexpression systems involving glial and immune signaling as well as neuronal genes.

Stochastic forward and inverse groundwater flow and solute transport modeling

NARCIS (Netherlands)

Janssen, G.M.C.M.

2008-01-01

Keywords: calibration, inverse modeling, stochastic modeling, nonlinear biodegradation, stochastic-convective, advective-dispersive, travel time, network design, non-Gaussian distribution, multimodal distribution, representers

This thesis offers three new approaches that contribute

Robustness and Vulnerability of Networks with Dynamical Dependency Groups.

Science.gov (United States)

Bai, Ya-Nan; Huang, Ning; Wang, Lei; Wu, Zhi-Xi

2016-11-28

The dependency property and self-recovery of failure nodes both have great effects on the robustness of networks during the cascading process. Existing investigations focused mainly on the failure mechanism of static dependency groups without considering the time-dependency of interdependent nodes and the recovery mechanism in reality. In this study, we present an evolving network model consisting of failure mechanisms and a recovery mechanism to explore network robustness, where the dependency relations among nodes vary over time. Based on generating function techniques, we provide an analytical framework for random networks with arbitrary degree distribution. In particular, we theoretically find that an abrupt percolation transition exists corresponding to the dynamical dependency groups for a wide range of topologies after initial random removal. Moreover, when the abrupt transition point is above the failure threshold of dependency groups, the evolving network with the larger dependency groups is more vulnerable; when below it, the larger dependency groups make the network more robust. Numerical simulations employing the Erdős-Rényi network and Barabási-Albert scale free network are performed to validate our theoretical results.

FPGA-Based Stochastic Echo State Networks for Time-Series Forecasting.

Science.gov (United States)

Alomar, Miquel L; Canals, Vincent; Perez-Mora, Nicolas; Martínez-Moll, Víctor; Rosselló, Josep L

2016-01-01

Hardware implementation of artificial neural networks (ANNs) allows exploiting the inherent parallelism of these systems. Nevertheless, they require a large amount of resources in terms of area and power dissipation. Recently, Reservoir Computing (RC) has arisen as a strategic technique to design recurrent neural networks (RNNs) with simple learning capabilities. In this work, we show a new approach to implement RC systems with digital gates. The proposed method is based on the use of probabilistic computing concepts to reduce the hardware required to implement different arithmetic operations. The result is the development of a highly functional system with low hardware resources. The presented methodology is applied to chaotic time-series forecasting.

Time series analysis of temporal networks

Science.gov (United States)

Sikdar, Sandipan; Ganguly, Niloy; Mukherjee, Animesh

2016-01-01

A common but an important feature of all real-world networks is that they are temporal in nature, i.e., the network structure changes over time. Due to this dynamic nature, it becomes difficult to propose suitable growth models that can explain the various important characteristic properties of these networks. In fact, in many application oriented studies only knowing these properties is sufficient. For instance, if one wishes to launch a targeted attack on a network, this can be done even without the knowledge of the full network structure; rather an estimate of some of the properties is sufficient enough to launch the attack. We, in this paper show that even if the network structure at a future time point is not available one can still manage to estimate its properties. We propose a novel method to map a temporal network to a set of time series instances, analyze them and using a standard forecast model of time series, try to predict the properties of a temporal network at a later time instance. To our aim, we consider eight properties such as number of active nodes, average degree, clustering coefficient etc. and apply our prediction framework on them. We mainly focus on the temporal network of human face-to-face contacts and observe that it represents a stochastic process with memory that can be modeled as Auto-Regressive-Integrated-Moving-Average (ARIMA). We use cross validation techniques to find the percentage accuracy of our predictions. An important observation is that the frequency domain properties of the time series obtained from spectrogram analysis could be used to refine the prediction framework by identifying beforehand the cases where the error in prediction is likely to be high. This leads to an improvement of 7.96% (for error level ≤20%) in prediction accuracy on an average across all datasets. As an application we show how such prediction scheme can be used to launch targeted attacks on temporal networks. Contribution to the Topical Issue

On the small-time behavior of stochastic logistic models

Directory of Open Access Journals (Sweden)

Dung Tien Nguyen

2017-09-01

Full Text Available In this paper we investigate the small-time behaviors of the solution to  a stochastic logistic model. The obtained results allow us to estimate the number of individuals in the population and can be used to study stochastic prey-predator systems.

Stochastic and Statistical Analysis of Utility Revenues and Weather Data Analysis for Consumer Demand Estimation in Smart Grids.

Science.gov (United States)

Ali, S M; Mehmood, C A; Khan, B; Jawad, M; Farid, U; Jadoon, J K; Ali, M; Tareen, N K; Usman, S; Majid, M; Anwar, S M

2016-01-01

In smart grid paradigm, the consumer demands are random and time-dependent, owning towards stochastic probabilities. The stochastically varying consumer demands have put the policy makers and supplying agencies in a demanding position for optimal generation management. The utility revenue functions are highly dependent on the consumer deterministic stochastic demand models. The sudden drifts in weather parameters effects the living standards of the consumers that in turn influence the power demands. Considering above, we analyzed stochastically and statistically the effect of random consumer demands on the fixed and variable revenues of the electrical utilities. Our work presented the Multi-Variate Gaussian Distribution Function (MVGDF) probabilistic model of the utility revenues with time-dependent consumer random demands. Moreover, the Gaussian probabilities outcome of the utility revenues is based on the varying consumer n demands data-pattern. Furthermore, Standard Monte Carlo (SMC) simulations are performed that validated the factor of accuracy in the aforesaid probabilistic demand-revenue model. We critically analyzed the effect of weather data parameters on consumer demands using correlation and multi-linear regression schemes. The statistical analysis of consumer demands provided a relationship between dependent (demand) and independent variables (weather data) for utility load management, generation control, and network expansion.

Analysis of isothermal and cooling-rate-dependent immersion freezing by a unifying stochastic ice nucleation model

Science.gov (United States)

Alpert, Peter A.; Knopf, Daniel A.

2016-02-01

Immersion freezing is an important ice nucleation pathway involved in the formation of cirrus and mixed-phase clouds. Laboratory immersion freezing experiments are necessary to determine the range in temperature, T, and relative humidity, RH, at which ice nucleation occurs and to quantify the associated nucleation kinetics. Typically, isothermal (applying a constant temperature) and cooling-rate-dependent immersion freezing experiments are conducted. In these experiments it is usually assumed that the droplets containing ice nucleating particles (INPs) all have the same INP surface area (ISA); however, the validity of this assumption or the impact it may have on analysis and interpretation of the experimental data is rarely questioned. Descriptions of ice active sites and variability of contact angles have been successfully formulated to describe ice nucleation experimental data in previous research; however, we consider the ability of a stochastic freezing model founded on classical nucleation theory to reproduce previous results and to explain experimental uncertainties and data scatter. A stochastic immersion freezing model based on first principles of statistics is presented, which accounts for variable ISA per droplet and uses parameters including the total number of droplets, Ntot, and the heterogeneous ice nucleation rate coefficient, Jhet(T). This model is applied to address if (i) a time and ISA-dependent stochastic immersion freezing process can explain laboratory immersion freezing data for different experimental methods and (ii) the assumption that all droplets contain identical ISA is a valid conjecture with subsequent consequences for analysis and interpretation of immersion freezing. The simple stochastic model can reproduce the observed time and surface area dependence in immersion freezing experiments for a variety of methods such as: droplets on a cold-stage exposed to air or surrounded by an oil matrix, wind and acoustically levitated droplets

Sequential neural models with stochastic layers

DEFF Research Database (Denmark)

Fraccaro, Marco; Sønderby, Søren Kaae; Paquet, Ulrich

2016-01-01

How can we efficiently propagate uncertainty in a latent state representation with recurrent neural networks? This paper introduces stochastic recurrent neural networks which glue a deterministic recurrent neural network and a state space model together to form a stochastic and sequential neural...... generative model. The clear separation of deterministic and stochastic layers allows a structured variational inference network to track the factorization of the model's posterior distribution. By retaining both the nonlinear recursive structure of a recurrent neural network and averaging over...

Stochastic IMT (Insulator-Metal-Transition Neurons: An Interplay of Thermal and Threshold Noise at Bifurcation

Directory of Open Access Journals (Sweden)

Abhinav Parihar

2018-04-01

Full Text Available Artificial neural networks can harness stochasticity in multiple ways to enable a vast class of computationally powerful models. Boltzmann machines and other stochastic neural networks have been shown to outperform their deterministic counterparts by allowing dynamical systems to escape local energy minima. Electronic implementation of such stochastic networks is currently limited to addition of algorithmic noise to digital machines which is inherently inefficient; albeit recent efforts to harness physical noise in devices for stochasticity have shown promise. To succeed in fabricating electronic neuromorphic networks we need experimental evidence of devices with measurable and controllable stochasticity which is complemented with the development of reliable statistical models of such observed stochasticity. Current research literature has sparse evidence of the former and a complete lack of the latter. This motivates the current article where we demonstrate a stochastic neuron using an insulator-metal-transition (IMT device, based on electrically induced phase-transition, in series with a tunable resistance. We show that an IMT neuron has dynamics similar to a piecewise linear FitzHugh-Nagumo (FHN neuron and incorporates all characteristics of a spiking neuron in the device phenomena. We experimentally demonstrate spontaneous stochastic spiking along with electrically controllable firing probabilities using Vanadium Dioxide (VO2 based IMT neurons which show a sigmoid-like transfer function. The stochastic spiking is explained by two noise sources - thermal noise and threshold fluctuations, which act as precursors of bifurcation. As such, the IMT neuron is modeled as an Ornstein-Uhlenbeck (OU process with a fluctuating boundary resulting in transfer curves that closely match experiments. The moments of interspike intervals are calculated analytically by extending the first-passage-time (FPT models for Ornstein-Uhlenbeck (OU process to include a

HSimulator: Hybrid Stochastic/Deterministic Simulation of Biochemical Reaction Networks

Directory of Open Access Journals (Sweden)

Luca Marchetti

2017-01-01

Full Text Available HSimulator is a multithread simulator for mass-action biochemical reaction systems placed in a well-mixed environment. HSimulator provides optimized implementation of a set of widespread state-of-the-art stochastic, deterministic, and hybrid simulation strategies including the first publicly available implementation of the Hybrid Rejection-based Stochastic Simulation Algorithm (HRSSA. HRSSA, the fastest hybrid algorithm to date, allows for an efficient simulation of the models while ensuring the exact simulation of a subset of the reaction network modeling slow reactions. Benchmarks show that HSimulator is often considerably faster than the other considered simulators. The software, running on Java v6.0 or higher, offers a simulation GUI for modeling and visually exploring biological processes and a Javadoc-documented Java library to support the development of custom applications. HSimulator is released under the COSBI Shared Source license agreement (COSBI-SSLA.

Robust routing for hazardous materials transportation with conditional value-at-risk on time-dependent networks.

Science.gov (United States)

2012-11-01

New methods are proposed for mitigating risk in hazardous materials (hazmat) transportation, based on Conditional : Value-at-Risk (CVaR) measure, on time-dependent vehicular networks. While the CVaR risk measure has been : popularly used in financial...

Stochastic Synapses Enable Efficient Brain-Inspired Learning Machines

Science.gov (United States)

Neftci, Emre O.; Pedroni, Bruno U.; Joshi, Siddharth; Al-Shedivat, Maruan; Cauwenberghs, Gert

2016-01-01

Recent studies have shown that synaptic unreliability is a robust and sufficient mechanism for inducing the stochasticity observed in cortex. Here, we introduce Synaptic Sampling Machines (S2Ms), a class of neural network models that uses synaptic stochasticity as a means to Monte Carlo sampling and unsupervised learning. Similar to the original formulation of Boltzmann machines, these models can be viewed as a stochastic counterpart of Hopfield networks, but where stochasticity is induced by a random mask over the connections. Synaptic stochasticity plays the dual role of an efficient mechanism for sampling, and a regularizer during learning akin to DropConnect. A local synaptic plasticity rule implementing an event-driven form of contrastive divergence enables the learning of generative models in an on-line fashion. S2Ms perform equally well using discrete-timed artificial units (as in Hopfield networks) or continuous-timed leaky integrate and fire neurons. The learned representations are remarkably sparse and robust to reductions in bit precision and synapse pruning: removal of more than 75% of the weakest connections followed by cursory re-learning causes a negligible performance loss on benchmark classification tasks. The spiking neuron-based S2Ms outperform existing spike-based unsupervised learners, while potentially offering substantial advantages in terms of power and complexity, and are thus promising models for on-line learning in brain-inspired hardware. PMID:27445650

Incorporating Wind Power Forecast Uncertainties Into Stochastic Unit Commitment Using Neural Network-Based Prediction Intervals.

Science.gov (United States)

Quan, Hao; Srinivasan, Dipti; Khosravi, Abbas

2015-09-01

Penetration of renewable energy resources, such as wind and solar power, into power systems significantly increases the uncertainties on system operation, stability, and reliability in smart grids. In this paper, the nonparametric neural network-based prediction intervals (PIs) are implemented for forecast uncertainty quantification. Instead of a single level PI, wind power forecast uncertainties are represented in a list of PIs. These PIs are then decomposed into quantiles of wind power. A new scenario generation method is proposed to handle wind power forecast uncertainties. For each hour, an empirical cumulative distribution function (ECDF) is fitted to these quantile points. The Monte Carlo simulation method is used to generate scenarios from the ECDF. Then the wind power scenarios are incorporated into a stochastic security-constrained unit commitment (SCUC) model. The heuristic genetic algorithm is utilized to solve the stochastic SCUC problem. Five deterministic and four stochastic case studies incorporated with interval forecasts of wind power are implemented. The results of these cases are presented and discussed together. Generation costs, and the scheduled and real-time economic dispatch reserves of different unit commitment strategies are compared. The experimental results show that the stochastic model is more robust than deterministic ones and, thus, decreases the risk in system operations of smart grids.

FPGA-Based Stochastic Echo State Networks for Time-Series Forecasting

Directory of Open Access Journals (Sweden)

Miquel L. Alomar

2016-01-01

Full Text Available Hardware implementation of artificial neural networks (ANNs allows exploiting the inherent parallelism of these systems. Nevertheless, they require a large amount of resources in terms of area and power dissipation. Recently, Reservoir Computing (RC has arisen as a strategic technique to design recurrent neural networks (RNNs with simple learning capabilities. In this work, we show a new approach to implement RC systems with digital gates. The proposed method is based on the use of probabilistic computing concepts to reduce the hardware required to implement different arithmetic operations. The result is the development of a highly functional system with low hardware resources. The presented methodology is applied to chaotic time-series forecasting.

Stochastic modeling for time series InSAR: with emphasis on atmospheric effects

Science.gov (United States)

Cao, Yunmeng; Li, Zhiwei; Wei, Jianchao; Hu, Jun; Duan, Meng; Feng, Guangcai

2018-02-01

Despite the many applications of time series interferometric synthetic aperture radar (TS-InSAR) techniques in geophysical problems, error analysis and assessment have been largely overlooked. Tropospheric propagation error is still the dominant error source of InSAR observations. However, the spatiotemporal variation of atmospheric effects is seldom considered in the present standard TS-InSAR techniques, such as persistent scatterer interferometry and small baseline subset interferometry. The failure to consider the stochastic properties of atmospheric effects not only affects the accuracy of the estimators, but also makes it difficult to assess the uncertainty of the final geophysical results. To address this issue, this paper proposes a network-based variance-covariance estimation method to model the spatiotemporal variation of tropospheric signals, and to estimate the temporal variance-covariance matrix of TS-InSAR observations. The constructed stochastic model is then incorporated into the TS-InSAR estimators both for parameters (e.g., deformation velocity, topography residual) estimation and uncertainty assessment. It is an incremental and positive improvement to the traditional weighted least squares methods to solve the multitemporal InSAR time series. The performance of the proposed method is validated by using both simulated and real datasets.

Error performance analysis in K-tier uplink cellular networks using a stochastic geometric approach

KAUST Repository

Afify, Laila H.

2015-09-14

In this work, we develop an analytical paradigm to analyze the average symbol error probability (ASEP) performance of uplink traffic in a multi-tier cellular network. The analysis is based on the recently developed Equivalent-in-Distribution approach that utilizes stochastic geometric tools to account for the network geometry in the performance characterization. Different from the other stochastic geometry models adopted in the literature, the developed analysis accounts for important communication system parameters and goes beyond signal-to-interference-plus-noise ratio characterization. That is, the presented model accounts for the modulation scheme, constellation type, and signal recovery techniques to model the ASEP. To this end, we derive single integral expressions for the ASEP for different modulation schemes due to aggregate network interference. Finally, all theoretical findings of the paper are verified via Monte Carlo simulations.

Achieving control and synchronization merely through a stochastically adaptive feedback coupling

Science.gov (United States)

Lin, Wei; Chen, Xin; Zhou, Shijie

2017-07-01

Techniques of deterministically adaptive feedback couplings have been successfully and extensively applied to realize control or/and synchronization in chaotic dynamical systems and even in complex dynamical networks. In this article, a technique of stochastically adaptive feedback coupling is novelly proposed to not only realize control in chaotic dynamical systems but also achieve synchronization in unidirectionally coupled systems. Compared with those deterministically adaptive couplings, the proposed stochastic technique interestingly shows some advantages from a physical viewpoint of time and energy consumptions. More significantly, the usefulness of the proposed stochastic technique is analytically validated by the theory of stochastic processes. It is anticipated that the proposed stochastic technique will be widely used in achieving system control and network synchronization.

An efficient forward-reverse expectation-maximization algorithm for statistical inference in stochastic reaction networks

KAUST Repository

Vilanova, Pedro

2016-01-07

In this work, we present an extension of the forward-reverse representation introduced in Simulation of forward-reverse stochastic representations for conditional diffusions , a 2014 paper by Bayer and Schoenmakers to the context of stochastic reaction networks (SRNs). We apply this stochastic representation to the computation of efficient approximations of expected values of functionals of SRN bridges, i.e., SRNs conditional on their values in the extremes of given time-intervals. We then employ this SRN bridge-generation technique to the statistical inference problem of approximating reaction propensities based on discretely observed data. To this end, we introduce a two-phase iterative inference method in which, during phase I, we solve a set of deterministic optimization problems where the SRNs are replaced by their reaction-rate ordinary differential equations approximation; then, during phase II, we apply the Monte Carlo version of the Expectation-Maximization algorithm to the phase I output. By selecting a set of over-dispersed seeds as initial points in phase I, the output of parallel runs from our two-phase method is a cluster of approximate maximum likelihood estimates. Our results are supported by numerical examples.

Advanced models of neural networks nonlinear dynamics and stochasticity in biological neurons

CERN Document Server

Rigatos, Gerasimos G

2015-01-01

This book provides a complete study on neural structures exhibiting nonlinear and stochastic dynamics, elaborating on neural dynamics by introducing advanced models of neural networks. It overviews the main findings in the modelling of neural dynamics in terms of electrical circuits and examines their stability properties with the use of dynamical systems theory. It is suitable for researchers and postgraduate students engaged with neural networks and dynamical systems theory.

Markov stochasticity coordinates

International Nuclear Information System (INIS)

Eliazar, Iddo

2017-01-01

Markov dynamics constitute one of the most fundamental models of random motion between the states of a system of interest. Markov dynamics have diverse applications in many fields of science and engineering, and are particularly applicable in the context of random motion in networks. In this paper we present a two-dimensional gauging method of the randomness of Markov dynamics. The method–termed Markov Stochasticity Coordinates–is established, discussed, and exemplified. Also, the method is tweaked to quantify the stochasticity of the first-passage-times of Markov dynamics, and the socioeconomic equality and mobility in human societies.

Markov stochasticity coordinates

Energy Technology Data Exchange (ETDEWEB)

Eliazar, Iddo, E-mail: iddo.eliazar@intel.com

2017-01-15

Markov dynamics constitute one of the most fundamental models of random motion between the states of a system of interest. Markov dynamics have diverse applications in many fields of science and engineering, and are particularly applicable in the context of random motion in networks. In this paper we present a two-dimensional gauging method of the randomness of Markov dynamics. The method–termed Markov Stochasticity Coordinates–is established, discussed, and exemplified. Also, the method is tweaked to quantify the stochasticity of the first-passage-times of Markov dynamics, and the socioeconomic equality and mobility in human societies.

Robust Adaptive Exponential Synchronization of Stochastic Perturbed Chaotic Delayed Neural Networks with Parametric Uncertainties

Directory of Open Access Journals (Sweden)

Yang Fang

2014-01-01

Full Text Available This paper investigates the robust adaptive exponential synchronization in mean square of stochastic perturbed chaotic delayed neural networks with nonidentical parametric uncertainties. A robust adaptive feedback controller is proposed based on Gronwally’s inequality, drive-response concept, and adaptive feedback control technique with the update laws of nonidentical parametric uncertainties as well as linear matrix inequality (LMI approach. The sufficient conditions for robust adaptive exponential synchronization in mean square of uncoupled uncertain stochastic chaotic delayed neural networks are derived in terms of linear matrix inequalities (LMIs. The effect of nonidentical uncertain parameter uncertainties is suppressed by the designed robust adaptive feedback controller rapidly. A numerical example is provided to validate the effectiveness of the proposed method.

Stochastic Petri nets for the reliability analysis of communication network applications with alternate-routing

International Nuclear Information System (INIS)

Balakrishnan, Meera; Trivedi, Kishor S.

1996-01-01

In this paper, we present a comparative reliability analysis of an application on a corporate B-ISDN network under various alternate-routing protocols. For simple cases, the reliability problem can be cast into fault-tree models and solved rapidly by means of known methods. For more complex scenarios, state space (Markov) models are required. However, generation of large state space models can get very labor intensive and error prone. We advocate the use of stochastic reward nets (a variant of stochastic Petri nets) for the concise specification, automated generation and solution of alternate-routing protocols in networks. This paper is written in a tutorial style so as to make it accessible to a large audience

Modeling spiking behavior of neurons with time-dependent Poisson processes.

Science.gov (United States)

Shinomoto, S; Tsubo, Y

2001-10-01

Three kinds of interval statistics, as represented by the coefficient of variation, the skewness coefficient, and the correlation coefficient of consecutive intervals, are evaluated for three kinds of time-dependent Poisson processes: pulse regulated, sinusoidally regulated, and doubly stochastic. Among these three processes, the sinusoidally regulated and doubly stochastic Poisson processes, in the case when the spike rate varies slowly compared with the mean interval between spikes, are found to be consistent with the three statistical coefficients exhibited by data recorded from neurons in the prefrontal cortex of monkeys.

Enhanced three-dimensional stochastic adjustment for combined volcano geodetic networks

Science.gov (United States)

Del Potro, R.; Muller, C.

2009-12-01

Volcano geodesy is unquestionably a necessary technique in studies of physical volcanology and for eruption early warning systems. However, as every volcano geodesist knows, obtaining measurements of the required resolution using traditional campaigns and techniques is time consuming and requires a large manpower. Moreover, most volcano geodetic networks worldwide use a combination of data from traditional techniques; levelling, electronic distance measurements (EDM), triangulation and Global Navigation Satellite Systems (GNSS) but, in most cases, these data are surveyed, analysed and adjusted independently. This then leaves it to the authors’ criteria to decide which technique renders the most realistic results in each case. Herein we present a way of solving the problem of inter-methodology data integration in a cost-effective manner following a methodology were all the geodetic data of a redundant, combined network (e.g. surveyed by GNSS, levelling, distance, angular data, INSAR, extensometers, etc.) is adjusted stochastically within a single three-dimensional referential frame. The adjustment methodology is based on the least mean square method and links the data with its geometrical component providing combined, precise, three-dimensional, displacement vectors, relative to external reference points as well as stochastically-quantified, benchmark-specific, uncertainty ellipsoids. Three steps in the adjustment allow identifying, and hence dismissing, flagrant measurement errors (antenna height, atmospheric effects, etc.), checking the consistency of external reference points and a final adjustment of the data. Moreover, since the statistical indicators can be obtained from expected uncertainties in the measurements of the different geodetic techniques used (i.e. independent of the measured data), it is possible to run a priori simulations of a geodetic network in order to constrain its resolution, and reduce logistics, before the network is even built. In this

Approximate method for stochastic chemical kinetics with two-time scales by chemical Langevin equations

International Nuclear Information System (INIS)

Wu, Fuke; Tian, Tianhai; Rawlings, James B.; Yin, George

2016-01-01

The frequently used reduction technique is based on the chemical master equation for stochastic chemical kinetics with two-time scales, which yields the modified stochastic simulation algorithm (SSA). For the chemical reaction processes involving a large number of molecular species and reactions, the collection of slow reactions may still include a large number of molecular species and reactions. Consequently, the SSA is still computationally expensive. Because the chemical Langevin equations (CLEs) can effectively work for a large number of molecular species and reactions, this paper develops a reduction method based on the CLE by the stochastic averaging principle developed in the work of Khasminskii and Yin [SIAM J. Appl. Math. 56, 1766–1793 (1996); ibid. 56, 1794–1819 (1996)] to average out the fast-reacting variables. This reduction method leads to a limit averaging system, which is an approximation of the slow reactions. Because in the stochastic chemical kinetics, the CLE is seen as the approximation of the SSA, the limit averaging system can be treated as the approximation of the slow reactions. As an application, we examine the reduction of computation complexity for the gene regulatory networks with two-time scales driven by intrinsic noise. For linear and nonlinear protein production functions, the simulations show that the sample average (expectation) of the limit averaging system is close to that of the slow-reaction process based on the SSA. It demonstrates that the limit averaging system is an efficient approximation of the slow-reaction process in the sense of the weak convergence.

A Simulation-Based Dynamic Stochastic Route Choice Model for Evacuation

Directory of Open Access Journals (Sweden)

Xing Zhao

2012-01-01

Full Text Available This paper establishes a dynamic stochastic route choice model for evacuation to simulate the propagation process of traffic flow and estimate the stochastic route choice under evacuation situations. The model contains a lane-group-based cell transmission model (CTM which sets different traffic capacities for links with different turning movements to flow out in an evacuation situation, an actual impedance model which is to obtain the impedance of each route in time units at each time interval and a stochastic route choice model according to the probit-based stochastic user equilibrium. In this model, vehicles loading at each origin at each time interval are assumed to choose an evacuation route under determinate road network, signal design, and OD demand. As a case study, the proposed model is validated on the network nearby Nanjing Olympic Center after the opening ceremony of the 10th National Games of the People's Republic of China. The traffic volumes and clearing time at five exit points of the evacuation zone are calculated by the model to compare with survey data. The results show that this model can appropriately simulate the dynamic route choice and evolution process of the traffic flow on the network in an evacuation situation.

Stochastic Variational Learning in Recurrent Spiking Networks

Directory of Open Access Journals (Sweden)

Danilo eJimenez Rezende

2014-04-01

Full Text Available The ability to learn and perform statistical inference with biologically plausible recurrent network of spiking neurons is an important step towards understanding perception and reasoning. Here we derive and investigate a new learning rule for recurrent spiking networks with hidden neurons, combining principles from variational learning and reinforcement learning. Our network defines a generative model over spike train histories and the derived learning rule has the form of a local Spike Timing Dependent Plasticity rule modulated by global factors (neuromodulators conveying information about ``novelty on a statistically rigorous ground.Simulations show that our model is able to learn bothstationary and non-stationary patterns of spike trains.We also propose one experiment that could potentially be performed with animals in order to test the dynamics of the predicted novelty signal.

Stochastic variational learning in recurrent spiking networks.

Science.gov (United States)

Jimenez Rezende, Danilo; Gerstner, Wulfram

2014-01-01

The ability to learn and perform statistical inference with biologically plausible recurrent networks of spiking neurons is an important step toward understanding perception and reasoning. Here we derive and investigate a new learning rule for recurrent spiking networks with hidden neurons, combining principles from variational learning and reinforcement learning. Our network defines a generative model over spike train histories and the derived learning rule has the form of a local Spike Timing Dependent Plasticity rule modulated by global factors (neuromodulators) conveying information about "novelty" on a statistically rigorous ground. Simulations show that our model is able to learn both stationary and non-stationary patterns of spike trains. We also propose one experiment that could potentially be performed with animals in order to test the dynamics of the predicted novelty signal.

Transient fluctuation relations for time-dependent particle transport

Science.gov (United States)

Altland, Alexander; de Martino, Alessandro; Egger, Reinhold; Narozhny, Boris

2010-09-01

We consider particle transport under the influence of time-varying driving forces, where fluctuation relations connect the statistics of pairs of time-reversed evolutions of physical observables. In many “mesoscopic” transport processes, the effective many-particle dynamics is dominantly classical while the microscopic rates governing particle motion are of quantum-mechanical origin. We here employ the stochastic path-integral approach as an optimal tool to probe the fluctuation statistics in such applications. Describing the classical limit of the Keldysh quantum nonequilibrium field theory, the stochastic path integral encapsulates the quantum origin of microscopic particle exchange rates. Dynamically, it is equivalent to a transport master equation which is a formalism general enough to describe many applications of practical interest. We apply the stochastic path integral to derive general functional fluctuation relations for current flow induced by time-varying forces. We show that the successive measurement processes implied by this setup do not put the derivation of quantum fluctuation relations in jeopardy. While in many cases the fluctuation relation for a full time-dependent current profile may contain excessive information, we formulate a number of reduced relations, and demonstrate their application to mesoscopic transport. Examples include the distribution of transmitted charge, where we show that the derivation of a fluctuation relation requires the combined monitoring of the statistics of charge and work.

Analysis of isothermal and cooling rate dependent immersion freezing by a unifying stochastic ice nucleation model

Science.gov (United States)

Alpert, P. A.; Knopf, D. A.

2015-05-01

Immersion freezing is an important ice nucleation pathway involved in the formation of cirrus and mixed-phase clouds. Laboratory immersion freezing experiments are necessary to determine the range in temperature (T) and relative humidity (RH) at which ice nucleation occurs and to quantify the associated nucleation kinetics. Typically, isothermal (applying a constant temperature) and cooling rate dependent immersion freezing experiments are conducted. In these experiments it is usually assumed that the droplets containing ice nuclei (IN) all have the same IN surface area (ISA), however the validity of this assumption or the impact it may have on analysis and interpretation of the experimental data is rarely questioned. A stochastic immersion freezing model based on first principles of statistics is presented, which accounts for variable ISA per droplet and uses physically observable parameters including the total number of droplets (Ntot) and the heterogeneous ice nucleation rate coefficient, Jhet(T). This model is applied to address if (i) a time and ISA dependent stochastic immersion freezing process can explain laboratory immersion freezing data for different experimental methods and (ii) the assumption that all droplets contain identical ISA is a valid conjecture with subsequent consequences for analysis and interpretation of immersion freezing. The simple stochastic model can reproduce the observed time and surface area dependence in immersion freezing experiments for a variety of methods such as: droplets on a cold-stage exposed to air or surrounded by an oil matrix, wind and acoustically levitated droplets, droplets in a continuous flow diffusion chamber (CFDC), the Leipzig aerosol cloud interaction simulator (LACIS), and the aerosol interaction and dynamics in the atmosphere (AIDA) cloud chamber. Observed time dependent isothermal frozen fractions exhibiting non-exponential behavior with time can be readily explained by this model considering varying ISA. An

Stochastic calculus for uncoupled continuous-time random walks.

Science.gov (United States)

Germano, Guido; Politi, Mauro; Scalas, Enrico; Schilling, René L

2009-06-01

The continuous-time random walk (CTRW) is a pure-jump stochastic process with several applications not only in physics but also in insurance, finance, and economics. A definition is given for a class of stochastic integrals driven by a CTRW, which includes the Itō and Stratonovich cases. An uncoupled CTRW with zero-mean jumps is a martingale. It is proved that, as a consequence of the martingale transform theorem, if the CTRW is a martingale, the Itō integral is a martingale too. It is shown how the definition of the stochastic integrals can be used to easily compute them by Monte Carlo simulation. The relations between a CTRW, its quadratic variation, its Stratonovich integral, and its Itō integral are highlighted by numerical calculations when the jumps in space of the CTRW have a symmetric Lévy alpha -stable distribution and its waiting times have a one-parameter Mittag-Leffler distribution. Remarkably, these distributions have fat tails and an unbounded quadratic variation. In the diffusive limit of vanishing scale parameters, the probability density of this kind of CTRW satisfies the space-time fractional diffusion equation (FDE) or more in general the fractional Fokker-Planck equation, which generalizes the standard diffusion equation, solved by the probability density of the Wiener process, and thus provides a phenomenologic model of anomalous diffusion. We also provide an analytic expression for the quadratic variation of the stochastic process described by the FDE and check it by Monte Carlo.

Unified tractable model for downlink MIMO cellular networks using stochastic geometry

KAUST Repository

Afify, Laila H.

2016-07-26

Several research efforts are invested to develop stochastic geometry models for cellular networks with multiple antenna transmission and reception (MIMO). On one hand, there are models that target abstract outage probability and ergodic rate for simplicity. On the other hand, there are models that sacrifice simplicity to target more tangible performance metrics such as the error probability. Both types of models are completely disjoint in terms of the analytic steps to obtain the performance measures, which makes it challenging to conduct studies that account for different performance metrics. This paper unifies both techniques and proposes a unified stochastic-geometry based mathematical paradigm to account for error probability, outage probability, and ergodic rates in MIMO cellular networks. The proposed model is also unified in terms of the antenna configurations and leads to simpler error probability analysis compared to existing state-of-the-art models. The core part of the analysis is based on abstracting unnecessary information conveyed within the interfering signals by assuming Gaussian signaling. To this end, the accuracy of the proposed framework is verified against state-of-the-art models as well as system level simulations. We provide via this unified study insights on network design by reflecting system parameters effect on different performance metrics. © 2016 IEEE.

A Stochastic After-Taxes Optimisation Model to Support Distribution Network Strategies

DEFF Research Database (Denmark)

Fernandes, Rui; Hvolby, Hans-Henrik; Gouveia, Borges

2012-01-01

The paper proposes a stochastic model to integrate tax issues into strategic distribution network decisions. Specifically, this study will explore the role of distribution models in business profitability, and how to use the network design to deliver additional bottom-line results, using...... distribution centres located in different countries. The challenge is also to reveal how financial and tax knowledge can help logistic leaders improving the value to their companies under global solutions and sources of business net profitability in a dynamic environment. In particular, based on inventory...

Fast state estimation subject to random data loss in discrete-time nonlinear stochastic systems

Science.gov (United States)

Mahdi Alavi, S. M.; Saif, Mehrdad

2013-12-01

This paper focuses on the design of the standard observer in discrete-time nonlinear stochastic systems subject to random data loss. By the assumption that the system response is incrementally bounded, two sufficient conditions are subsequently derived that guarantee exponential mean-square stability and fast convergence of the estimation error for the problem at hand. An efficient algorithm is also presented to obtain the observer gain. Finally, the proposed methodology is employed for monitoring the Continuous Stirred Tank Reactor (CSTR) via a wireless communication network. The effectiveness of the designed observer is extensively assessed by using an experimental tested-bed that has been fabricated for performance evaluation of the over wireless-network estimation techniques under realistic radio channel conditions.

Electricity price forecast using Combinatorial Neural Network trained by a new stochastic search method

International Nuclear Information System (INIS)

Abedinia, O.; Amjady, N.; Shafie-khah, M.; Catalão, J.P.S.

2015-01-01

Highlights: • Presenting a Combinatorial Neural Network. • Suggesting a new stochastic search method. • Adapting the suggested method as a training mechanism. • Proposing a new forecast strategy. • Testing the proposed strategy on real-world electricity markets. - Abstract: Electricity price forecast is key information for successful operation of electricity market participants. However, the time series of electricity price has nonlinear, non-stationary and volatile behaviour and so its forecast method should have high learning capability to extract the complex input/output mapping function of electricity price. In this paper, a Combinatorial Neural Network (CNN) based forecasting engine is proposed to predict the future values of price data. The CNN-based forecasting engine is equipped with a new training mechanism for optimizing the weights of the CNN. This training mechanism is based on an efficient stochastic search method, which is a modified version of chemical reaction optimization algorithm, giving high learning ability to the CNN. The proposed price forecast strategy is tested on the real-world electricity markets of Pennsylvania–New Jersey–Maryland (PJM) and mainland Spain and its obtained results are extensively compared with the results obtained from several other forecast methods. These comparisons illustrate effectiveness of the proposed strategy.

Time dependent drift Hamiltonian

International Nuclear Information System (INIS)

Boozer, A.H.

1982-04-01

The motion of individual charged particles in a given magnetic and an electric fields is discussed. An idea of a guiding center distribution function f is introduced. The guiding center distribution function is connected to the asymptotic Hamiltonian through the drift kinetic equation. The general non-stochastic magnetic field can be written in a contravariant and a covariant forms. The drift Hamiltonian is proposed, and the canonical gyroradius is presented. The proposed drift Hamiltonian agrees with Alfven's drift velocity to lowest non-vanishing order in the gyroradius. The relation between the exact, time dependent equations of motion and the guiding center equation is clarified by a Lagrangian analysis. The deduced Lagrangian represents the drift motion. (Kato, T.)

Stochastic multiresonance in coupled excitable FHN neurons

Science.gov (United States)

Li, Huiyan; Sun, Xiaojuan; Xiao, Jinghua

2018-04-01

In this paper, effects of noise on Watts-Strogatz small-world neuronal networks, which are stimulated by a subthreshold signal, have been investigated. With the numerical simulations, it is surprisingly found that there exist several optimal noise intensities at which the subthreshold signal can be detected efficiently. This indicates the occurrence of stochastic multiresonance in the studied neuronal networks. Moreover, it is revealed that the occurrence of stochastic multiresonance has close relationship with the period of subthreshold signal Te and the noise-induced mean period of the neuronal networks T0. In detail, we find that noise could induce the neuronal networks to generate stochastic resonance for M times if Te is not very large and falls into the interval ( M × T 0 , ( M + 1 ) × T 0 ) with M being a positive integer. In real neuronal system, subthreshold signal detection is very meaningful. Thus, the obtained results in this paper could give some important implications on detecting subthreshold signal and propagating neuronal information in neuronal systems.

Routing in Optical and Stochastic Networks

NARCIS (Netherlands)

Yang, S.

2015-01-01

In most types of networks (e.g., optical or transportation networks), finding one or more best paths from a source to a destination, is one of the biggest concerns of network users and providers. This process is known as routing. The routing problems differ accordingly depending on different

Evoking prescribed spike times in stochastic neurons

Science.gov (United States)

Doose, Jens; Lindner, Benjamin

2017-09-01

Single cell stimulation in vivo is a powerful tool to investigate the properties of single neurons and their functionality in neural networks. We present a method to determine a cell-specific stimulus that reliably evokes a prescribed spike train with high temporal precision of action potentials. We test the performance of this stimulus in simulations for two different stochastic neuron models. For a broad range of parameters and a neuron firing with intermediate firing rates (20-40 Hz) the reliability in evoking the prescribed spike train is close to its theoretical maximum that is mainly determined by the level of intrinsic noise.

Analysis of isothermal and cooling-rate-dependent immersion freezing by a unifying stochastic ice nucleation model

Directory of Open Access Journals (Sweden)

P. A. Alpert

2016-02-01

Full Text Available Immersion freezing is an important ice nucleation pathway involved in the formation of cirrus and mixed-phase clouds. Laboratory immersion freezing experiments are necessary to determine the range in temperature, T, and relative humidity, RH, at which ice nucleation occurs and to quantify the associated nucleation kinetics. Typically, isothermal (applying a constant temperature and cooling-rate-dependent immersion freezing experiments are conducted. In these experiments it is usually assumed that the droplets containing ice nucleating particles (INPs all have the same INP surface area (ISA; however, the validity of this assumption or the impact it may have on analysis and interpretation of the experimental data is rarely questioned. Descriptions of ice active sites and variability of contact angles have been successfully formulated to describe ice nucleation experimental data in previous research; however, we consider the ability of a stochastic freezing model founded on classical nucleation theory to reproduce previous results and to explain experimental uncertainties and data scatter. A stochastic immersion freezing model based on first principles of statistics is presented, which accounts for variable ISA per droplet and uses parameters including the total number of droplets, Ntot, and the heterogeneous ice nucleation rate coefficient, Jhet(T. This model is applied to address if (i a time and ISA-dependent stochastic immersion freezing process can explain laboratory immersion freezing data for different experimental methods and (ii the assumption that all droplets contain identical ISA is a valid conjecture with subsequent consequences for analysis and interpretation of immersion freezing. The simple stochastic model can reproduce the observed time and surface area dependence in immersion freezing experiments for a variety of methods such as: droplets on a cold-stage exposed to air or surrounded by an oil matrix, wind and

Multiple coherence resonances and synchronization transitions by time delay in adaptive scale-free neuronal networks with spike-timing-dependent plasticity

International Nuclear Information System (INIS)

Xie, Huijuan; Gong, Yubing

2017-01-01

In this paper, we numerically study the effect of spike-timing-dependent plasticity (STDP) on multiple coherence resonances (MCR) and synchronization transitions (ST) induced by time delay in adaptive scale-free Hodgkin–Huxley neuronal networks. It is found that STDP has a big influence on MCR and ST induced by time delay and on the effect of network average degree on the MCR and ST. MCR is enhanced or suppressed as the adjusting rate A p of STDP decreases or increases, and there is optimal A p by which ST becomes strongest. As network average degree 〈k〉 increases, ST is enhanced and there is optimal 〈k〉 at which MCR becomes strongest. Moreover, for a larger A p value, ST is enhanced more rapidly with increasing 〈k〉 and the optimal 〈k〉 for MCR increases. These results show that STDP can either enhance or suppress MCR, and there is optimal STDP that can most strongly enhance ST induced by time delay in the adaptive neuronal networks. These findings could find potential implication for the information processing and transmission in neural systems.

Network Events on Multiple Space and Time Scales in Cultured Neural Networks and in a Stochastic Rate Model.

Directory of Open Access Journals (Sweden)

Guido Gigante

2015-11-01

Full Text Available Cortical networks, in-vitro as well as in-vivo, can spontaneously generate a variety of collective dynamical events such as network spikes, UP and DOWN states, global oscillations, and avalanches. Though each of them has been variously recognized in previous works as expression of the excitability of the cortical tissue and the associated nonlinear dynamics, a unified picture of the determinant factors (dynamical and architectural is desirable and not yet available. Progress has also been partially hindered by the use of a variety of statistical measures to define the network events of interest. We propose here a common probabilistic definition of network events that, applied to the firing activity of cultured neural networks, highlights the co-occurrence of network spikes, power-law distributed avalanches, and exponentially distributed 'quasi-orbits', which offer a third type of collective behavior. A rate model, including synaptic excitation and inhibition with no imposed topology, synaptic short-term depression, and finite-size noise, accounts for all these different, coexisting phenomena. We find that their emergence is largely regulated by the proximity to an oscillatory instability of the dynamics, where the non-linear excitable behavior leads to a self-amplification of activity fluctuations over a wide range of scales in space and time. In this sense, the cultured network dynamics is compatible with an excitation-inhibition balance corresponding to a slightly sub-critical regime. Finally, we propose and test a method to infer the characteristic time of the fatigue process, from the observed time course of the network's firing rate. Unlike the model, possessing a single fatigue mechanism, the cultured network appears to show multiple time scales, signalling the possible coexistence of different fatigue mechanisms.

Handover management in dense cellular networks: A stochastic geometry approach

KAUST Repository

Arshad, Rabe; Elsawy, Hesham; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-01

Cellular operators are continuously densifying their networks to cope with the ever-increasing capacity demand. Furthermore, an extreme densification phase for cellular networks is foreseen to fulfill the ambitious fifth generation (5G) performance requirements. Network densification improves spectrum utilization and network capacity by shrinking base stations' (BSs) footprints and reusing the same spectrum more frequently over the spatial domain. However, network densification also increases the handover (HO) rate, which may diminish the capacity gains for mobile users due to HO delays. In highly dense 5G cellular networks, HO delays may neutralize or even negate the gains offered by network densification. In this paper, we present an analytical paradigm, based on stochastic geometry, to quantify the effect of HO delay on the average user rate in cellular networks. To this end, we propose a flexible handover scheme to reduce HO delay in case of highly dense cellular networks. This scheme allows skipping the HO procedure with some BSs along users' trajectories. The performance evaluation and testing of this scheme for only single HO skipping shows considerable gains in many practical scenarios. © 2016 IEEE.

Topologically determined optimal stochastic resonance responses of spatially embedded networks

International Nuclear Information System (INIS)

Gosak, Marko; Marhl, Marko; Korosak, Dean

2011-01-01

We have analyzed the stochastic resonance phenomenon on spatial networks of bistable and excitable oscillators, which are connected according to their location and the amplitude of external forcing. By smoothly altering the network topology from a scale-free (SF) network with dominating long-range connections to a network where principally only adjacent oscillators are connected, we reveal that besides an optimal noise intensity, there is also a most favorable interaction topology at which the best correlation between the response of the network and the imposed weak external forcing is achieved. For various distributions of the amplitudes of external forcing, the optimal topology is always found in the intermediate regime between the highly heterogeneous SF network and the strong geometric regime. Our findings thus indicate that a suitable number of hubs and with that an optimal ratio between short- and long-range connections is necessary in order to obtain the best global response of a spatial network. Furthermore, we link the existence of the optimal interaction topology to a critical point indicating the transition from a long-range interactions-dominated network to a more lattice-like network structure.

Handover management in dense cellular networks: A stochastic geometry approach

KAUST Repository

Arshad, Rabe

2016-07-26

Cellular operators are continuously densifying their networks to cope with the ever-increasing capacity demand. Furthermore, an extreme densification phase for cellular networks is foreseen to fulfill the ambitious fifth generation (5G) performance requirements. Network densification improves spectrum utilization and network capacity by shrinking base stations\\' (BSs) footprints and reusing the same spectrum more frequently over the spatial domain. However, network densification also increases the handover (HO) rate, which may diminish the capacity gains for mobile users due to HO delays. In highly dense 5G cellular networks, HO delays may neutralize or even negate the gains offered by network densification. In this paper, we present an analytical paradigm, based on stochastic geometry, to quantify the effect of HO delay on the average user rate in cellular networks. To this end, we propose a flexible handover scheme to reduce HO delay in case of highly dense cellular networks. This scheme allows skipping the HO procedure with some BSs along users\\' trajectories. The performance evaluation and testing of this scheme for only single HO skipping shows considerable gains in many practical scenarios. © 2016 IEEE.

An Efficient Forward-Reverse EM Algorithm for Statistical Inference in Stochastic Reaction Networks

KAUST Repository

Bayer, Christian; Moraes, Alvaro; Tempone, Raul; Vilanova, Pedro

2016-01-01

In this work [1], we present an extension of the forward-reverse algorithm by Bayer and Schoenmakers [2] to the context of stochastic reaction networks (SRNs). We then apply this bridge-generation technique to the statistical inference problem

On the distribution and mean of received power in stochastic cellular network

OpenAIRE

Cao, Fengming; Ganesh, Ayalvadi; Armour, Simon; Sooriyabandara, Mahesh

2016-01-01

This paper exploits the distribution and mean of received power for cellular network with stochastic network modeling to study the difference between the two cell association criteria, i.e. the strongest received power based cell association and the closest distance based cell association. Consequently we derive the analytical expression of the distribution and the mean of the nth strongest received power and the received power from the nth nearest base station and the derivations have been c...

Coarse-graining stochastic biochemical networks: adiabaticity and fast simulations

Energy Technology Data Exchange (ETDEWEB)

Nemenman, Ilya [Los Alamos National Laboratory; Sinitsyn, Nikolai [Los Alamos National Laboratory; Hengartner, Nick [Los Alamos National Laboratory

2008-01-01

We propose a universal approach for analysis and fast simulations of stiff stochastic biochemical kinetics networks, which rests on elimination of fast chemical species without a loss of information about mesoscoplc, non-Poissonian fluctuations of the slow ones. Our approach, which is similar to the Born-Oppenhelmer approximation in quantum mechanics, follows from the stochastic path Integral representation of the cumulant generating function of reaction events. In applications with a small number of chemIcal reactions, It produces analytical expressions for cumulants of chemical fluxes between the slow variables. This allows for a low-dimensional, Interpretable representation and can be used for coarse-grained numerical simulation schemes with a small computational complexity and yet high accuracy. As an example, we derive the coarse-grained description for a chain of biochemical reactions, and show that the coarse-grained and the microscopic simulations are in an agreement, but the coarse-gralned simulations are three orders of magnitude faster.

Spike-timing dependent plasticity and the cognitive map.

Science.gov (United States)

Bush, Daniel; Philippides, Andrew; Husbands, Phil; O'Shea, Michael

2010-01-01

Since the discovery of place cells - single pyramidal neurons that encode spatial location - it has been hypothesized that the hippocampus may act as a cognitive map of known environments. This putative function has been extensively modeled using auto-associative networks, which utilize rate-coded synaptic plasticity rules in order to generate strong bi-directional connections between concurrently active place cells that encode for neighboring place fields. However, empirical studies using hippocampal cultures have demonstrated that the magnitude and direction of changes in synaptic strength can also be dictated by the relative timing of pre- and post-synaptic firing according to a spike-timing dependent plasticity (STDP) rule. Furthermore, electrophysiology studies have identified persistent "theta-coded" temporal correlations in place cell activity in vivo, characterized by phase precession of firing as the corresponding place field is traversed. It is not yet clear if STDP and theta-coded neural dynamics are compatible with cognitive map theory and previous rate-coded models of spatial learning in the hippocampus. Here, we demonstrate that an STDP rule based on empirical data obtained from the hippocampus can mediate rate-coded Hebbian learning when pre- and post-synaptic activity is stochastic and has no persistent sequence bias. We subsequently demonstrate that a spiking recurrent neural network that utilizes this STDP rule, alongside theta-coded neural activity, allows the rapid development of a cognitive map during directed or random exploration of an environment of overlapping place fields. Hence, we establish that STDP and phase precession are compatible with rate-coded models of cognitive map development.

Spike-timing dependent plasticity and the cognitive map

Directory of Open Access Journals (Sweden)

Daniel eBush

2010-10-01

Full Text Available Since the discovery of place cells – single pyramidal neurons that encode spatial location – it has been hypothesised that the hippocampus may act as a cognitive map of known environments. This putative function has been extensively modelled using auto-associative networks, which utilise rate-coded synaptic plasticity rules in order to generate strong bi-directional connections between concurrently active place cells that encode for neighbouring place fields. However, empirical studies using hippocampal cultures have demonstrated that the magnitude and direction of changes in synaptic strength can also be dictated by the relative timing of pre- and post- synaptic firing according to a spike-timing dependent plasticity (STDP rule. Furthermore, electrophysiology studies have identified persistent ‘theta-coded’ temporal correlations in place cell activity in vivo, characterised by phase precession of firing as the corresponding place field is traversed. It is not yet clear if STDP and theta-coded neural dynamics are compatible with cognitive map theory and previous rate-coded models of spatial learning in the hippocampus. Here, we demonstrate that an STDP rule based on empirical data obtained from the hippocampus can mediate rate-coded Hebbian learning when pre- and post- synaptic activity is stochastic and has no persistent sequence bias. We subsequently demonstrate that a spiking recurrent neural network that utilises this STDP rule, alongside theta-coded neural activity, allows the rapid development of a cognitive map during directed or random exploration of an environment of overlapping place fields. Hence, we establish that STDP and phase precession are compatible with rate-coded models of cognitive map development.

Throughput assurance of wireless body area networks coexistence based on stochastic geometry.

Directory of Open Access Journals (Sweden)

Ruixia Liu

Full Text Available Wireless body area networks (WBANs are expected to influence the traditional medical model by assisting caretakers with health telemonitoring. Within WBANs, the transmit power of the nodes should be as small as possible owing to their limited energy capacity but should be sufficiently large to guarantee the quality of the signal at the receiving nodes. When multiple WBANs coexist in a small area, the communication reliability and overall throughput can be seriously affected due to resource competition and interference. We show that the total network throughput largely depends on the WBANs distribution density (λp, transmit power of their nodes (Pt, and their carrier-sensing threshold (γ. Using stochastic geometry, a joint carrier-sensing threshold and power control strategy is proposed to meet the demand of coexisting WBANs based on the IEEE 802.15.4 standard. Given different network distributions and carrier-sensing thresholds, the proposed strategy derives a minimum transmit power according to varying surrounding environment. We obtain expressions for transmission success probability and throughput adopting this strategy. Using numerical examples, we show that joint carrier-sensing thresholds and transmit power strategy can effectively improve the overall system throughput and reduce interference. Additionally, this paper studies the effects of a guard zone on the throughput using a Matern hard-core point process (HCPP type II model. Theoretical analysis and simulation results show that the HCPP model can increase the success probability and throughput of networks.

Tensor methods for parameter estimation and bifurcation analysis of stochastic reaction networks

Czech Academy of Sciences Publication Activity Database

Liao, S.; Vejchodský, Tomáš; Erban, R.

2015-01-01

Roč. 12, č. 108 (2015), s. 20150233 ISSN 1742-5689 EU Projects: European Commission(XE) 328008 - STOCHDETBIOMODEL Institutional support: RVO:67985840 Keywords : gene regulatory networks * stochastic modelling * parametric analysis Subject RIV: BA - General Mathematics Impact factor: 3.818, year: 2015 http://rsif.royalsocietypublishing.org/content/12/108/20150233

Memory effects on stochastic resonance

Science.gov (United States)

Neiman, Alexander; Sung, Wokyung

1996-02-01

We study the phenomenon of stochastic resonance (SR) in a bistable system with internal colored noise. In this situation the system possesses time-dependent memory friction connected with noise via the fluctuation-dissipation theorem, so that in the absence of periodic driving the system approaches the thermodynamic equilibrium state. For this non-Markovian case we find that memory usually suppresses stochastic resonance. However, for a large memory time SR can be enhanced by the memory.

Adaptive neural network output feedback control for stochastic nonlinear systems with unknown dead-zone and unmodeled dynamics.

Science.gov (United States)

Tong, Shaocheng; Wang, Tong; Li, Yongming; Zhang, Huaguang

2014-06-01

This paper discusses the problem of adaptive neural network output feedback control for a class of stochastic nonlinear strict-feedback systems. The concerned systems have certain characteristics, such as unknown nonlinear uncertainties, unknown dead-zones, unmodeled dynamics and without the direct measurements of state variables. In this paper, the neural networks (NNs) are employed to approximate the unknown nonlinear uncertainties, and then by representing the dead-zone as a time-varying system with a bounded disturbance. An NN state observer is designed to estimate the unmeasured states. Based on both backstepping design technique and a stochastic small-gain theorem, a robust adaptive NN output feedback control scheme is developed. It is proved that all the variables involved in the closed-loop system are input-state-practically stable in probability, and also have robustness to the unmodeled dynamics. Meanwhile, the observer errors and the output of the system can be regulated to a small neighborhood of the origin by selecting appropriate design parameters. Simulation examples are also provided to illustrate the effectiveness of the proposed approach.

Time Synchronized Wireless Sensor Network for Vibration Measurement

Science.gov (United States)

Uchimura, Yutaka; Nasu, Tadashi; Takahashi, Motoichi

Network based wireless sensing has become an important area of research and various new applications for remote sensing are expected to emerge. One of the promising applications is structural health monitoring of building or civil engineering structure and it often requires vibration measurement. For the vibration measurement via wireless network, time synchronization is indispensable. In this paper, we introduce a newly developed time synchronized wireless sensor network system. The system employs IEEE 802.11 standard based TSF counter and sends the measured data with the counter value. TSF based synchronization enables consistency on common clock among different wireless nodes. We consider the scale effect on the synchronization accuracy and the effect is evaluated by stochastic analysis and simulation studies. A new wireless sensing system is developed and the hardware and software specifications are shown. The experiments are conducted in a reinforced concrete building and results show good performance enough for vibration measurement purpose.

Multi-scenario modelling of uncertainty in stochastic chemical systems

International Nuclear Information System (INIS)

Evans, R. David; Ricardez-Sandoval, Luis A.

2014-01-01

Uncertainty analysis has not been well studied at the molecular scale, despite extensive knowledge of uncertainty in macroscale systems. The ability to predict the effect of uncertainty allows for robust control of small scale systems such as nanoreactors, surface reactions, and gene toggle switches. However, it is difficult to model uncertainty in such chemical systems as they are stochastic in nature, and require a large computational cost. To address this issue, a new model of uncertainty propagation in stochastic chemical systems, based on the Chemical Master Equation, is proposed in the present study. The uncertain solution is approximated by a composite state comprised of the averaged effect of samples from the uncertain parameter distributions. This model is then used to study the effect of uncertainty on an isomerization system and a two gene regulation network called a repressilator. The results of this model show that uncertainty in stochastic systems is dependent on both the uncertain distribution, and the system under investigation. -- Highlights: •A method to model uncertainty on stochastic systems was developed. •The method is based on the Chemical Master Equation. •Uncertainty in an isomerization reaction and a gene regulation network was modelled. •Effects were significant and dependent on the uncertain input and reaction system. •The model was computationally more efficient than Kinetic Monte Carlo

Robust H∞ Filtering for Uncertain Neutral Stochastic Systems with Markovian Jumping Parameters and Time Delay

Directory of Open Access Journals (Sweden)

Yajun Li

2015-01-01

Full Text Available This paper deals with the robust H∞ filter design problem for a class of uncertain neutral stochastic systems with Markovian jumping parameters and time delay. Based on the Lyapunov-Krasovskii theory and generalized Finsler Lemma, a delay-dependent stability condition is proposed to ensure not only that the filter error system is robustly stochastically stable but also that a prescribed H∞ performance level is satisfied for all admissible uncertainties. All obtained results are expressed in terms of linear matrix inequalities which can be easily solved by MATLAB LMI toolbox. Numerical examples are given to show that the results obtained are both less conservative and less complicated in computation.

Enabling congestion avoidance and reduction in the Michigan-Ohio transportation network to improve supply chain efficiency : freight ATIS.

Science.gov (United States)

2010-01-01

We consider dynamic vehicle routing under milk-run tours with time windows in congested : transportation networks for just-in-time (JIT) production. The arc travel times are considered : stochastic and time-dependent. The problem integrates TSP with ...

A Class of Stochastic Hybrid Systems with State-Dependent Switching Noise

DEFF Research Database (Denmark)

Leth, John-Josef; Rasmussen, Jakob Gulddahl; Schiøler, Henrik

2012-01-01

In this paper, we develop theoretical results based on a proposed method for modeling switching noise for a class of hybrid systems with piecewise linear partitioned state space, and state-depending switching. We devise a stochastic model of such systems, whose global dynamics is governed...

Bayesian inference for hybrid discrete-continuous stochastic kinetic models

International Nuclear Information System (INIS)

Sherlock, Chris; Golightly, Andrew; Gillespie, Colin S

2014-01-01

We consider the problem of efficiently performing simulation and inference for stochastic kinetic models. Whilst it is possible to work directly with the resulting Markov jump process (MJP), computational cost can be prohibitive for networks of realistic size and complexity. In this paper, we consider an inference scheme based on a novel hybrid simulator that classifies reactions as either ‘fast’ or ‘slow’ with fast reactions evolving as a continuous Markov process whilst the remaining slow reaction occurrences are modelled through a MJP with time-dependent hazards. A linear noise approximation (LNA) of fast reaction dynamics is employed and slow reaction events are captured by exploiting the ability to solve the stochastic differential equation driving the LNA. This simulation procedure is used as a proposal mechanism inside a particle MCMC scheme, thus allowing Bayesian inference for the model parameters. We apply the scheme to a simple application and compare the output with an existing hybrid approach and also a scheme for performing inference for the underlying discrete stochastic model. (paper)

Global impulsive exponential synchronization of stochastic perturbed chaotic delayed neural networks

International Nuclear Information System (INIS)

Hua-Guang, Zhang; Tie-Dong, Ma; Jie, Fu; Shao-Cheng, Tong

2009-01-01

In this paper, the global impulsive exponential synchronization problem of a class of chaotic delayed neural networks (DNNs) with stochastic perturbation is studied. Based on the Lyapunov stability theory, stochastic analysis approach and an efficient impulsive delay differential inequality, some new exponential synchronization criteria expressed in the form of the linear matrix inequality (LMI) are derived. The designed impulsive controller not only can globally exponentially stabilize the error dynamics in mean square, but also can control the exponential synchronization rate. Furthermore, to estimate the stable region of the synchronization error dynamics, a novel optimization control algorithm is proposed, which can deal with the minimum problem with two nonlinear terms coexisting in LMIs effectively. Simulation results finally demonstrate the effectiveness of the proposed method

Distributed Constrained Stochastic Subgradient Algorithms Based on Random Projection and Asynchronous Broadcast over Networks

Directory of Open Access Journals (Sweden)

Junlong Zhu

2017-01-01

Full Text Available We consider a distributed constrained optimization problem over a time-varying network, where each agent only knows its own cost functions and its constraint set. However, the local constraint set may not be known in advance or consists of huge number of components in some applications. To deal with such cases, we propose a distributed stochastic subgradient algorithm over time-varying networks, where the estimate of each agent projects onto its constraint set by using random projection technique and the implement of information exchange between agents by employing asynchronous broadcast communication protocol. We show that our proposed algorithm is convergent with probability 1 by choosing suitable learning rate. For constant learning rate, we obtain an error bound, which is defined as the expected distance between the estimates of agent and the optimal solution. We also establish an asymptotic upper bound between the global objective function value at the average of the estimates and the optimal value.

Detection and localization of change points in temporal networks with the aid of stochastic block models

Science.gov (United States)

De Ridder, Simon; Vandermarliere, Benjamin; Ryckebusch, Jan

2016-11-01

A framework based on generalized hierarchical random graphs (GHRGs) for the detection of change points in the structure of temporal networks has recently been developed by Peel and Clauset (2015 Proc. 29th AAAI Conf. on Artificial Intelligence). We build on this methodology and extend it to also include the versatile stochastic block models (SBMs) as a parametric family for reconstructing the empirical networks. We use five different techniques for change point detection on prototypical temporal networks, including empirical and synthetic ones. We find that none of the considered methods can consistently outperform the others when it comes to detecting and locating the expected change points in empirical temporal networks. With respect to the precision and the recall of the results of the change points, we find that the method based on a degree-corrected SBM has better recall properties than other dedicated methods, especially for sparse networks and smaller sliding time window widths.

A theory of Markovian time-inconsistent stochastic control in discrete time

DEFF Research Database (Denmark)

Bjork, Tomas; Murgoci, Agatha

2014-01-01

We develop a theory for a general class of discrete-time stochastic control problems that, in various ways, are time-inconsistent in the sense that they do not admit a Bellman optimality principle. We attack these problems by viewing them within a game theoretic framework, and we look for subgame...

The Robustness of Stochastic Switching Networks

OpenAIRE

Loh, Po-Ling; Zhou, Hongchao; Bruck, Jehoshua

2009-01-01

Many natural systems, including chemical and biological systems, can be modeled using stochastic switching circuits. These circuits consist of stochastic switches, called pswitches, which operate with a fixed probability of being open or closed. We study the effect caused by introducing an error of size ∈ to each pswitch in a stochastic circuit. We analyze two constructions – simple series-parallel and general series-parallel circuits – and prove that simple series-parallel circuits are robus...

Towards the Engineering of Dependable P2P-Based Network Control — The Case of Timely Routing Control Messages

Science.gov (United States)

Tutschku, Kurt; Nakao, Akihiro

This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.

Stochastic heterogeneous interaction promotes cooperation in spatial prisoner's dilemma game.

Directory of Open Access Journals (Sweden)

Ping Zhu

Full Text Available Previous studies mostly investigate player's cooperative behavior as affected by game time-scale or individual diversity. In this paper, by involving both time-scale and diversity simultaneously, we explore the effect of stochastic heterogeneous interaction. In our model, the occurrence of game interaction between each pair of linked player obeys a random probability, which is further described by certain distributions. Simulations on a 4-neighbor square lattice show that the cooperation level is remarkably promoted when stochastic heterogeneous interaction is considered. The results are then explained by investigating the mean payoffs, the mean boundary payoffs and the transition probabilities between cooperators and defectors. We also show some typical snapshots and evolution time series of the system. Finally, the 8-neighbor square lattice and BA scale-free network results indicate that the stochastic heterogeneous interaction can be robust against different network topologies. Our work may sharpen the understanding of the joint effect of game time-scale and individual diversity on spatial games.

Universality in stochastic exponential growth.

Science.gov (United States)

Iyer-Biswas, Srividya; Crooks, Gavin E; Scherer, Norbert F; Dinner, Aaron R

2014-07-11

Recent imaging data for single bacterial cells reveal that their mean sizes grow exponentially in time and that their size distributions collapse to a single curve when rescaled by their means. An analogous result holds for the division-time distributions. A model is needed to delineate the minimal requirements for these scaling behaviors. We formulate a microscopic theory of stochastic exponential growth as a Master Equation that accounts for these observations, in contrast to existing quantitative models of stochastic exponential growth (e.g., the Black-Scholes equation or geometric Brownian motion). Our model, the stochastic Hinshelwood cycle (SHC), is an autocatalytic reaction cycle in which each molecular species catalyzes the production of the next. By finding exact analytical solutions to the SHC and the corresponding first passage time problem, we uncover universal signatures of fluctuations in exponential growth and division. The model makes minimal assumptions, and we describe how more complex reaction networks can reduce to such a cycle. We thus expect similar scalings to be discovered in stochastic processes resulting in exponential growth that appear in diverse contexts such as cosmology, finance, technology, and population growth.

Complex Projective Synchronization in Drive-Response Stochastic Complex Networks by Impulsive Pinning Control

Directory of Open Access Journals (Sweden)

Xuefei Wu

2014-01-01