Related papers: Realizable monotonicity and inverse probability tr…
Certain monotonicity properties of the Poisson approximation to the binomial distribution are established. As a natural application of these results, exact (rather than approximate) tests of hypotheses on an unknown value of the parameter…
Input-to-State Stability (ISS) is fundamental in mathematically quantifying how stability degrades in the presence of bounded disturbances. If a system is ISS, its trajectories will remain bounded, and will converge to a neighborhood of an…
We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…
We define the empiric stochastic stability of an invariant measure in the finite-time scenario, the classical definition of stochastic stability. We prove that an invariant measure of a continuous system is empirically stochastically stable…
We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the…
In the first part of the paper, we consider a discrete-time stochastic control system. We show that, under certain conditions, the set of random occupational measures generated by the state-control trajectories of the system as well as the…
Abstraction and realization are bilateral processes that are key in deriving intelligence and creativity. In many domains, the two processes are approached through rules: high-level principles that reveal invariances within similar yet…
Let (X_n) be a sequence of random variables (with values in a separable metric space) and (N_n) a sequence of random indices. Conditions for X_{N_n} to converge stably (in particular, in distribution) are provided. Some examples, where such…
Based on set theoretic ordering properties, a general formulation for constructing a pair of convertibility monotones, which are generalizations of distillable entanglement and entanglement cost, is presented. The new pair of monotones do…
We review possible measures of complexity which might in particular be applicable to situations where the complexity seems to arise spontaneously. We point out that not all of them correspond to the intuitive (or "naive") notion, and that…
The idea is advanced that self-organization in complex systems can be treated as decision making (as it is performed by humans) and, vice versa, decision making is nothing but a kind of self-organization in the decision maker nervous…
We show that, in periodically perturbed chaotic systems, Phase Synchronization appears, associated to a special type of stroboscopic map, in which not only averages quantities are equal to invariants of the perturbation, the angular…
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…
First order stochastic dominance and monotone likelihood ratio are two partial orders on the $n$-probability simplex that play an important role in the establishment of structural results for MDPs and POMDPs. We study the strength of those…
Via operator theoretic methods, we formalize the concentration phenomenon for a given observable `$r$' of a discrete time Markov chain with `$\mu_{\pi}$' as invariant ergodic measure, possibly having support on an unbounded state space. The…
We analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However,…
We show that any unitary transformation performed on the quantum state of a closed quantum system, describes an inner, reversible, generalized quantum measurement. We also show that under some specific conditions it is possible to perform a…
Robust model predictive control algorithms are essential for addressing unavoidable errors due to the uncertainty in predicting real-world systems. However, the formulation of such algorithms typically results in a trade-off between…
We consider random dynamical systems such as groups of conformal transformations with a probability measure, or transversaly conformal foliations with a Laplace operator along the leaves, in which case we consider the holonomy pseudo-group.…
A succesful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well chosen mean differential equation. Under an attainability condition,…