Add to ORKGA recent paper by Pollicott in 2010 presented an efficient algorithm for computing the Lyapunov exponent of i.i.d. random products of positive matrices. The aim of this thesis is to generalise some of the aspects of Pollicott's approach to Markovian and more general matrix products using the theory of transfer operators. Some minor mistakes in Pollicott's original paper are corrected in the thesis. The possibility of further generalising the algorithm using the theory of operator algebras is discussed in the last chapter.</p
38 pages. Comments and remarks are welcome !This article is devoted to the study of products of rand...
This thesis is concerned with situations where we can define trace-class transfer oper- ators, and ...
This work considers quasi one-dimensional random Schrödinger and Dirac operators. They are described...
A recent paper by Pollicott in 2010 presented an efficient algorithm for computing the Lyapunov expo...
In a recent paper by M. Pollicott, an efficient algorithm was proposed, applying Ruelle's theory of ...
In this article we study the Lyapunov exponent for random matrix products of positive matrices and e...
We study the top Lyapunov exponents of random products of positive 2×2 matrices and obtain an effici...
In this note we describe estimates on the error when calculating the Lyaponov exponent for random pr...
We analyze the effect of finite memory on the Lyapunov exponent of products of random matrices by co...
We analyze the top Lyapunov exponent of the product of sequences of two by two matrices that appears...
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of rand...
We analyze the top Lyapunov exponent of the product of sequences of two by two matrices that appears...
We consider a certain infinite product of random 2 x 2 matrices appearing in the solution of some 1 ...
We give lower and upper bounds on both the Lyapunov exponent and generalised Lyapunov exponents for ...
In the study of random matrices, Lyapunov exponents characterize the rate of exponential growth of t...
38 pages. Comments and remarks are welcome !This article is devoted to the study of products of rand...
This thesis is concerned with situations where we can define trace-class transfer oper- ators, and ...
This work considers quasi one-dimensional random Schrödinger and Dirac operators. They are described...
A recent paper by Pollicott in 2010 presented an efficient algorithm for computing the Lyapunov expo...
In a recent paper by M. Pollicott, an efficient algorithm was proposed, applying Ruelle's theory of ...
In this article we study the Lyapunov exponent for random matrix products of positive matrices and e...
We study the top Lyapunov exponents of random products of positive 2×2 matrices and obtain an effici...
In this note we describe estimates on the error when calculating the Lyaponov exponent for random pr...
We analyze the effect of finite memory on the Lyapunov exponent of products of random matrices by co...
We analyze the top Lyapunov exponent of the product of sequences of two by two matrices that appears...
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of rand...
We analyze the top Lyapunov exponent of the product of sequences of two by two matrices that appears...
We consider a certain infinite product of random 2 x 2 matrices appearing in the solution of some 1 ...
We give lower and upper bounds on both the Lyapunov exponent and generalised Lyapunov exponents for ...
In the study of random matrices, Lyapunov exponents characterize the rate of exponential growth of t...
38 pages. Comments and remarks are welcome !This article is devoted to the study of products of rand...
This thesis is concerned with situations where we can define trace-class transfer oper- ators, and ...
This work considers quasi one-dimensional random Schrödinger and Dirac operators. They are described...