Longest increasing paths with gaps

zbMath1439.60089arXiv1805.09136MaRDI QIDQ4972751

Lucas Gerin, Anne-Laure Basdevant

Publication date: 26 November 2019

Full work available at URL: https://arxiv.org/abs/1805.09136

zbMATH Keywords

combinatorial probabilitylongest increasing subsequenceslongest in

Mathematics Subject Classification ID

Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (1)

Longest increasing paths with Lipschitz constraints

Cites Work

• Unnamed Item
• Soft edge results for longest increasing paths on the planar lattice
• Exact limiting shape for a simplified model of first-passage percolation on the plane
• Increasing sequences of independent points on the planar lattice
• Hydrodynamical methods for analyzing longest increasing subsequences
• Optimality regions and fluctuations for Bernoulli last passage models
• Hammersley's interacting particle process and longest increasing subsequences
• A microscopic model for the Burgers equation and longest increasing subsequences
• Shape fluctuations and random matrices
• Order of the variance in the discrete Hammersley process with boundaries
• Discrete Hammersley's Lines with sources and sinks
• Bethe Ansatz Solution of the Finite Bernoulli Matching Model of Sequence Alignment
• The Surprising Mathematics of Longest Increasing Subsequences
• On the distribution of the length of the longest increasing subsequence of random permutations
• On Two Variants of the Longest Increasing Subsequence Problem
• Discrete orthogonal polynomial ensembles and the Plancherel measure

This page was built for publication: Longest increasing paths with gaps