The initial-vertex conjecture for randomized zero forcing on complete bipartite graphs

Let $K_{a,b}$ be a bidirectional complete bipartite graph with all edges of equal weight, where $a>b$. Let $A$ and $B$ be its partite sets, with $|A|=a$ and $|B|=b$. For vertices $u\in A$ and $v\in B$, write $\operatorname{ept_{rzf}}(K_{a,b},\\{x\\})$ for the expected randomized zero-forcing propagation time when $x$ is the initial blue vertex. Initial-vertex conjecture.

$$\operatorname{ept_{rzf}}(K_{a,b},\\{v\\})<\operatorname{ept_{rzf}}(K_{a,b},\\{u\\}).$$

This claims that, when the two partite sets have unequal sizes, starting in the smaller part gives strictly smaller expected propagation time than starting in the larger part. The surrounding results establish order-of-growth bounds for complete bipartite graphs, but do not resolve this strict comparison.