Random partial orders defined by angular domains

DOI10.1007/s11083-010-9172-2zbMath1233.06003OpenAlexW2000391512MaRDI QIDQ634753

Balázs Patkós, Paul N. Balister

Publication date: 16 August 2011

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-010-9172-2

zbMATH Keywords

comparability graphrandom processpartial ordersrandom partial order

Mathematics Subject Classification ID

Partial orders, general (06A06) Random graphs (graph-theoretic aspects) (05C80) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random orders
• Connectedness and diameter for random orders of fixed dimension
• On the length of the longest monotone subsequence in a random permutation
• The height of a random partial order: Concentration of measure
• A variational problem for random Young tableaux
• On increasing subsequences of random permutations
• Box-Spaces and Random Partial Orders
• The Longest Chain Among Random Points in Euclidean Space
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem

This page was built for publication: Random partial orders defined by angular domains