Global reversibility classification conjecture for involutive walks

From papers

Let PλP^\lambda be an n×nn\times n stochastic matrix of the form PλP^\lambda. Let J(n)J(n) denote the n×nn\times n matrix whose entries are all equal to 1/n1/n, and let the matrices in Theorem~ be the classified families of globally reversible involutive walks. Global reversibility conjecture. PλP^\lambda is reversible if and only if it is one of the matrices in that theorem, or Pλ=J(n)P^\lambda=J(n). This conjecture seeks to classify all stochastic matrices of the form PλP^\lambda that are reversible; the authors note that stochastic examples satisfying the detailed balance equations are known only with the stronger global reversibility property.

Progress summary

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

Sources & referencesView supporting material

Primary source

John R. Britnell and Mark Wildon, “Involutive random walks on total orders and the anti-diagonal eigenvalue property”, arXiv:2102.08469 (2021).

Solutions 0

No solutions have been posted yet.