Local convergence for permutations and local limits for uniform -avoiding permutations with | |=3
From MaRDI portal
Publication:2291695
Abstract: We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a notion of "shift-invariant" property (corresponding to the notion of unimodularity for random graphs). We then study two models in the framework of random pattern-avoiding permutations. We compute the local limits of uniform -avoiding permutations, for when the size of the permutations tends to infinity. The core part of the argument is the description of the asymptotics of the number of consecutive occurrences of any given pattern. For this result we use bijections between -avoiding permutations and rooted ordered trees, local limit results for Galton--Watson trees, the Second moment method and singularity analysis.
Recommendations
- The infinite limit of random permutations avoiding patterns of length three
- The shape of random pattern-avoiding permutations
- Patterns in random permutations avoiding the pattern 321
- Patterns in random permutations avoiding some other patterns
- Patterns in random permutations avoiding the pattern 132
Cites work
- A decorated tree approach to random permutations in substitution-closed classes
- A survey of consecutive patterns in permutations
- Analytic combinatorics
- Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
- Asymptotic fringe distributions for general families of random trees
- Classification of bijections between 321- and 132-avoiding permutations
- Convergence of graphs with intermediate density
- Dominos and the Gaussian free field.
- Fixed points of 321-avoiding permutations
- Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
- Gaussian free fields for mathematicians
- Geometry of permutation limits
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 563055 (Why is no real title available?)
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Large networks and graph limits
- Limit of normalized quadrangulations: the Brownian map
- Limits of permutation sequences
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- Local limits of large Galton-Watson trees rerooted at a random vertex
- On the Brownian separable permuton
- Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Patterns in random permutations avoiding some other patterns
- Patterns in random permutations avoiding the pattern 132
- Patterns in random permutations avoiding the pattern 321
- Permutation classes
- Permutations with fixed pattern densities
- Protected nodes and fringe subtrees in some random trees
- Random measures, theory and applications
- Recurrence of distributional limits of finite planar graphs
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Square permutations are typically rectangular
- Structure of random 312-avoiding permutations
- Subdiffusive behavior of random walk on a random cluster
- Surprising symmetries in objects counted by Catalan numbers
- The absence of a pattern and the occurrences of another
- The Brownian limit of separable permutations
- The Brownian map is the scaling limit of uniform random plane quadrangulations
- The continuum random tree. I
- The continuum random tree. III
- The Multiplicative Process
- The probability of avoiding consecutive patterns in the Mallows distribution
- The shape of random pattern-avoiding permutations
- The Wiener Index of simply generated random trees
- Thermodynamic limit for the Mallows model on S_n
- Tree-valued Markov chains derived from Galton-Watson processes
- Uniform infinite planar triangulations
- Uniqueness and universality of the Brownian map
- Universal limits of substitution-closed permutation classes
Cited in
(18)- Limits of permutation sequences
- Independence of permutation limits at infinitely many scales
- Almost square permutations are typically square
- The feasible regions for consecutive patterns of pattern-avoiding permutations
- Quenched law of large numbers and quenched central limit theorem for multiplayer leagues with ergodic strengths
- Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes
- Statistical enumeration of groups by double cosets
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Square permutations are typically rectangular
- The runsort permuton
- The feasible region for consecutive patterns of permutations is a cycle polytope
- The feasible region for consecutive patterns of permutations is a cycle polytope
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
- On pattern-avoiding permutons
- Grothendieck shenanigans: permutons from pipe dreams via integrable probability
- The global and local limit of the continuous-time Mallows process
- A decorated tree approach to random permutations in substitution-closed classes
This page was built for publication: Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291695)
