English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we study inference for chains of variable order under two distinct contamination regimes. Consider a chain of variable memory on a finite alphabet containing zero, at each instant of time an independent coin is flipped and if it turns head a contamination occurs. In the first regime a zero is read independently of the value of the chain. In the second regime, the value of another chain of variable memory is observed instead of the original one. Our results state that the difference between the transition probabilities of the original process and the corresponding ones of the contaminated process may be bounded above uniformly. Moreover, if the contamination probability is small enough, using a version of the Context algorithm we are able to recover the context tree of the original process through a contaminated sample.

Stochastically Perturbed Chains of Variable Memory