<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06074591</id>
  <dt>j</dt>
  <an>06074591</an>
  <augroup>
    <au>Davie, George</au>
  </augroup>
  <ti>Constraints placed on random sequences by their compressibility.</ti>
  <so>Stat. Probab. Lett. 82, No. 7, 1474-1478 (2012).</so>
  <py>2012</py>
  <pu>Elsevier Science B.V. (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>algorithmically random sequence</ut>
    <ut>compressibility</ut>
    <ut>probability laws</ut>
    <ut>large deviations</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.spl.2012.04.009</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In a previous paper, we showed how the compressibility of an (algorithmically) random sequence sets upper bounds for events taking place in such sequences. In this paper, we show that the compressibility also determines allowed and forbidden regions for such events to occur.</ab>
    <rv></rv>
  </abgroup>
</item>