Non-Markovian jumping process conjecture for the birth Mallows process
Non-Markovian jumping process conjecture for the birth Mallows process
Let , and let be the birth Mallows process. If are its jump times, its jumping process is . Non-Markovian jumping-process conjecture. For every , the jumping process of the birth Mallows process is not a Markov chain. The source says that computations for small support this claim, but that no formal proof is available.
Progress summary
The conjecture remains unproved: small computations support the claim that the jump sequence is not Markovian in dimensions four and higher.
The conjecture asserts that, for every , the sequence of permutations observed at the successive jumps of the birth Mallows process is not a Markov chain. A 2022 paper records the conjecture and explicitly says that no formal proof was available.
Known results
- Computations for small values of support non-Markovianity, but do not establish the conjecture (2022).
- The birth Mallows process is identified as the unique regular Mallows process that is Markov; this does not settle the Markov property of its embedded jumping process (2022).
Current status (as of August 2026): The conjecture is open for every ; only computational evidence is recorded, and no formal proof or counterexample has been publicly verified.
Sources
Sources & referencesView supporting material
Primary source
Benoît Corsini, “Continuous-time Mallows processes”, arXiv:2205.04967 (2022).
Solutions 1
Sign in to submit a solution.
Proof for every . Write
By the source's independent inversion-coordinate construction, the birth Mallows process corresponds bijectively to independent unit-birth processes with
Let be the history in which the first two global jumps occur in coordinates , and the reverse history. Both have positive probability and end at the identical state
If denotes the second jump time, independence gives the unnormalized history-time densities
Their ratio is
Palindromicity of gives
Therefore
Consequently the normalization ratio
satisfies . Moreover is strictly increasing on , and for . Hence changes sign exactly once, from negative to positive. The two conditional time distributions therefore satisfy strict stochastic ordering:
Now consider the future embedded-chain event
Jumps in all other coordinates can be ignored. The two competing birth rates are
A direct calculation yields
Thus is strictly decreasing. If is the first ring of these two clocks after time , then
For , splitting at gives
Since for , this identity implies . Thus is strictly decreasing.
Applying this to the strict stochastic ordering (1),
The two histories reach the same state at the same jump index, yet yield different conditional probabilities for a future event determined entirely by the jumping chain. This contradicts the Markov property. Therefore the jumping process is not a Markov chain for every .
Source: Benoît Corsini, Continuous-time Mallows processes, Conjecture 3, §4.2, https://arxiv.org/abs/2205.04967.