The following pages link to Random sorting networks (Q2383011):
Displaying 43 items.
- A pattern theorem for random sorting networks (Q392684) (← links)
- Relating Edelman-Greene insertion to the Little map (Q472627) (← links)
- Constructing sorting networks from k-sorters (Q582119) (← links)
- Periodic Pólya urns, the density method and asymptotics of Young tableaux (Q782409) (← links)
- Random subnetworks of random sorting networks (Q976676) (← links)
- A combinatorial version of Sylvester's four-point problem (Q990768) (← links)
- The oriented swap process (Q1035867) (← links)
- Perfect shuffling by lazy swaps (Q1663759) (← links)
- The local limit of random sorting networks (Q1731150) (← links)
- On collisions times of `self-sorting' interacting particles in one-dimension with random initial positions and velocities (Q1753881) (← links)
- Random generation and scaling limits of fixed genus factorizations into transpositions (Q2099811) (← links)
- Absorbing time asymptotics in the oriented swap process (Q2134282) (← links)
- Milnor invariants of sorting networks (Q2163425) (← links)
- Sorting networks, staircase Young tableaux, and last passage percolation (Q2199826) (← links)
- Random sorting networks: local statistics via random matrix laws (Q2273593) (← links)
- A symplectic refinement of shifted Hecke insertion (Q2305998) (← links)
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees (Q2323049) (← links)
- Geometry of permutation limits (Q2338620) (← links)
- Jeu de taquin dynamics on infinite Young tableaux and second class particles (Q2338913) (← links)
- The runsort permuton (Q2672956) (← links)
- The maximum multiplicity of a generator in a reduced word (Q2680963) (← links)
- Large deviations for the interchange process on the interval and incompressible flows (Q2682946) (← links)
- Shift-invariance of the colored TASEP and finishing times of the oriented swap process (Q2684531) (← links)
- Second class particles and limit shapes of evacuation and sliding paths for random tableaux. (Q2695704) (← links)
- Representing permutations with few moves (Q2827490) (← links)
- Geodesics and almost geodesic cycles in random regular graphs (Q3081309) (← links)
- Periodic P\'olya urns and an application to Young tableaux (Q4993533) (← links)
- A generalization of balanced tableaux and marriage problems with unique solutions (Q5013350) (← links)
- Random stable-type minimal factorizations of the <i>n</i>-cycle (Q5066873) (← links)
- The Archimedean limit of random sorting networks (Q5096125) (← links)
- Circular support in random sorting networks (Q5217874) (← links)
- Trajectories in random minimal transposition factorizations (Q5742626) (← links)
- Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings (Q5886333) (← links)
- On random shifted standard Young tableaux and 132-avoiding sorting networks (Q5919058) (← links)
- On random shifted standard Young tableaux and 132-avoiding sorting networks (Q5919523) (← links)
- Properties of the Edelman-Greene bijection (Q5925201) (← links)
- Diffuse scattering on graphs (Q5965387) (← links)
- The oriented swap process and last passage percolation (Q6074699) (← links)
- Bijecting hidden symmetries for skew staircase shapes (Q6088388) (← links)
- Ungarian Markov chains (Q6136831) (← links)
- Random sorting networks: edge limit (Q6596225) (← links)
- Underlying flag polymatroids (Q6608017) (← links)
- Repeatable patterns and the maximum multiplicity of a generator in a reduced word (Q6615533) (← links)
