The height of a random partial order: Concentration of measure

DOI10.1214/AOAP/1177005586MaRDI QIDQ1203756zbMATH OpenOpenAlexWikidataFDO

Authors Béla Bollobás, Graham Brightwell

Publication date 22 February 1993

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1177005586

zbMATH Keywords

heights of random \(k\)-dimensional orders

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Partial orders, general (06A06) Combinatorial probability (60C05)

Recommendations

• scientific article; zbMATH DE number 1047715
• On increasing subsequences of random permutations
• Random high-dimensional orders
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• On the distribution of the length of the longest increasing subsequence of random permutations

Cited in

(24)

• A concentration bound for the longest increasing subsequence of a randomly chosen involution
• Optimal sequential selection of a unimodal subsequence of a random sequence
• Rates of convergence for the continuum limit of nondominated sorting
• Random k-dimensional orders: Width and number of linear extensions
• Untangling planar graphs from a specified vertex position-Hard cases
• The Longest Chain Among Random Points in Euclidean Space
• scientific article; zbMATH DE number 3844714 (Why is no real title available?)
• The symmetry in the martingale inequality
• Existence thresholds and Ramsey properties of random posets
• Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
• The competition of roughness and curvature in area-constrained polymer models
• A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting
• Concentration of measure and isoperimetric inequalities in product spaces
• Heapability, interactive particle systems, partial orders: results and open problems
• Ratio convergence rates for Euclidean first-passage percolation: applications to the graph infinity Laplacian
• Analytic methods in asymptotic enumeration
• A random version of Sperner's theorem
• On the method of typical bounded differences
• Decomposing Random Permutations into Order-Isomorphic Subpermutations
• Random partial orders defined by angular domains
• Scaling limits for width two partially ordered sets: the incomparability window
• Optimal online selection of a monotone subsequence: a central limit theorem
• The width of random subsets of Boolean lattices
• Hammersley's interacting particle process and longest increasing subsequences

This page was built for publication: The height of a random partial order: Concentration of measure

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