I want to estimate the maximum value, which was expected not reacchable, of a time series. the distribution of samples in a interval was unknown. It can be conclude from pdf figures that those samples are in the same distribution with different parameters, that would change slowly. Is there any theorically proved method for that?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
You can see P[Mn<=x]=P[X<=x]^n for the iid case that the maximum's distribution can be derived from the distribution for individual observation. Similar formulaes can be derived for the other order statistics. H. A. David's book on orde statistics is a good source for this. In the dependent case there is no easy way. I did research in the case of stationary autoregressive processes and could not find a nice exact formula. To prove limit theorems there are inequalties that can be used and mixing conditions can be verified to prove limit theorem's. Gnedenko's theorem is for extremes what the central limit theorem is for averages. It can be used to justify modeling extremes using an extreme value type since in large samples the distribution for the maximum is close to that extreme type for a large class of of population distributions F. Unfortunately the correlated case is much more difficult. In some dependent cases you can get the limit distirbution to exist and not be an extreme value type (when mixing conditions fail) See Galambos' book on extremes for an example of this.
If you are interested in the limiting distribution of the maximum of a sequence of iid random variables and you know something about the tail behavior of the distribution, Gnedenko's theorem will tell you (if the limit exists) how to normalize the maximum term in the sequence so that it converges to one fo the three extreme value types and which one it converges to. In your case you know there is a finite upper bound on the maximum. So the answer for the limiting distribution would be type III. The theorem extends to stationary time series under special conditions called mixing conditions. This theory can be found for example in "Extremes and Related properties of Random Sequences and Processes by Leadbetter, Lindgren and Rootzen (1983) Springer-Verlag. this theory may help with your problem although not directly. In the iid case let X1, X2,...,Xn be an iid sequence with Mn representing the maximum of these n values. You can use by independence P[Mn<=x]=P[X1<=x] P[X2<=x]...P[Xn<=x] and since they are identically distributed this is equal to P[X1<=x]$^n$. So take for example X1 uniform on [0, A]. Then P[Mn<=x] = x$^n$/A$^n$ for x < A this will go to zero as n tends to infinity showing that Mn is converging to A in probability. So P[Mn>x]=1-x$^n$ /A$^n$ . This tells you exactly probability that Mn is between x and A for any x < A. So for very large n and assuming x is within a small value say e of A (i. e. x=A-e) you have a very high probability that Mn will be larger than A-e.