Abstract
We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of 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 \(\rho \)-avoiding permutations, for \(|\rho |=3,\) 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 \(\rho \)-avoiding permutations and rooted ordered trees, local limit results for Galton–Watson trees, the Second moment method and singularity analysis.
This is a preview of subscription content, access via your institution.






















References
Abraham, R., Delmas, J.-F.: An introduction to Galton–Watson trees and their local limits. ArXiv preprint: arXiv:1506.05571 (2015)
Aldous, D.: Asymptotic fringe distributions for general families of random trees. Ann. Appl. Probab. 1(2), 228–266 (1991)
Aldous, D.: The continuum random tree I. Ann. Probab. 19(1), 1–28 (1991)
Aldous, D.: The continuum random tree II: an overview. Stoch. Anal. 167, 23–70 (1991)
Aldous, D.: The continuum random tree III. Ann. Probab. 21(1), 248–289 (1993)
Aldous, D., Pitman, J.: Tree-valued Markov chains derived from Galton–Watson processes. In: Annales de l’Institut Henri Poincare (B) Probability and Statistics, vol. 34, pp. 637–686. Elsevier, Amsterdam (1998)
Aldous, D., Steele, J.M.: The objective method: probabilistic combinatorial optimization and local weak convergence. In: Probability on Discrete Structures, pp. 1–72. Springer, Berlin (2004)
Angel, O., Schramm, O.: Uniform infinite planar triangulations. Commun. Math. Phys. 241(2–3), 191–213 (2003)
Bassino, F., Bouvel, M., Féray, V., Gerin, L., Maazoun, M., Pierrot, A.: Universal limits of substitution-closed permutation classes. J. Eur. Math. Soc. ArXiv preprint: arXiv:1706.08333 (2017)
Bassino, F., Bouvel, M., Féray, V., Gerin, L., Pierrot, A.: The Brownian limit of separable permutations. Ann. Probab. 46(4), 2134–2189 (2018)
Benjamini, I., Schramm, O.: Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6(23), 13 (2001). https://doi.org/10.1214/EJP.v6-96
Bertoin, J., Pitman, J.: Path transformations connecting Brownian bridge, excursion and meander. Bull. des Sci. Math. 118(2), 147–166 (1994)
Billingsley, P.: Probability and Measure. Wiley, London (2008)
Billingsley, P.: Convergence of Probability Measures. Wiley, London (2013)
Bóna, M.: The absence of a pattern and the occurrences of another. Discrete Math. Theor. Comput. Sci. 12(2), 89–102 (2010)
Bóna, M.: Surprising symmetries in objects counted by Catalan numbers. Electron. J. Comb. 19(1), 62 (2012)
Bóna, M.: Combinatorics of Permutations. Chapman and Hall/CRC, London (2016)
Borga, J., Bouvel, M., V. Féray, Stufler, B.: A decorated tree approach to random permutations in substitution-closed classes. ArXiv preprint: arXiv:1904.07135 (2019)
Borga, J., Slivken, E.: Square permutations are typically rectangular. ArXiv preprint: arXiv:1904.03080 (2019)
Claesson, A., Kitaev, S.: Classification of bijections between 321-and 132-avoiding permutations. Sém. Lothar. de Combin. 60, B60d (2008)
Crane, H., DeSalvo, S., Elizalde, S.: The probability of avoiding consecutive patterns in the Mallows distribution. Random Struct. Algorithms 53(3), 417–447 (2018). https://doi.org/10.1002/rsa.20776
Devroye, L., Janson, S.: Protected nodes and fringe subtrees in some random trees. Electron. Commun. Probab. 19(6), 10 (2014). https://doi.org/10.1214/ECP.v19-3048
Elizalde, S.: A survey of consecutive patterns in permutations. In: Recent Trends in Combinatorics, pp. 601–618. Springer, Berlin (2016)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
Frenkel, P.: Convergence of graphs with intermediate density. Trans. Am. Math. Soc. 370(5), 3363–3404 (2018)
Hoffman, C., Rizzolo, D., Slivken, E.: Pattern-avoiding permutations and Brownian excursion part I: shapes and fluctuations. Random Struct. Algorithms 50(3), 394–419 (2017)
Hoffman, C., Rizzolo, D., Slivken, E.: Pattern-avoiding permutations and Brownian excursion, part II: fixed points. Probab. Theory Relat. Fields 169(1–2), 377–424 (2017)
Hoffman, C., Rizzolo, D., Slivken, E.: Fixed points of 321-avoiding permutations. Proc. Am. Math. Soc. 147(2), 861–872 (2019)
Holmgren, C., Janson, S.: Fringe trees, Crump–Mode–Jagers branching processes and \(m\)-ary search trees. Probab. Surv. 14, 53–154 (2017)
Hoppen, C., Kohayakawa, Y., Moreira, C.G., Ráth, B., Sampaio, R.M.: Limits of permutation sequences. J. Comb. Theory Ser. B 103(1), 93–113 (2013)
Janson, S.: The Wiener index of simply generated random trees. Random Struct. Algorithms 22(4), 337–358 (2003)
Janson, S.: Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation. Probab. Surv. 9, 103–252 (2012)
Janson, S.: Patterns in random permutations avoiding the pattern 132. Comb. Probab. Comput. 26(1), 24–51 (2017)
Janson, S.: Patterns in random permutations avoiding some sets of multiple patterns. ArXiv preprint: arXiv:1804.06071 (2018)
Janson, S.: Patterns in random permutations avoiding the pattern 321. Random Struct. Algorithms (2018)
Kallenberg, O.: Random Measures, Theory and Applications. Springer, Berlin (2017)
Kenyon, R.: Dominos and the Gaussian free field. Ann. Probab. 29(3), 1128–1137 (2001). https://doi.org/10.1214/aop/1015345599
Kenyon, R., Kral, D., Radin, C., Winkler, P.: Permutations with fixed pattern densities. ArXiv preprint: arXiv:1506.02340 (2015)
Kesten, H.: Subdiffusive behavior of random walk on a random cluster. Ann. Inst. H. Poincaré Probab. Stat. 22(4), 425–487 (1986)
Krikun, M.: Local structure of random quadrangulations. ArXiv preprint: arXiv:math/0512304 (2005)
Le Gall, J.-F.: Uniqueness and universality of the Brownian map. Ann. Probab. 41(4), 2880–2960 (2013)
Lovász, L.: Large Networks and Graph Limits, vol. 60. American Mathematical Society, Providence (2012)
Maazoun, M.: On the Brownian separable permuton. ArXiv preprint: arXiv:1711.08986 (2017)
Madras, N., Pehlivan, L.: Structure of random 312-avoiding permutations. Random Struct. Algorithms 49(3), 599–631 (2016)
Marckert, J.-F., Mokkadem, A.: Limit of normalized quadrangulations: the Brownian map. Ann. Probab. 34(6), 2144–2202 (2006)
Miermont, G.: The Brownian map is the scaling limit of uniform random plane quadrangulations. Acta Math. 210(2), 319–401 (2013)
Miner, S., Pak, I.: The shape of random pattern-avoiding permutations. Adv. Appl. Math. 55, 86–130 (2014)
Neveu, J.: Arbres et processus de Galton–Watson. Ann. de l’Inst. Henri Poincaré. Probab. et Stat. 22(2), 199–207 (1986)
Otter, R.: The multiplicative process. Ann. Math. Stat. 20, 206–224 (1949). https://doi.org/10.1214/aoms/1177730031
Pinsky, R.: The infinite limit of random permutations avoiding patterns of length three. ArXiv preprint: arXiv:1806.07669 (2018)
Rahman, M., Virag, B., Vizer, M.: Geometry of permutation limits. ArXiv preprint: arXiv:1609.03891 (2016)
Sheffield, S.: Gaussian free fields for mathematicians. Probab. Theory Relat. Fields 139(3–4), 521–541 (2007)
Starr, S.: Thermodynamic limit for the Mallows model on \({S}_n\). J. Math. Phys. 50(9), 095208 (2009)
Stephenson, R.: Local convergence of large critical multi-type Galton–Watson trees and applications to random maps. J. Theor. Probab. 31(1), 159–205 (2018)
Stufler, et al. B.: Local limits of large Galton–Watson trees rerooted at a random vertex. In: Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 55, pp. 155–183. Institut Henri Poincaré (2019)
Vatter, V.: Permutation classes. In: Handbook of Enumerative Combinatorics, Discrete Math. Appl. (Boca Raton), pp. 753–833. CRC Press, Boca Raton (2015)
Acknowledgements
The author is very grateful to Mathilde Bouvel and Valentin Féray for introducing him to the fantastic world of random permutations. He also thanks them for the constant and stimulating discussions and suggestions. The author also warmly thanks Benedikt Stufler for precious suggestions about the terminology for Benjamini–Schramm convergence and for some explanations about local results for random trees. Finally, he thanks Tommaso Padovan for precious help in the realization of various simulations and the anonymous referee for all his/her precious and useful comments. This work was completed with the support of the SNF grant number \(200021\_172536\), “Several aspects of the study of non-uniform random permutations”.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appeneix A: A generating function proof that \(P_{231}(\pi )\) is a probability distribution
We give here a generating function proof of the fact that
defines a probability distribution on \(\text {Av}^k(231),\) for all \(k\ge 1\).
Using our bijection between 231-avoiding permutations and binary trees, we can consider the generating function
where \(\mathcal {T}_b:=\mathbb {T}_b\cup \emptyset \) is the set of (possibly empty) binary trees. Using the classical decomposition of the binary trees in root, left subtree and right subtree, together with Observation 4.8, we obtain the following equation for our generating function,
where the term 1 corresponds to the empty tree.
Now setting \(x=y=1\) in Eq. (75) and \(A(z):=C(z,1,1),\) we obtain the classical relation for the generating function of Catalan numbers:
that can be algebraically solved to yield \(A(z)=\frac{1-\sqrt{1-4z}}{2z}\).
Substituting \(y=1\) in Eq. (75) and setting \(B(z,x):=C(z,x,1)\), we have
and so
Finally, noting the symmetry \(C(z,x,1)=C(z,1,x)\), we obtain
Once we have the explicit expression for C(z, x, y), in order to prove that Eq. (74) defines a probability distribution on \(\text {Av}^k(231)\), it suffices to notice that
and so \([z^n]C(z,2,2)=2^{2n}\).
Appendix B: A small lemma
Lemma B.1
Let \((\varvec{X}_n)_{n\in \mathbb {Z}_{>0}},\)\((\tilde{\varvec{X}}_n)_{n\in \mathbb {Z}_{>0}},\) be two sequences of real random variables with values in [0, 1] such that, for all \(n\in \mathbb {Z}_{>0},\)
i.e. \(\varvec{X}_n-\tilde{\varvec{X}}_n{\mathop {\rightarrow }\limits ^{P}}0\). Then, for every real continuous random process \(\varvec{Y}=(\varvec{Y}_t)_{t\in [0,1]}\) (i.e. a random variable with values in \(\mathcal {C}([0,1],\mathbb {R})\)) we have
Proof
Since \(\varvec{Y}=(\varvec{Y}_t)_{t\in [0,1]}\) is a.s. continuous on a compact set, it is also a.s. uniformly continuous. Therefore the continuity modulus \(\omega (\varvec{Y},\delta ):=\sup _{s,t\in [0,1],|s-t|\le \delta }|\varvec{Y}_t-\varvec{Y}_s|\) tends a.s. to zero as \(\delta \) tends to zero. By Skorokhod’s representation theorem we can assume that there exist a coupling such that \(\varvec{X}_n-\tilde{\varvec{X}}_n{\mathop {\rightarrow }\limits ^{a.s.}}0,\) therefore
Hence we can conclude that \(\varvec{Y}_{\varvec{X}_n}-\varvec{Y}_{\tilde{\varvec{X}}_n}=\varvec{o}_P(1)\) in the original probability space. \(\square \)
Rights and permissions
About this article
Cite this article
Borga, J. Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\). Probab. Theory Relat. Fields 176, 449–531 (2020). https://doi.org/10.1007/s00440-019-00922-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-019-00922-4
Keywords
- Local weak limits
- Permutation patterns
- Pattern-avoidance
- Asymptotic distributions
Mathematics Subject Classification
- 60C05
- 05A05