Abstract Random Forest remains one of Data Mining’s most enduring ensemble algorithms, achieving well-documented levels accuracy and processing speed, as well regularly appearing in new research. However, with data mining now reaching the domain hardware-constrained devices such smartphones Internet Things (IoT) devices, there is continued need for further research into algorithm efficiency to ...

It was recently discovered by Baik, Deift and Johansson [4] that the asymptotic distribution of the length of the longest increasing subsequence in a permutation chosen uniformly at random from Sn, properly centred and normalised, is the same as the asymptotic distribution of the largest eigenvalue of an n × n GUE random matrix, properly centred and normalised, as n → ∞. This distribution had e...

In a famous paper 8] Hammersley investigated the length L n of the longest increasing subsequence of a random n-permutation. Implicit in that paper is a certain one-dimensional continuous-space interacting particle process. By studying a hydrodynamical limit for Hammersley's process we show by fairly \soft" arguments that limn ?1=2 EL n = 2. This is a known result, but previous proofs (Vershik-...

We compute the limit distribution for the (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift, and Johansson (math.CO/9810105). In the two–colored case our method provides a different proof of a similar result by Tracy and Widom about t...

Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing subsequence in non-uniform random permutations.