, We build f and show (17) on [b k , b j ] only. The interval [b i , b k ] can be treated with a symmetric proof
, Then consider the most recent ? g(u) ? h m + ?(g, ?)
, Now that we have shown that f is continuous
, Under (A), we have g = f ? ?, and furthermore
, To show g(t) = f (?(t)) it is enough to see that (18) {k : t ?
, Now to show that ? is a (d g , d f ) isometry, we need only show that for x < y, min [x,y] g = min
, Then for every i, x ? [a i , c i ] implies y ? [a i , c i
, = f (?(x)) = g(x) = min
The Brownian Continuum Random Tree as the unique solution to a fixed point equation, Electron. Commun. Probab, vol.20, p.14, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-02408709
The Continuum Random Tree III, Ann. Probab, vol.21, issue.1, pp.248-289, 1993. ,
Recursive self-similarity for random trees, random triangulations and brownian excursion, Ann. Probab, vol.22, issue.2, pp.527-545, 1994. ,
On pop-stacks in series, Utilitas Math, vol.19, pp.129-140, 1981. ,
Mickaël Maazoun, and Adeline Pierrot. Scaling limits of permutation classes with a finite specification: a dichotomy, 2019. ,
Universal limits of substitution-closed permutation classes, J. Eur. Math. Soc, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01653572
The brownian limit of separable permutations, Ann. Probab, vol.46, issue.4, pp.2134-2189, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01275310
Path transformations connecting Brownian bridge, excursion and meander, Bull. Sci. Math, vol.118, issue.2, pp.147-166, 1994. ,
Combinatorics of Permutations, 2004. ,
Handbook of Brownian motion-facts and formulae. Probability and its Applications, 2002. ,
Pattern matching for permutations, Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, and Sue Whitesides, pp.200-209, 1993. ,
The expected shape of random doubly alternating Baxter permutations, Online J. Anal. Comb, issue.9, pp.1-12, 2014. ,
The coding of compact real trees by real valued functions, 2006. ,
, Étienne Ghys. A singular Mathematical Promenade. ENSÉditions, 2017.
Limits of permutation sequences, Journal of Combinatorial Theory, Series B, vol.103, issue.1, pp.93-113, 2013. ,
Poisson processes, volume 3 of Oxford Studies in Probability, 1993. ,
Random trees and applications, Probab. Surveys, vol.2, pp.245-311, 2005. ,
Pattern avoiding doubly alternating permutations, Proceedings of FPSAC 2005, 2005. ,
An excursion approach to maxima of the Brownian bridge, Stochastic Processes and their Applications, vol.124, pp.3106-3120, 2014. ,
,
Bootstrap percolation, the Schröder numbers, and the N -kings problem, SIAM J. Discrete Math, vol.4, issue.2, pp.275-280, 1991. ,
, Mathématiques Pures et Appliquées E-mail address: mickael.maazoun@ens-lyon.fr