The Brownian limit of separable permutations

From MaRDI portal
Publication:1660630

DOI10.1214/17-AOP1223zbMath1430.60013arXiv1602.04960OpenAlexW2964253717MaRDI QIDQ1660630

Mathilde Bouvel, Adeline Pierrot, Frédérique Bassino, Valentin Féray, Lucas Gerin

Publication date: 16 August 2018

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04960



Related Items

Linear-sized independent sets in random cographs and increasing subsequences in separable permutations, 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, Square permutations are typically rectangular, Longest monotone subsequences and rare regions of pattern-avoiding permutations, Permutations encoding the local shape of level curves of real polynomials via generic projections, Graphon convergence of random cographs, The infinite limit of separable permutations, Random cographs: Brownian graphon limit and asymptotic degree distribution, The skew Brownian permuton: A new universality class for random constrained permutations, Baxter permuton and Liouville quantum gravity, Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons, Locally uniform random permutations with large increasing subsequences, Universal limits of substitution-closed permutation classes, Fixed points of 321-avoiding permutations, An algorithm computing combinatorial specifications of permutation classes, Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\), Patterns in random permutations avoiding some sets of multiple patterns, The feasible region for consecutive patterns of permutations is a cycle polytope, The feasible region for consecutive patterns of permutations is a cycle polytope, Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences, The Infinite limit of random permutations avoiding patterns of length three, Independence of permutation limits at infinitely many scales, On the Brownian separable permuton, A decorated tree approach to random permutations in substitution-closed classes, The feasible regions for consecutive patterns of pattern-avoiding permutations, Arcsine laws for random walks generated from random permutations with applications to genomics, The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton


Uses Software


Cites Work