10 search results - page 1 / 2 » Law of large numbers for increasing subsequences of random p... |
59
Voted
RSA
2006
14 years 9 months ago
2006
COMBINATORICS
1998
14 years 9 months ago
1998
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
COMBINATORICS
2007
14 years 9 months ago
2007
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
103
click to vote
CAAP
1992
15 years 1 months ago
1992
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
102
click to vote
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Gupta and Kumar showed that throughput in a static random wireless network increases with the amount of hopping. In a subsequent paper (2004), it was shown that although throug...