Search results for "stochastic"
showing 10 items of 1018 documents
A new stochastic representation for the decay from a metastable state
2002
Abstract We show that a stochastic process on a complex plane can simulate decay from a metastable state. The simplest application of the method to a model in which the approach to equilibrium occurs through transitions over a potential barrier is discussed. The results are compared with direct numerical simulations of the stochastic differential equations describing system's evolution. We have found that the new method is much more efficient from computational point of view than the direct simulations.
On the relationship between the reversed hazard rate and elasticity
2012
Despite hazard and reversed hazard rates sharing a number of similar aspects, reversed hazard functions are far less frequently used. Understanding their meaning is not a simple task. The aim of this paper is to expand the usefulness of the reversed hazard function by relating it to other well-known concepts broadly used in economics: (linear or cumulative) rates of increase and elasticity. This will make it possible (i) to improve our understanding of the consequences of using a particular distribution and, in certain cases, (ii) to introduce our hypotheses and knowledge about the random process in a more meaningful and intuitive way, thus providing a means to achieving distributions that …
Misinterpretation risks of global stochastic optimisation of kinetic models revealed by multiple optimisation runs
2016
Abstract One of use cases for metabolic network optimisation of biotechnologically applied microorganisms is the in silico design of new strains with an improved distribution of metabolic fluxes. Global stochastic optimisation methods (genetic algorithms, evolutionary programing, particle swarm and others) can optimise complicated nonlinear kinetic models and are friendly for unexperienced user: they can return optimisation results with default method settings (population size, number of generations and others) and without adaptation of the model. Drawbacks of these methods (stochastic behaviour, undefined duration of optimisation, possible stagnation and no guaranty of reaching optima) cau…
Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications
2012
Abstract This article concerns the sequential solution to a distributed stochastic optimization problem using learning automata and the Goore game (also referred to as the Gur game in the related literature). The amazing thing about our solution is that, unlike traditional methods, which need N automata (where N determines the degree of accuracy), in this article, we show that we can obtain arbitrary accuracy by recursively using only three automata. To be more specific, the Goore game (GG) introduced in Tsetlin (1973) has the fascinating property that it can be resolved in a completely distributed manner with no inter-communication between the players. The game has recently found applicati…
Understanding the determinants of volatility clustering in terms of stationary Markovian processes
2016
Abstract Volatility is a key variable in the modeling of financial markets. The most striking feature of volatility is that it is a long-range correlated stochastic variable, i.e. its autocorrelation function decays like a power-law τ − β for large time lags. In the present work we investigate the determinants of such feature, starting from the empirical observation that the exponent β of a certain stock’s volatility is a linear function of the average correlation of such stock’s volatility with all other volatilities. We propose a simple approach consisting in diagonalizing the cross-correlation matrix of volatilities and investigating whether or not the diagonalized volatilities still kee…
Stochastic ordering of classical discrete distributions
2010
For several pairs $(P,Q)$ of classical distributions on $\N_0$, we show that their stochastic ordering $P\leq_{st} Q$ can be characterized by their extreme tail ordering equivalent to $ P(\{k_\ast \})/Q(\{k_\ast\}) \le 1 \le \lim_{k\to k^\ast} P(\{k\})/Q(\{k\})$, with $k_\ast$ and $k^\ast$ denoting the minimum and the supremum of the support of $P+Q$, and with the limit to be read as $P(\{k^\ast\})/Q(\{k^\ast\})$ for $k^\ast$ finite. This includes in particular all pairs where $P$ and $Q$ are both binomial ($b_{n_1,p_1} \leq_{st} b_{n_2,p_2}$ if and only if $n_1\le n_2$ and $(1-p_1)^{n_1}\ge(1-p_2)^{n_2}$, or $p_1=0$), both negative binomial ($b^-_{r_1,p_1}\leq_{st} b^-_{r_2,p_2}$ if and on…
Simulation of BSDEs with jumps by Wiener Chaos Expansion
2016
International audience; We present an algorithm to solve BSDEs with jumps based on Wiener Chaos Expansion and Picard's iterations. This paper extends the results given in Briand-Labart (2014) to the case of BSDEs with jumps. We get a forward scheme where the conditional expectations are easily computed thanks to chaos decomposition formulas. Concerning the error, we derive explicit bounds with respect to the number of chaos, the discretization time step and the number of Monte Carlo simulations. We also present numerical experiments. We obtain very encouraging results in terms of speed and accuracy.
Donsker-Type Theorem for BSDEs: Rate of Convergence
2019
In this paper, we study in the Markovian case the rate of convergence in Wasserstein distance when the solution to a BSDE is approximated by a solution to a BSDE driven by a scaled random walk as introduced in Briand, Delyon and Mémin (Electron. Commun. Probab. 6 (2001) Art. ID 1). This is related to the approximation of solutions to semilinear second order parabolic PDEs by solutions to their associated finite difference schemes and the speed of convergence. peerReviewed
Approachability in Population Games
2014
This paper reframes approachability theory within the context of population games. Thus, whilst one player aims at driving her average payoff to a predefined set, her opponent is not malevolent but rather extracted randomly from a population of individuals with given distribution on actions. First, convergence conditions are revisited based on the common prior on the population distribution, and we define the notion of \emph{1st-moment approachability}. Second, we develop a model of two coupled partial differential equations (PDEs) in the spirit of mean-field game theory: one describing the best-response of every player given the population distribution (this is a \emph{Hamilton-Jacobi-Bell…
Role of the noise on the transient dynamics of an ecosystem of interacting species
2002
Abstract We analyze the transient dynamics of an ecosystem described by generalized Lotka–Volterra equations in the presence of a multiplicative noise and a random interaction parameter between the species. We consider specifically three cases: (i) two competing species, (ii) three interacting species (one predator–two preys), (iii) n-interacting species. The interaction parameter in case (i) is a stochastic process which obeys a stochastic differential equation. We find noise delayed extinction of one of two species, which is akin to the noise-enhanced stability phenomenon. Other two noise-induced effects found are temporal oscillations and spatial patterns of the two competing species. In…