Random sorting networks: edge limit
From MaRDI portal
Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Recommendations
Cites work
- A pattern theorem for random sorting networks
- An Introduction to the Theory of Point Processes
- Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes
- Balanced tableaux
- Circular support in random sorting networks
- Geometry of permutation limits
- scientific article; zbMATH DE number 775283 (Why is no real title available?)
- scientific article; zbMATH DE number 3037624 (Why is no real title available?)
- On the number of reduced decompositions of elements of Coxeter groups
- Random sorting networks
- Random sorting networks: local statistics via random matrix laws
- The Anti-Symmetric GUE Minor Process
- The Archimedean limit of random sorting networks
- The Hook Graphs of the Symmetric Group
- The local limit of random sorting networks
This page was built for publication: Random sorting networks: edge limit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596225)