Asymptotics for the Length of the Longest Increasing Subsequence of a Binary Markov Random Word (Q2841798): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Christian Houdré / rank
Normal rank
 
Property / author
 
Property / author: Christian Houdré / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W56402619 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1110.1324 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:03, 19 April 2024

scientific article
Language Label Description Also known as
English
Asymptotics for the Length of the Longest Increasing Subsequence of a Binary Markov Random Word
scientific article

    Statements

    Asymptotics for the Length of the Longest Increasing Subsequence of a Binary Markov Random Word (English)
    0 references
    0 references
    0 references
    30 July 2013
    0 references
    longest increasing subsequence
    0 references
    Markov chains
    0 references
    functional central limit theorem
    0 references
    random matrices
    0 references
    Young diagrams
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references