Open Access
February 2003 Wavelet analysis of conservative cascades
Sidney Resnick, Gennady Samorodnitsky, Anna Gilbert, Walter Willinger
Author Affiliations +
Bernoulli 9(1): 97-135 (February 2003). DOI: 10.3150/bj/1068129012


A conservative cascade is an iterative process that fragments a given set into smaller and smaller pieces according to a rule which preserves the total mass of the initial set at each stage of the construction almost surely and not just in expectation. Motivated by the importance of conservative cascades in analysing multifractal behaviour of measured Internet traffic traces, we consider wavelet-based statistical techniques for inference about the cascade generator, the random mechanism determining the redistribution of the set's mass at each iteration. We provide two estimators of the structure function, one asymptotically biased and one not, and prove consistency and asymptotic normality in a range of values of the argument of the structure function less than a critical value. Simulation experiments illustrate the asymptotic properties of these estimators for values of the argument both below and above the critical value. Beyond the critical value, the estimators are shown not to be asymptotically consistent.


Download Citation

Sidney Resnick. Gennady Samorodnitsky. Anna Gilbert. Walter Willinger. "Wavelet analysis of conservative cascades." Bernoulli 9 (1) 97 - 135, February 2003.


Published: February 2003
First available in Project Euclid: 6 November 2003

zbMATH: 1020.62075
MathSciNet: MR1963674
Digital Object Identifier: 10.3150/bj/1068129012

Keywords: asymptotic normality , conservative cascade , consistency , generator , Internet , martingale , MKP condition , Multifractals , networks , protocols , structure function , Wavelets

Rights: Copyright © 2003 Bernoulli Society for Mathematical Statistics and Probability

Vol.9 • No. 1 • February 2003
Back to Top