Conditional limit theorem for products of random matrices

1995 ◽  
Vol 186 (3) ◽  
pp. 371-389 ◽  
Author(s):  
A V Letchikov
Author(s):  
Amos Golan

In this chapter I provide additional rationalization for using the info-metrics framework. This time the justifications are in terms of the statistical, mathematical, and information-theoretic properties of the formalism. Specifically, in this chapter I discuss optimality, statistical and computational efficiency, sufficiency, the concentration theorem, the conditional limit theorem, and the concept of information compression. These properties, together with the other properties and measures developed in earlier chapters, provide logical, mathematical, and statistical justifications for employing the info-metrics framework.


2007 ◽  
Vol 44 (03) ◽  
pp. 753-769 ◽  
Author(s):  
S. V. Nagaev ◽  
V. Wachtel

In this paper we prove a conditional limit theorem for a critical Galton-Watson branching process {Z n ; n ≥ 0} with offspring generating function s + (1 − s)L((1 − s)−1), where L(x) is slowly varying. In contrast to a well-known theorem of Slack (1968), (1972) we use a functional normalization, which gives an exponential limit. We also give an alternative proof of Sze's (1976) result on the asymptotic behavior of the nonextinction probability.


1976 ◽  
Vol 13 (3) ◽  
pp. 444-454 ◽  
Author(s):  
P. J. Green

For a left-continuous random walk, absorbing at 0, the joint distribution of the maximum and time to absorption is derived. A description of the tails of the distributions and a conditional limit theorem are obtained for the cases where absorption is certain.


2008 ◽  
Vol 56 (2) ◽  
pp. 183-211
Author(s):  
Rolando Cavazos-Cadena ◽  
Daniel Hernández-Hernández

Sign in / Sign up

Export Citation Format

Share Document