stochastically bounded
Recently Published Documents


TOTAL DOCUMENTS

22
(FIVE YEARS 0)

H-INDEX

8
(FIVE YEARS 0)

2019 ◽  
Vol 37 (3) ◽  
pp. 718-729 ◽  
Author(s):  
Peyman Azodi ◽  
Peyman Setoodeh ◽  
Alireza Khayatian ◽  
Elham Jamalinia

Abstract This paper studies stochastic boundedness of trajectories of a non-vanishing stochastically perturbed stable linear time-invariant system. First, two definitions on stochastic boundedness are presented, then, the boundedness is analyzed via Lyapunov theory. A theorem is proposed, which shows that under a condition on the Lipchitz constant of the perturbation kernel, the trajectories remain stochastically bounded, and the bounds are calculated. Also, the limiting behaviour of the trajectories is studied. At the end, an illustrative example is presented, which shows the effectiveness of the proposed theory.


2015 ◽  
Vol 08 (06) ◽  
pp. 1550072 ◽  
Author(s):  
Mei Li ◽  
Hongjun Gao ◽  
Chenfeng Sun ◽  
Yuezheng Gong

This paper is concerned with a mutualism ecological model with stochastic perturbations. The local existence and uniqueness of a positive solution are obtained with positive initial value, and the asymptotic behavior to the problem is studied. Moreover, we show that the solution is stochastically bounded, uniformly continuous and stochastic permanence. The sufficient conditions for the system to be extinct are given and the conditions for the system to be persistent are also established. At last, some figures are presented to illustrate our main results.


2014 ◽  
Vol 2014 ◽  
pp. 1-15
Author(s):  
Dongwei Huang ◽  
Yu Li ◽  
Yongfeng Guo

Stochastic cooperative predator-prey system with Beddington-DeAngelis functional response is studied. It presents an investigation of dynamic properties of the system. Our results show that there exists a unique positive solution to the system for any positive initial value, and the positive solution is stochastically bounded. Moreover, under some conditions, we analyze global asymptotic stability of the positive solutions. With small environmental noises, the stochastic system is getting more similar to the corresponding deterministic system. Neither of the species in the system will die out. Finally, simulations are carried out to conform to our result.


2011 ◽  
Vol Vol. 13 no. 2 (Graph and Algorithms) ◽  
Author(s):  
Damien Pitman

Graphs and Algorithms International audience We describe a limiting distribution for the number of connected components in the subgraph of the discrete cube induced by the satisfying assignments to a random 2-SAT formula. We show that, for the probability range where formulas are likely to be satisfied, the random number of components converges weakly (in the number of variables) to a distribution determined by a Poisson random variable. The number of satisfying assignments or solutions is known to grow exponentially in the number of variables. Thus, our result implies that exponentially many solutions are organized into a stochastically bounded number of components. We also describe an application to biological evolution; in particular, to a type of fitness landscape where satisfying assignments represent viable genotypes and connectivity of genotypes is limited by single site mutations. The biological result is that, with probability approaching 1, each viable genotype is connected by single site mutations to an exponential number of other viable genotypes while the number of viable clusters is finite.


2009 ◽  
Vol 26 (2) ◽  
pp. 469-500
Author(s):  
Walter Beckert ◽  
Daniel L. McFadden

This paper considers parametric estimation problems with independent, identically nonregularly distributed data. It focuses on rate efficiency, in the sense of maximal possible convergence rates of stochastically bounded estimators, as an optimality criterion, largely unexplored in parametric estimation. Under mild conditions, the Hellinger metric, defined on the space of parametric probability measures, is shown to be an essentially universally applicable tool to determine maximal possible convergence rates. These rates are shown to be attainable in general classes of parametric estimation problems.


2009 ◽  
Vol 53 (12) ◽  
pp. 2011-2021 ◽  
Author(s):  
Yuming Jiang ◽  
Qinghe Yin ◽  
Yong Liu ◽  
Shengming Jiang

Sign in / Sign up

Export Citation Format

Share Document