Right-eigenvalue conjecture for the context-tree matrix

Let a probabilised context tree be given, with associated square matrix QQ, and let S{\mathscr S} denote the set of alpha-LIS objects. For each αsS\alpha s\in{\mathscr S}, let (καs(n))n\left(\kappa_{\alpha s}(n)\right)_n be the associated sequence.

Right-eigenvalue conjecture. If, for every αsS\alpha s\in{\mathscr S}, the sequence (καs(n))n\left(\kappa_{\alpha s}(n)\right)_n converges to 00, then QQ admits 11 as a right eigenvalue.

When the context tree is stable, the matrix QQ is stochastic under the same vanishing condition. The conjecture asks whether the right eigenvalue still exists without stability; together with the stated correspondence between right eigenvectors and invariant measures, it would imply existence of an invariant probability measure when the set of alpha-LIS is finite and all cascade series converge.

Sources & referencesView supporting material

Primary source

Peggy Cénac, Brigitte Chauvin, Camille Noûs, Frédéric Paccaut and Nicolas Pouyanne, “Variable Length Memory Chains: characterization of stationary probability measures”, arXiv:2004.07893 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.