omer angelalexander holroyd dan romikbalint virag math.pr/0609538 thanks to: nathanael berestycki,...
TRANSCRIPT
![Page 1: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/1.jpg)
Omer Angel Alexander Holroyd
Dan Romik Balint Virag
math.PR/0609538
Thanks to: Nathanael Berestycki,Alex Gamburd, Alan Hammond,Pawel Hitczenko, Martin Kassabov,Rick Kenyon, Scott Sheffield, David Wilson, Doron Zeilberger
Random Sorting Networks
Adv. in Math. 2007
![Page 2: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/2.jpg)
1234
![Page 3: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/3.jpg)
1234
4321
![Page 4: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/4.jpg)
1234
2134
4321
![Page 5: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/5.jpg)
1234
2134
2314
4321
![Page 6: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/6.jpg)
1234
2134
2314
2341
4321
![Page 7: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/7.jpg)
1234
2134
2314
2341
3241
4321
![Page 8: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/8.jpg)
1234
2134
2314
2341
3241
3421
4321
![Page 9: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/9.jpg)
1234
2134
2314
2341
3241
3421
4321
![Page 10: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/10.jpg)
1234
2134
2314
2341
3241
3421
4321
To get from 1n to n1requires
N:=
nearest-neighbour swaps
![Page 11: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/11.jpg)
1234
2134
2314
2341
3241
3421
4321
any route from 1n to n1in exactly
N:=
nearest-neighbour swaps
A Sorting Network =
E.g. n=4:
![Page 12: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/12.jpg)
Theorem (Stanley 1984). # of n-particle sorting networks =
Uniform Sorting Network (USN):choose an n-particle sorting networkuniformly at random.
E.g. n=3:
![Page 13: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/13.jpg)
1234
2134
2314
2341
3241
3421
4321
![Page 14: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/14.jpg)
1234
2134
2314
2341
3241
3421
4321
swaplocations
![Page 15: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/15.jpg)
1234
2134
2314
2341
3241
3421
4321
swaplocations
particletrajectory
![Page 16: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/16.jpg)
1234
2134
2314
2341
3241
3421
4321
swaplocations
particletrajectory
2341permutation matrix
(at half-time)
9 efficient simulation algorithm for USN...
1 2 3 4
![Page 17: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/17.jpg)
Swap locations, n=100
![Page 18: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/18.jpg)
Swap locations, n=2000
![Page 19: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/19.jpg)
1234
2134
2314
2341
3241
3421
4321
swaplocations
s1
=1
s2
=2
s3
=3
s4
=1
s5
=2
s6
=1
![Page 20: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/20.jpg)
Theorem: For USN:
1. Sequence of swap locations (s1,...,sN) is stationary
2. Scaled first swap location
3. Scaled swap process
as n!1
as n!1
8 n
(Note: not true for all sorting networks, e.g. bubble sort)
![Page 21: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/21.jpg)
In progress: Process of first k swapsin positions cn...cn+k
as n!1not depending on c2(0,1)
! random limit
![Page 22: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/22.jpg)
Proof of stationarity:
1234
2134
2314
2341
3241
3421
4321
![Page 23: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/23.jpg)
Proof of stationarity:
2134
2314
2341
3241
3421
4321
![Page 24: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/24.jpg)
Proof of stationarity:
1234
1324
1342
3142
3412
4312
![Page 25: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/25.jpg)
Proof of stationarity:
1234
1324
1342
3142
3412
4312
![Page 26: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/26.jpg)
Proof of stationarity:
1234
1324
1342
3142
3412
4312
4321
![Page 27: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/27.jpg)
Proof of stationarity:
1234
1324
1342
3142
3412
4312
4321
(s1,...,sN) (s2,...,sN,n-s1) is a bijectionfrom {sorting networks} to itself.
So for USN:
![Page 28: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/28.jpg)
Selected trajectories, n=2000
![Page 29: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/29.jpg)
Scaled trajectory of particle i:Ti:[0,1]![-1,1]
i
0 1-1
1
![Page 30: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/30.jpg)
Conjecture: trajectories ! random Sine curves:
as n!1
Theorem: scaled trajectories have subsequentiallimits which are a.s. Hölder(½).
as n!1
(random)
![Page 31: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/31.jpg)
Half-time permutation matrix, n=2000
animation
![Page 32: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/32.jpg)
Conjecture: scaled permutation matrix at time N/2
Archimedesmeasure
projection of surfacemeasure on S2 ½ R3 to R2
(unique circularly symmetric measurewith uniform linear projections;
on x2+y2<1 )
scaled permutation matrix at time tN
Arch.meas.
![Page 33: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/33.jpg)
Theorem: scaled permutation matrix at time tNis supported within a certain octagon w.h.p.
as n!1
(1-½p3-)n
![Page 34: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/34.jpg)
Some Proofs:
Key tools:
1. Bijection (Edelman-Greene 1987){sorting networks} $ {standard staircase
Young tableaux}
2. New result forprofile of random staircase Young tableau(deduced from Pittel-Romik 2006)
![Page 35: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/35.jpg)
Staircase Young diagram:
n-1
N cells
(E.g. n=5)
![Page 36: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/36.jpg)
Standard staircase Young tableau:
1 2
5 6
84
3
9
7 10
Fill with 1,,N so each row/col increasing
![Page 37: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/37.jpg)
Edelman-Greene algorithm:
1 2
5 6
84
3
9
7 10
1. Remove largest entry
![Page 38: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/38.jpg)
Edelman-Greene algorithm:
1 2
5 6
84
3
9
7
1. Remove largest entry
![Page 39: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/39.jpg)
Edelman-Greene algorithm:
1 2
5 6
84
3
9
7
2. Replace with larger of neighbours " Ã
![Page 40: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/40.jpg)
Edelman-Greene algorithm:
1 2
5 6
84
3
9
7
2. Replace with larger of neighbours " Ã
![Page 41: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/41.jpg)
Edelman-Greene algorithm:
1 2
5 6
84
3
9
7
2. Replace with larger of neighbours " Ã...repeat
![Page 42: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/42.jpg)
Edelman-Greene algorithm:
1
2
5 6
84
3
9
7
2. Replace with larger of neighbours " Ã...repeat
![Page 43: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/43.jpg)
Edelman-Greene algorithm:
1
2
5 6
84
3
9
7
3. Add 0 in top corner
0
![Page 44: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/44.jpg)
Edelman-Greene algorithm:
2
3
6 7
95
4
10
8
4. Increment
1
![Page 45: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/45.jpg)
Edelman-Greene algorithm:
2
3
6 7
95
4 8
5. Repeat everything...
1
![Page 46: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/46.jpg)
Edelman-Greene algorithm:
2
3
6 7
95
4
8
5. Repeat everything...
1
![Page 47: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/47.jpg)
Edelman-Greene algorithm:
2
3
6 7
95
4
8
5. Repeat everything...
1
![Page 48: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/48.jpg)
Edelman-Greene algorithm:
2
3
6 7
95
4
8
5. Repeat everything...
1
![Page 49: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/49.jpg)
Edelman-Greene algorithm:
2
3
6 7
95
4
8
5. Repeat everything...
1
0
![Page 50: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/50.jpg)
Edelman-Greene algorithm:
3
4
7 8
106
5
9
5. Repeat everything...
2
1
![Page 51: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/51.jpg)
Edelman-Greene algorithm:
3
4
7 8
6
5
9
5. Repeat everything...
2
1
![Page 52: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/52.jpg)
Edelman-Greene algorithm:
4
5
8 9
7
6
10
5. Repeat everything...
3
21
![Page 53: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/53.jpg)
Edelman-Greene algorithm:
4
5
8 9
7
6
5. Repeat everything...
3
21
![Page 54: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/54.jpg)
Edelman-Greene algorithm:
![Page 55: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/55.jpg)
Edelman-Greene algorithm:
etc
![Page 56: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/56.jpg)
Edelman-Greene Theorem:
After N steps,
45o
![Page 57: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/57.jpg)
Edelman-Greene Theorem:
After N steps,get swap processof a sorting network!
1 1 1 1 4 4 4 4 5 5 52 2 4 4 1 1 5 5 4 4 43 4 2 2 2 5 1 2 2 2 34 3 3 5 5 2 2 1 1 3 25 5 5 3 3 3 3 3 3 1 1
![Page 58: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/58.jpg)
Edelman-Greene Theorem:
After N steps,get swap processof a sorting network
And this is a bijection!
And can explicitly describe inverse!
![Page 59: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/59.jpg)
Theorem (Pittel-Romik): For a uniform randomn x n square tableau, 9 limiting shape with contours:
Corollary (AHRV): For uniform random staircase tableau, limiting shape is half of this.
(Proof uses Greene-Nijenhuis-Wilf Hook Walk)
![Page 60: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/60.jpg)
Proof of LLN (swap process ) semic. x Leb.)
Swaps in space-time window [an,bn]x[0,N]come from entries >(1-)N in tableau:
an
bn
entries exiting in [an,bn]
µ
µ
# ¼ area under contour ¼ semicircle
![Page 61: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/61.jpg)
Proof of octagon and Holder bounds
Inverse Edelman-Greene bijection(¼ RSK algorithm) )
# entries <k in 1st row
¸ longest % subseq. of swaps by time k
¸ furthest any particle moves up by time k
So can bound this usinglimit shape.
![Page 62: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/62.jpg)
Why do we believe the conjectures?
The permutahedron: embedding of Cayley graph (Sn, n.n. swaps) in Rn :
-1=(-1(1),...,-1(n))2Rn
n=4:
embedsin an(n-2)-sphere
n=5
![Page 63: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/63.jpg)
Theorem: If a non-random sorting networklies close to some great circle on the permutahedron, then:
1. Trajectories ¼ Sine curves
2. Half-time permutation ¼ Archimedesmeasure
3. Swap process ¼ semicircle x Lebesgue
![Page 64: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/64.jpg)
Theorem: If a non-random sorting networklies close to some great circle on the permutahedron, then:
1. Trajectories ¼ Sine curves
2. Half-time permutation ¼ Archimedesmeasure
3. Swap process ¼ semicircle x Lebesgue
o(n) in | |1Simulations suggestO(pn) for USN!
![Page 65: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/65.jpg)
Proof of Theorem:
close to great circle ) ¼ Sine trajectories (up to a time change), ¼ rotating disc
calculation ) semicircle law
swap rate uniform ) rotation uniform
) no time change
projections uniform ) ¼ Archimedes
![Page 66: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/66.jpg)
Stretchable sorting network:
1
2
34
(, rotating disc)
USN not stretchable w.h.p. as n!1
Main conj. ) - USN “¼ stretchable” w.h.p. - sub-network of k random
items is stretchable w.h.p.
12
3
4
![Page 67: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/67.jpg)
N.B. Not every sorting network lies close toa great circle! E.g. typical network through
n/2...1n...
n/2+1
1...
n/2n/2+1
...n
n...
n/2+1n/2...1
USN
USN
(But this permutation is very unlikely).
![Page 68: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/68.jpg)
Uniform swap model...
![Page 69: Omer AngelAlexander Holroyd Dan RomikBalint Virag math.PR/0609538 Thanks to: Nathanael Berestycki, Alex Gamburd, Alan Hammond, Pawel Hitczenko, Martin](https://reader036.vdocuments.us/reader036/viewer/2022070305/551475e3550346494e8b62d2/html5/thumbnails/69.jpg)