Permutation-process convergence to the Archimedean process
Let be a uniformly random sorting network of , regarded as a permutation process, and let be the Archimedean process defined by , with distributed according to the Archimedean measure.
Archimedean process convergence conjecture. converges in probability, as a permutation process, to the Archimedean process.
This conjecture combines the expected Archimedean path and sine-curve behavior into a process-level convergence statement.
References
Status
- Solved: Duncan Dauvergne. The Archimedean limit of random sorting networks (arXiv, 2018) https://arxiv.org/html/1802.08934v4
Source: Mustazee Rahman, Balint Virag and Mate Vizer, “Geometry of Permutation Limits”, arXiv:1609.03891 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.