pith. sign in

arxiv: math/0508607 · v1 · submitted 2005-08-30 · 🧮 math.ST · stat.TH

Approximating a sequence of observations by a simple process

classification 🧮 math.ST stat.TH
keywords sequencegivenprocessapproximatingempiricalfiniteobservationsone-step
0
0 comments X
read the original abstract

Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step transitions along a realization from the approximating process, are close to that of the given sequence. We generalize the result to the case where the one-step transitions are required to be in given polyhedra.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.