Tag Archives: Random sorting networks

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

Posted on May 20, 2018 by Gil Kalai

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 Bálint Virág, Dubcan Dauvergne, Random sorting networks | 2 Comments

	fanzheng1729 on A sensation in the morning new…
	Shtetl-Optimized… on A sensation in the morning new…
	AllThings.GO on Is it Legitimate/Ethical for G…
	Gil Kalai on TYI38 Lior Kalai: Monty Hall M…
	Answer to TYI 37: Ar… on Which Coalition to Form (…
	Answer to TYI 37: Ar… on Which Coalition?
	Answer to TYI 37: Ar… on Test Your Intuition (or simply…
	Yuval Peres on Answer to TYI 37: Arithmetic P…
	Gil Kalai on Henry Cohn, Abhinav Kumar, Ste…
	Gil Kalai on A sensation in the morning new…
	yaroslav shitov on A sensation in the morning new…
	Anon80 on A sensation in the morning new…

Tag Archives: Random sorting networks

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives