相关论文: On the final limit of a transition matrix

A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…

In this paper we recall some results and some criteria on the convergence of matrix continued fractions. The aim of this paper is to give some properties and results of continued fractions with matrix arguments. Then we give continued…

Recent work has shown the effectiveness of tensor network methods for computing large deviation functions in constrained stochastic models in the infinite time limit. Here we show that these methods can also be used to study the statistics…

We derive a new result for exponential approximation using Stein's method of exchangeable pairs. As an application, an exponential limit theorem with error term is derived for |Tr(U)|^2, where Tr(U) denotes the trace of a matrix chosen from…

This paper presents a new parameter estimation algorithm for the adaptive control of a class of time-varying plants. The main feature of this algorithm is a matrix of time-varying learning rates, which enables parameter estimation error…

We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…

In this paper, we propose a numerical method of computing an Hadamard finite-part integral, a finite value assigned to a divergent integral, with a non-integral power singularity at the endpoint on a half infinite interval. In the proposed…

We introduce a new framework term coding for extremal problems in discrete mathematics and information flow, where one chooses interpretations of function symbols so as to maximise the number of satisfying assignments of a finite system of…

Approximate computing is a research area where we investigate a wide spectrum of techniques to trade off computation accuracy for better performance or energy consumption. In this work, we provide a general introduction to approximate…

The standard series expansion for the period of a finite amplitude pendulum as a function of energy (and hence amplitude) provides a lower limit on the period when the series is truncated. An adjustment to the last term in the truncated…

In this paper, we establish sufficient conditions for the existence of error bounds at infinity for lower semicontinuous inequality systems. We also show that the existence of an error bound at infinity of constraint systems plays an…

We consider the problem of estimating the transition rate matrix of a continuous-time Markov chain from a finite-duration realisation of this process. We approach this problem in an imprecise probabilistic framework, using a set of prior…

We introduce a method for calculating individual elements of matrix functions. Our technique makes use of a novel series expansion for the action of matrix functions on basis vectors that is memory efficient even for very large matrices. We…

The notion of tree-shifts constitutes an intermediate class in between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing of the entropy of a tree-shift of finite type. Meanwhile, the entropy of…

Suppose Xt is either a regular exponential type Levy process or a Levy process with a bounded variation jumps measure. The distribution of the extrema of Xt play a crucial role in many financial and actuarial problems. This article employs…

Drift analysis is a powerful tool for analyzing the time complexity of evolutionary algorithms. However, it requires manual construction of drift functions to bound hitting time for each specific algorithm and problem. To address this…

We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…

Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…

We describe a Lohner-type algorithm for the computation of rigorous upper bounds for reachable set for control systems, solutions of ordinary differential inclusions and perturbations of ODEs.

In this work we extend a previous study of matrix models of strength distributions. We still retain the nearest neighbor coupling mode but we extend the values the coupling parameter v. We consider extremes, from very smal v to very large…