✦ LIBER ✦

The cyclic structure of random permutations

✍ Scribed by V. F. Kolchin; V. P. Chistyakov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1975
Tongue: English
Weight: 284 KB
Volume: 18
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01099997

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating a random cyclic permutation

✍ David Gries; Jinyun Xue 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 182 KB

Constructing Pseudo-Random Permutations

Constructing Pseudo-Random Permutations with a Prescribed Structure

✍ Moni Naor; Omer Reingold 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 59 KB

Increasing permutations of random proces

Increasing permutations of random processes

✍ E. E. Zhukova 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 462 KB

Random permutations of countable sets

✍ Karl-Heinz Fichtner 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 827 KB

On Increasing Subsequences of Random Per

On Increasing Subsequences of Random Permutations

✍ Jeong Han Kim 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Let L n be the length of a longest increasing subsequence in a random permutation of [1, ..., n]. It is known that the expected value of L n is asymptotically equal to 2 -n as n gets large. This note derives upper bound on the probability that L n &2 -n exceeds certain quantities. In particular, we

Hamilton cycles in the union of random p

Hamilton cycles in the union of random permutations

✍ Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB