ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be the transition matrix of a finite irreducible and reversible Markov chain. Let X,Y,ZX,Y,Z be independent continuous-time Markov chains with transition matrix PP and speeds λX=λY=1\lambda_X=\lambda_Y=1 and λZ=0\lambda_Z=0, and let MgoodM^{\rm good} and MbadM^{\rm bad} denote the corresponding good and bad meeting times. Universal one-third collision-before-trapping conjecture. The inequality

P ⁣(Mgood≤Mbad)≥13\mathbb{P}\!\left(M^{\rm good}\leq M^{\rm bad}\right)\geq \frac{1}{3}

holds for all such chains. This would extend the universal lower-bound phenomenon beyond transitive chains in the setting of Theorem; the source presents it as a concrete conjecture, and no resolution is given here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.