Tag Archives: Random sorting networks

Duncan Dauvergne and Bálint Virág Settled the Random Sorting Networks Conjectures

Posted on May 20, 2018 by

A short summary: The beautiful decade-old conjectures on random sorting networks by  Omer Angel, Alexander Holroyd, Dan Romik, and Bálint Virág, have now been settled by Duncan Dauvergne and Bálint Virág in two papers: Circular support in random sorting networks, by Dauvergne … Continue reading →

Posted in Combinatorics, Probability, Updates | Tagged , , | 2 Comments