Local extrema in random trees

The number of local maxima (resp., local minima) in a tree T ∈ 𝒯 n rooted at r ∈ [ n ] is denoted by M r ( T ) (resp., by m r ( T ) ). We find exact formulas as rational functions of n for the expectation and variance of M 1 (T) and m n ( T ) when T ∈ 𝒯 n is chosen randomly according to a uniform distribution. As a consequence, a.a.s. M 1 ( T ) and m n ( T ) belong to a relatively small interval when T ∈ 𝒯 n .

[1]  E. Seneta,et al.  Peaks and Eulerian numbers in a random sequence , 1996, Journal of Applied Probability.

[2]  Ömer Egecioglu,et al.  Bijections for Cayley trees, spanning trees, and their q-analogues , 1986, J. Comb. Theory, Ser. A.

[3]  Ira M. Gessel Counting forests by descents and leaves , 1996, Electron. J. Comb..

[4]  C. Mallows,et al.  The inversion enumerator for labeled trees , 1968 .

[5]  Yeong-Nan Yeh,et al.  Enumeration of trees by inversions , 1995, J. Graph Theory.

[6]  J. Moon Counting labelled trees , 1970 .