<p>We use an information-theoretic argument due to O’Connell (2000) to prove that every sufficiently symmetric event concerning a countably infinite family of independent and identically distributed random variables is deterministic (i.e., has a probability of either&#xa0;0 or&#xa0;1). The i.i.d. condition can be relaxed. This result encompasses the Hewitt–Savage zero–one law and the ergodicity of the Bernoulli process, but also applies to other scenarios such as infinite random graphs and simple renormalization processes.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Zero–One Laws for Events with Positional Symmetries

  • Yahya Ayach,
  • Anthony Khairallah,
  • Tia Manoukian,
  • Jad Mchaimech,
  • Adam Salha,
  • Siamak Taati

摘要

We use an information-theoretic argument due to O’Connell (2000) to prove that every sufficiently symmetric event concerning a countably infinite family of independent and identically distributed random variables is deterministic (i.e., has a probability of either 0 or 1). The i.i.d. condition can be relaxed. This result encompasses the Hewitt–Savage zero–one law and the ergodicity of the Bernoulli process, but also applies to other scenarios such as infinite random graphs and simple renormalization processes.