On transience conditions for Markov chains.
Foss, S. G., Denisov, D. Eh. (2001)
Sibirskij Matematicheskij Zhurnal
Similarity:
Foss, S. G., Denisov, D. Eh. (2001)
Sibirskij Matematicheskij Zhurnal
Similarity:
Y. Xing, S. Ma (2007)
Boletín de Estadística e Investigación Operativa. BEIO
Similarity:
Doisy, M. (2000)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Peter Szabó (2013)
Kybernetika
Similarity:
The paper presents an iterative algorithm for computing the maximum cycle mean (or eigenvalue) of triangular Toeplitz matrix in max-plus algebra. The problem is solved by an iterative algorithm which is applied to special cycles. These cycles of triangular Toeplitz matrices are characterized by sub-partitions of .
Abed Alrahim Yassine, Stéphane Ploix, Jean-Marie Flaus (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper presents a new approach to sensor placement based on diagnosability criteria. It is based on the study of structural matrices. Properties of structural matrices regarding detectability, discriminability and diagnosability are established in order to be used by sensor placement methods. The proposed approach manages any number of constraints modelled by linear or nonlinear equations and it does not require the design of analytical redundancy relations. Assuming that a constraint...
T. Pezda (1994)
Acta Arithmetica
Similarity:
1. Let R be a domain and f ∈ R[X] a polynomial. A k-tuple of distinct elements of R is called a cycle of f if for i=0,1,...,k-2 and . The number k is called the length of the cycle. A tuple is a cycle in R if it is a cycle for some f ∈ R[X]. It has been shown in [1] that if R is the ring of all algebraic integers in a finite extension K of the rationals, then the possible lengths of cycles of R-polynomials are bounded by the number , depending only on the degree N of K. In this...
Matthev O. Ojo (2002)
Kragujevac Journal of Mathematics
Similarity:
Marta Ferreira (2012)
Kybernetika
Similarity:
In what concerns extreme values modeling, heavy tailed autoregressive processes defined with the minimum or maximum operator have proved to be good alternatives to classical linear ARMA with heavy tailed marginals (Davis and Resnick [8], Ferreira and Canto e Castro [13]). In this paper we present a complete characterization of the tail behavior of the autoregressive Pareto process known as Yeh-Arnold-Robertson Pareto(III) (Yeh et al. [32]). We shall see that it is quite similar to the...