Right-eigenvalue conjecture for the context-tree matrix
Right-eigenvalue conjecture for the context-tree matrix
Let a probabilised context tree be given, with associated square matrix , and let denote the set of alpha-LIS objects. For each , let be the associated sequence.
Right-eigenvalue conjecture. If, for every , the sequence converges to , then admits as a right eigenvalue.
When the context tree is stable, the matrix 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.