The Brownian limit of separable permutations
From MaRDI portal
Abstract: We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of any fixed given pattern in such a random permutation in terms of the Brownian excursion. In the recent terminology of permutons, our work can be interpreted as the convergence of uniform random separable permutations towards a "Brownian separable permuton".
Recommendations
- On the Brownian separable permuton
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
- Patterns in random permutations avoiding the pattern 321
- Patterns in random permutations avoiding the pattern 132
Cites work
- scientific article; zbMATH DE number 5831716 (Why is no real title available?)
- scientific article; zbMATH DE number 3722110 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 3366273 (Why is no real title available?)
- A singular mathematical promenade
- Area of Catalan paths on a checkerboard
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Brownian motion. With an appendix by Oded Schramm and Wendelin Werner
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Combinatorics of permutations
- Equipopularity classes in the separable permutations
- Expected patterns in permutation classes
- Finitely forcible graphons and permutons
- Foundations of Modern Probability
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Large deviations and ratio limit theorems for pattern-avoiding permutations
- Limits of permutation sequences
- Measure theory. Vol. I and II
- On the asymptotic statistics of the number of occurrences of multiple permutation patterns
- Pattern matching for permutations
- Pattern popularity in 132-avoiding permutations
- Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Patterns in permutations and words.
- Patterns in random permutations avoiding the pattern 132
- Permutation classes
- Random trees and applications
- Schröder's problems and scaling limits of random trees
- Simple permutations and pattern restricted permutations
- Structure of random \(312\)-avoiding permutations
- Surprising symmetries in objects counted by Catalan numbers
- The absence of a pattern and the occurrences of another
- The continuum random tree. III
- The expected shape of random doubly alternating Baxter permutations
- The shape of random pattern-avoiding permutations
Cited in
(34)- The skew Brownian permuton: A new universality class for random constrained permutations
- On the Brownian separable permuton
- Brownian motion for random permutations
- Fixed points of 321-avoiding permutations
- Independence of permutation limits at infinitely many scales
- Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes
- Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
- Permutations, signs and the Brownian bridge
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- A decorated tree approach to random permutations in substitution-closed classes
- Square permutations are typically rectangular
- The permuton limit of random recursive separable permutations
- Locally uniform random permutations with large increasing subsequences
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
- Almost square permutations are typically square
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Graphon convergence of random cographs
- Baxter permuton and Liouville quantum gravity
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons
- The feasible region for consecutive patterns of permutations is a cycle polytope
- The feasible regions for consecutive patterns of pattern-avoiding permutations
- Patterns in random permutations avoiding some sets of multiple patterns
- The infinite limit of separable permutations
- The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- The infinite limit of random permutations avoiding patterns of length three
- An algorithm computing combinatorial specifications of permutation classes
- Random cographs: Brownian graphon limit and asymptotic degree distribution
- Permutations encoding the local shape of level curves of real polynomials via generic projections
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Arcsine laws for random walks generated from random permutations with applications to genomics
- The feasible region for consecutive patterns of permutations is a cycle polytope
- Universal limits of substitution-closed permutation classes
This page was built for publication: The Brownian limit of separable permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660630)
