Optimal Sampling Strategies for Multiscale Stochastic Processes


Journal PaperThis paper studies multiscale stochastic processes which are random processes organized on the nodes of a tree. The random variables at different levels on the tree represent time series of samples of a stochastic process at different temporal or spatial cales. We focus on classes of multiscale processes with additional statistical structure connecting scales and seek an optimal linear estimator of coarse scale nodes using an incomplete set of nodes at a finer time scale. We prove that the optimal solution for any tree with so-called independent innovations is readily given by a polynomial-time algorithm which we term the water-filling algorithm. The optimal solutions vary dramatically with the correlation structure of the multiscale process. For so-called scale-invariant trees and processes with positive correlation progression through scales, uniformly spaced leaves are optimal and clustered leaves are the worst possible. For processes with negative correlation progression, uniformly spaced leaves are the worst possible. Our results have implications for network traffic estimation, sensor network design, and environmental monitoring.Texas InstrumentsDefense Advanced Research Projects AgencyNational Science Foundatio

Similar works

This paper was published in DSpace at Rice University.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.