Related papers: Decomposability for stable processes
We propose a definition o meta-stability and obtain sufficient conditions for a sequence of Markov processes on finite state spaces to be meta-stable. In the reversible case, these conditions reduce to estimates of the capacity and the…
We introduce a backward stable algorithm for computing the CS decomposition of a partitioned $2n \times n$ matrix with orthonormal columns, or a rank-deficient partial isometry. The algorithm computes two $n \times n$ polar decompositions…
We summarize the relations among three classes of laws: infinitely divisible, selfdecomposable and stable. First we look at them as the solutions of the Central Limit Problem; then their role is scrutinized in relation to the Levy and the…
This work defines two classes of processes, that we term {\it tempered fractional multistable motion} and {\it tempered multifractional stable motion}. They are extensions of fractional multistable motion and multifractional stable motion,…
Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether the query is stable, that is, whether the answers will stay…
Basic properties of stationary processes called Sarnak processes are studied. As an application, a combinatorial reformulation of Sarnak's conjecture on M{\"o}bius orthogonality is provided.
A definition of metastable states applicable to arbitrary finite state Markov processes satisfying detailed balance is discussed. In particular, we identify a crucial condition that distinguishes genuine metastable states from other types…
The steady states of dynamical processes can exhibit stable nontrivial phases, which can also serve as fault-tolerant classical or quantum memories. For Markovian quantum (classical) dynamics, these steady states are extremal eigenvectors…
In this document, we deal with the stabilization problem of slow-fast systems (or singularly perturbed Ordinary Differential Equations) at a non-hyperbolic point. The class of systems studied here have the following properties: 1) they have…
We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.
Kernels of $\alpha$-permanental processes of the form \[ v(x,y)=u(x,y)+f(y),\qquad x,y\in S, \] in which $u(x,y)$ is symmetric, and $f$ is an excessive function for the Borel right process with potential densities $u(x,y)$, are considered.…
We study a stable partial matching $\tau$ of the (possibly randomized) $d$-dimensional lattice with a stationary determinantal point process $\Psi$ on $\mathbb{R}^d$ with intensity $\alpha>1$. For instance, $\Psi$ might be a Poisson…
We find sufficient conditions for commutative non-autonomous systems on certain metric spaces to be topologically stable. In particular, we prove that (i) Every mean equicontinuous, mean expansive system with strong average shadowing…
This paper presents a novel framework for characterizing dissipativity of uncertain systems whose dynamics evolve according to differential-algebraic equations. Sufficient conditions for dissipativity (specializing to, e.g., stability or…
This paper analyzes the limit properties of the empirical process of $\alpha$-stable random variables with long range dependence. The $\alpha$-stable random variables are constructed by non-linear transformations of bivariate sequences of…
It is shown that a well-known theory of random stationary processes contain contradictions. Integral representations of correlation functions and random stationary processes are investigated further. The new method of struggle with…
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning. An ASP program can have no answer set due to cyclic default negation. In this case, it is not possible to draw any conclusion, even if this is not…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We investigate the stability properties of two different classes of metabolic cycles using a combination of analytical and computational methods. Using principles from structural kinetic modeling (SKM), we show that the stability of…