We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We investigate some effects that the ‘light' trimming of a sum Sn = X1 + X2 + · ·· + Xn of independent and identically distributed random variables has on behaviour of iterated logarithm type. Light trimming is defined as removing a constant number of summands from Sn. We consider two versions: (r)Sn, which is obtained by deleting the r largest Xi from Sn, and , which is obtained by deleting the r variables Xi which are largest in absolute value from Sn. We summarise some relevant results from Rogozin (1968), Heyde (1969), and later writers concerning the untrimmed sum, and add some new results concerning trimmed sums. Among other things we show that a general form of the law of the iterated logarithm holds for but not (completely) for .
Let {Sn, n ≧ 1} be a zero, mean square integrable martingale for which so that Sn → S∞ a.s., say, by the martingale convergence theorem. The paper is principally concerned with obtaining central limit and iterated logarithm results for Bn(Sn – S∞) where the multipliers Bn ↑ ∞ a.s. An example on the Pólya urn scheme is given to illustrate the results.
A single realization {Zn, 0 ≦n≦N + 1} of a supercritical Galton-Watson process (so called) is considered and it is required to estimate the variance of the offspring distribution. A prospective estimator is proposed, where , and is shown to be strongly consistent on the non-extinction set. A central limit result and an iterated logarithm result are provided to give information on the rate of convergence of the estimator. It is also shown that the estimation results are robust in the sense that they continue to apply unchanged in the case where immigration occurs. Martingale limit theory is employed at each stage in obtaining the limit results.
Analogues of the central limit theorem and iterated logarithm law have recently been obtained for the Galton-Watson process; similar results are established in this paper for the temporally homogeneous Markov branching process and for the associated increasing process consisting of the number of splits in the original process up to time t.
The paper begins with an iterated logarithm law of classical Hartman-Wintner form for stationary martingales. This is then used to obtain iterated logarithm results giving information on rates of convergence of estimators of the parameters in a stationary autoregressive process. In the case of an autoregression of small order, detailed rate results for each autocorrelation and for the estimators of all parameters can be obtained. A rate result for the convergence of the sample mean is given in the general case.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.