Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
From MaRDI portal
Publication:2291695
DOI10.1007/s00440-019-00922-4zbMath1434.60035arXiv1807.02702OpenAlexW3103271968MaRDI QIDQ2291695
Publication date: 31 January 2020
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.02702
Related Items (13)
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 ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope ⋮ Independence of permutation limits at infinitely many scales ⋮ Almost square permutations are typically square ⋮ A decorated tree approach to random permutations in substitution-closed classes ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniqueness and universality of the Brownian map
- The Brownian map is the scaling limit of uniform random plane quadrangulations
- The shape of random pattern-avoiding permutations
- Surprising symmetries in objects counted by Catalan numbers
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
- Pattern-avoiding permutations and Brownian excursion. II: Fixed points
- Protected nodes and fringe subtrees in some random trees
- The continuum random tree. I
- A decorated tree approach to random permutations in substitution-closed classes
- Asymptotic fringe distributions for general families of random trees
- Limit of normalized quadrangulations: the Brownian map
- Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes)
- Subdiffusive behavior of random walk on a random cluster
- Tree-valued Markov chains derived from Galton-Watson processes
- Uniform infinite planar triangulations
- The Brownian limit of separable permutations
- Local limits of large Galton-Watson trees rerooted at a random vertex
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- Recurrence of distributional limits of finite planar graphs
- Dominos and the Gaussian free field.
- Limits of permutation sequences
- Universal limits of substitution-closed permutation classes
- Geometry of permutation limits
- The continuum random tree. III
- Gaussian free fields for mathematicians
- Classification of bijections between 321- and 132-avoiding permutations
- Square permutations are typically rectangular
- Structure of random 312-avoiding permutations
- Permutation classes
- A survey of consecutive patterns in permutations
- Random Measures, Theory and Applications
- The absence of a pattern and the number of occurrences of another
- Thermodynamic limit for the Mallows model on Sn
- The Wiener Index of simply generated random trees
- Convergence of graphs with intermediate density
- Fixed points of 321-avoiding permutations
- The probability of avoiding consecutive patterns in the Mallows distribution
- On the Brownian separable permuton
- Permutations with fixed pattern densities
- Patterns in random permutations avoiding the pattern 321
- Patterns in Random Permutations Avoiding the Pattern 132
- Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
- The Multiplicative Process
This page was built for publication: Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)