On The Limiting Distributions of the Total Height On Families of Trees

The height of random binary unlabelled trees

This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local sense. Moderate as well as large deviations estimates are also derived. The proofs rely on the analysis (in the complex plane) of generating functions associated with trees of bounded height.

The Distribution of Heights of Discrete Excursions

We compute the limiting distribution of height of a random discrete excursion with step sets consisting of one positive step 1 and arbitrary finite set of non-positive integers. The limit law is the supremum of a Brownian excursion. This is well-known for Dyck and Motzkin paths. We apply a representation of the length and height generating function in terms of certain Schur polynomials put forward in a 2008 paper by Bousquet-Melout which leads to a form of the moment generating functions amenable to a Mellin transform analysis.

On crown-free families of subsets

The crown $\Oh_{2t}$ is a height-2 poset whose Hasse diagram is a cycle of length $2t$. A family $\F$ of subsets of $[n]:=\{1,2..., n\}$ is {\em $\Oh_{2t}$-free} if $\Oh_{2t}$ is not a weak subposet of $(\F,\subseteq)$. Let $\La(n,\Oh_{2t})$ be the largest size of $\Oh_{2t}$-free families of subsets of $[n]$. De Bonis-Katona-Swanepoel proved $\La(n,\Oh_{4})= {n\choose \lfloor \frac{n}{2} \rfloor} + {n\choose \lceil \frac{n}{2} \rceil}$. Griggs and Lu proved that $\La(n,\Oh_{2t})=(1+o(1))\nchn$ for all even $t\ge 4$. In this paper, we prove $\La(n,\Oh_{2t})=(1+o(1))\nchn$ for all odd $t\geq 7$.

交错符号矩阵的极限形状

Limiting shape of alternating sign matrices

本文宣布均匀分布的交错符号矩阵（即等权重畴壁六顶点模型）高度函数的极限形状。

Going Back to Neil Sloane's FIRST LOVE (OEIS Sequence A435): On the Total Heights in Rooted Labeled Trees

In this tribute to Neil Sloane, we revisit the first sequence in the On-Line Encyclopedia of Integer Sequences, sequence A435 (1, 8, 78, 944, 13800, 237432, 4708144, 105822432, ...), that he encountered when he was a graduate student, and when normalized gives the average total height of rooted labeled trees. We state rigorously-computed explicit expressions for the first twelve moments of the random variable `total height' on rooted labeled trees, and pledge to donate to the OEIS 100 dollars in honor of the first to find an explicit expression for the probability density function of the limit…

Longest increasing subsequences in pattern-restricted permutations

Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, and that the (321)-avoiding case has interesting connections with a well known theorem of Erd\H os-Szekeres.

Semicircular families of general covariance from Wigner matrices with permuted entries

Let $(σ_N^{(i)})_{i \in I}$ be a family of symmetric permutations of the entries of a Wigner matrix $\mathbf{W}_N$. We characterize the limiting traffic distribution of the corresponding family of dependent Wigner matrices $(\mathbf{W}_N^{σ_N^{(i)}})_{i \in I}$ in terms of the geometry of the permutations. We also consider the analogous problem for the limiting joint distribution of $(\mathbf{W}_N^{σ_N^{(i)}})_{i \in I}$. In particular, we obtain a description in terms of semicircular families with general covariance structures. As a special case, we derive necessary and sufficient conditions …

随机单纯形树子网络的极限定律

Limit laws of random simplex tree-child networks

研究随机单纯形树子网络相关指数和高度的极限定律，通过重新缩放证明其联合分布极限及高度极限定律，建立尾部界限，获得叶子高度轮廓缩放极限，确定固定根、随机顶点和叶子周围的局部极限。

The shape of random tanglegrams

A tanglegram consists of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the trees. We show that the two halves of a random tanglegram essentially look like two independently chosen random plane binary trees. This fact is used to derive a number of results on the shape of random tanglegrams, including theorems on the number of cherries and generally occurrences of subtrees, the root branches, the number of automorphisms, and the height. For each of these, we obtain limiting probabilities or distributions. Finally, we investigate the number of…

Scaling limits of permutation classes with a finite specification: a dichotomy

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple permutations. Our goal is to study their limiting behavior in the sense of permutons. The limit depends on the structure of the specification restricted to families with the largest growth rate. When it is strongly connected, two cases occur. If the associated system of equations is linear, the limiting permuton is a deterministic $X$-shape. Otherwise, the limiting…