Exponential inequalities for empirical unbounded context trees

Mathematics – Statistics Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages

Scientific paper

In this paper we obtain non-uniform exponential upper bounds for the rate of convergence of a version of the algorithm Context, when the underlying tree is not necessarily bounded. The algorithm Context is a well-known tool to estimate the context tree of a Variable Length Markov Chain. As a consequence of the exponential bounds we obtain a strong consistency result. We generalize in this way several previous results in the field.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Exponential inequalities for empirical unbounded context trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exponential inequalities for empirical unbounded context trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential inequalities for empirical unbounded context trees will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-14934

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.