Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
From MaRDI portal
Abstract: Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study the scaling limits of a random permutation avoiding a pattern of length 3 and their relations to Brownian excursion. Exploring this connection to Brownian excursion allows us to strengthen the recent results of Madras and Pehlivan, and Miner and Pak as well as to understand many of the interesting phenomena that had previously gone unexplained.
Recommendations
Cites work
- A variant of the tandem duplication-random loss model of genome rearrangement
- An invariance principle for random walk conditioned by a late return to zero
- Asymptotic theory of characters of the symmetric group
- Bijections for refined restricted permutations
- Brownian motion. With an appendix by Oded Schramm and Wendelin Werner
- Conditional limit theorems for branching processes
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Fixed points and excedances in restricted permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Longest increasing subsequences in pattern-restricted permutations
- Multiple pattern avoidance with respect to fixed points and excedances
- On the distribution of the length of the longest increasing subsequence of random permutations
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Permutations with restricted patterns and Dyck paths
- Restricted permutations, continued fractions, and Chebyshev polynomials
- Schröder's problems and scaling limits of random trees
- Some combinatorial properties of Schubert polynomials
- Sorting Using Networks of Queues and Stacks
- Structure of random 312-avoiding permutations
- Symmetric functions and P-recursiveness
- Tableaux combinatorics for the asymmetric exclusion process
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- The shape of random pattern-avoiding permutations
Cited in
(27)- The Brownian limit of separable permutations
- Sorting probability of Catalan posets
- Almost square permutations are typically square
- Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Universal limits of substitution-closed permutation classes
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- Square permutations are typically rectangular
- The runsort permuton
- The shape of random pattern-avoiding permutations
- Fixed points of 321-avoiding permutations
- On the Brownian separable permuton
- Patterns in random permutations avoiding some other patterns
- Arcsine laws for random walks generated from random permutations with applications to genomics
- Large deviations for permutations avoiding monotone patterns
- A view from the bridge spanning combinatorics and probability
- The infinite limit of random permutations avoiding patterns of length three
- Patterns in random permutations avoiding the pattern 321
- An algorithm computing combinatorial specifications of permutation classes
- Patterns in random permutations avoiding the pattern 132
- A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Combinatorial exploration: an algorithmic framework for enumeration
- First-order convergence for 321-avoiding permutations
- A decorated tree approach to random permutations in substitution-closed classes
- Exchangeable interval hypergraphs and limits of ordered discrete structures
This page was built for publication: Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739096)
