scientific article; zbMATH DE number 1047715

zbMATH Open0879.60009MaRDI QIDQ4347882FDOQ4347882

Authors: Béla Bollobás, Svante Janson 

Publication date: 22 January 1998

Title of this publication is not available (Why is that?)

Recommendations

• On increasing subsequences of random permutations
• On the distribution of the length of the longest increasing subsequence of random permutations
• On the distribution of the length of the longest increasing subsequence in a random permutation
• The longest increasing subsequence in a random permutation and a unitary random matrix model

zbMATH Keywords

random permutationmaximal length

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Cited In (26)

• A concentration bound for the longest increasing subsequence of a randomly chosen involution
• LIL for the length of the longest increasing subsequences
• Continuously increasing subsequences of random multiset permutations
• Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
• Book review of: D. Romik, The surprising mathematics of longest increasing subsequences
• When the law of large numbers fails for increasing subsequences of random permutations
• A general method for lower bounds on fluctuations of random variables
• The height of a random partial order: Concentration of measure
• On the limiting distribution for the length of the longest alternating sequence in a random permutation
• Universality of random permutations
• Random partial orders defined by angular domains
• Title not available (Why is that?)
• Optimal online selection of a monotone subsequence: a central limit theorem
• Inversions and longest increasing subsequence for \(k\)-card-minimum random permutations
• Moderate deviations for longest increasing subsequences: The lower tail
• General result of precise asymptotics for length of longest increasing subsequences
• On increasing subsequences of minimal Erdős-Szekeres permutations
• On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
• Descending subsequences of random permutations
• On the distribution of the length of the longest increasing subsequence of random permutations
• On the longest common subsequence of conjugation invariant random permutations
• Longest increasing subsequences of random colored permutations
• On the distribution of the length of the longest increasing subsequence in a random permutation
• Non-universality for longest increasing subsequence of a random walk
• On the longest increasing subsequence for finite and countable alphabets
• Hammersley's interacting particle process and longest increasing subsequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347882)