Articles with "almost sure" as a keyword



Almost sure stability of second‐order nonlinear stochastic system with Lévy noise via sliding mode control

Sign Up to like & get
recommendations!
Published in 2019 at "International Journal of Robust and Nonlinear Control"

DOI: 10.1002/rnc.4707

Abstract: The almost sure stability of second‐order nonlinear stochastic system with Lévy noise is studied by sliding mode control method. A conventional linear sliding mode surface is first constructed, by employing stochastic analysis technique combined with… read more here.

Keywords: system; mode control; sure stability; sliding mode ... See more keywords

Equidistribution for Nonuniformly Expanding Dynamical Systems, and Application to the Almost Sure Invariance Principle

Sign Up to like & get
recommendations!
Published in 2017 at "Communications in Mathematical Physics"

DOI: 10.1007/s00220-017-3062-z

Abstract: Let $${T : M \to M}$$T:M→M be a nonuniformly expanding dynamical system, such as logistic or intermittent map. Let $${v : M \to \mathbb{R}^d}$$v:M→Rd be an observable and $${v_n = \sum_{k=0}^{n-1} v \circ T^k}$$vn=∑k=0n-1v∘Tk denote… read more here.

Keywords: invariance principle; sure invariance; almost sure; expanding dynamical ... See more keywords

On the hardness of analyzing probabilistic programs

Sign Up to like & get
recommendations!
Published in 2018 at "Acta Informatica"

DOI: 10.1007/s00236-018-0321-1

Abstract: We study the hardness of deciding probabilistic termination as well as the hardness of approximating expected values (e.g. of program variables) and (co)variances for probabilistic programs.Termination We distinguish two notions of probabilistic termination: Given a… read more here.

Keywords: sure termination; probabilistic programs; program; value ... See more keywords

Almost sure synchronization for nonlinear complex stochastic networks with Lévy noise

Sign Up to like & get
recommendations!
Published in 2018 at "Nonlinear Dynamics"

DOI: 10.1007/s11071-018-4607-1

Abstract: In this paper, almost sure synchronization is developed for a class of nonlinear complex stochastic networks with an adaptive feedback control. This class of networks are characterized under a general framework, including (1) a continuous… read more here.

Keywords: stochastic networks; nonlinear complex; almost sure; sure synchronization ... See more keywords

Almost sure convergence of ILC for networked linear systems with random link failures

Sign Up to like & get
recommendations!
Published in 2017 at "International Journal of Control, Automation and Systems"

DOI: 10.1007/s12555-015-0273-y

Abstract: The iterative learning control (ILC) problem for networked linear system with random link failure is addressed in this paper. The link failures arise both from the controller to the plant and from the plant to… read more here.

Keywords: link failures; link; sure convergence; almost sure ... See more keywords

Almost sure stability of discrete-time nonlinear Markovian jump delayed systems with impulsive signals

Sign Up to like & get
recommendations!
Published in 2019 at "Nonlinear Analysis: Hybrid Systems"

DOI: 10.1016/j.nahs.2019.06.001

Abstract: Abstract This study investigates the almost sure stability for a class of discrete-time nonlinear Markovian jump delayed systems with impulsive signals, where delay and external input exist in continuous and discrete dynamics. Sufficient conditions that… read more here.

Keywords: sure stability; time; jump; almost sure ... See more keywords

Almost sure convergence to the Quicksort process

Sign Up to like & get
recommendations!
Published in 2020 at "Stochastic Processes and their Applications"

DOI: 10.1016/j.spa.2020.03.008

Abstract: Abstract The algorithm Partial Quicksort, introduced by Conrado Martinez, sorts the l smallest real numbers for a set of n different ones. It uses a splitting like Quicksort, continuing always with the leftmost list. The… read more here.

Keywords: quicksort process; convergence quicksort; quicksort; process ... See more keywords

Small-time almost-sure behaviour of extremal processes

Sign Up to like & get
recommendations!
Published in 2017 at "Advances in Applied Probability"

DOI: 10.1017/apr.2017.7

Abstract: Abstract An rth-order extremal process Δ(r) = (Δ(r) t ) t≥0 is a continuous-time analogue of the rth partial maximum sequence of a sequence of independent and identically distributed random variables. Studying maxima in continuous… read more here.

Keywords: sure behaviour; time; time almost; behaviour extremal ... See more keywords

Almost sure convergence of cover times for $\psi $ -mixing systems

Sign Up to like & get
recommendations!
Published in 2025 at "Ergodic Theory and Dynamical Systems"

DOI: 10.1017/etds.2025.10216

Abstract: Abstract Given a topologically transitive system on the unit interval, one can investigate the cover time, that is, the time for an orbit to reach a certain level of resolution in the repeller. We introduce… read more here.

Keywords: almost sure; systems almost; minkowski dimensions; sure convergence ... See more keywords

Almost sure asymptotic properties of central order statistics from stationary processes

Sign Up to like & get
recommendations!
Published in 2020 at "Communications in Statistics - Theory and Methods"

DOI: 10.1080/03610926.2020.1741629

Abstract: Abstract In this article, we formulate and prove new properties of conditional quantiles given one of the particular sigma-fields. Next, we use them to investigate almost sure asymptotic behavior of central order statistics which arise… read more here.

Keywords: sure asymptotic; central order; stationary processes; order statistics ... See more keywords

Almost Sure Convergence and Non-Asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm

Sign Up to like & get
recommendations!
Published in 2024 at "IEEE Control Systems Letters"

DOI: 10.1109/lcsys.2024.3482148

Abstract: This letter investigates the convergence and concentration properties of the Stochastic Mirror Descent (SMD) algorithm utilizing biased stochastic subgradients. We establish the almost sure convergence of the algorithm’s iterates under the assumption of diminishing bias.… read more here.

Keywords: almost sure; stochastic mirror; concentration; mirror descent ... See more keywords