Abstract
The d-dimensional random partial order is the intersection of d independently and uniformly chosen (with replacement) linear orders on the set [n] = {1, 2, . . . , n}. This is equivalent to picking n points uniformly at random in the d-dimensional unit cube \(Q_d=[0,1]^d\) with the coordinate-wise ordering. If d = 2, then this can be rephrased by declaring that for any pair P 1, P 2 ∈ Q 2 we have P 1 ≺ P 2 if and only if P 2 lies in the positive upper quadrant defined by the two axis-parallel lines crossing at P 1. In this paper we study the random partial order with parameter α (0 ≤ α ≤ π) which is generated by picking n points uniformly at random from Q 2 equipped with the same partial order as above but with the quadrant replaced by an angular domain of angle α.
Similar content being viewed by others
References
Aldous, D., Diaconis, P.: Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem. Bull. Am. Math. Soc. 36, 413–432 (1999)
Baik, J., Deift, P., Johansson, K.: On the distribution of the length of the longest increasing sequence of random permutations. J. Am. Math. Soc. 12, 1119–1178 (1999)
Bollobás, B., Brightwell, G.: The height of a random partial order: concentration of measure. Ann. Appl. Probab. 2, 1009–1018 (1992)
Bollobás, B., Brightwell, G.: Box spaces and random partial orders. Trans. Am. Math. Soc. 324, 347–353 (1991)
Bollobás, B., Janson, S.: On the Length of the Longest Increasing Subsequence in a Random Permutation. Combinatorics, Geometry and Probability (Cambridge, 1993), pp. 121–128. Cambridge University Press, Cambridge (1997)
Bollobás, B., Thomason, A.: Random Graphs of Small Order, Random graphs ‘83 (Poznan, 1983), North-Holland Math. Stud., vol. 118, pp. 47–97. North-Holland, Amsetrdam (1985)
Bollobás, B., Winkler, P.: The longest chain among random points in Euclidean space. Proc. Am. Math. Soc. 103, 347–353 (1988)
Erdős, P., Rényi, A.: On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5, 17–61 (1960)
Brightwell, G.: Models of random partial orders. In: Surveys in Combinatorics, 1993 (Keele), pp. 53–83. London Math. Soc. Lecture Note Ser., vol. 187. Cambridge University Press, Cambridge (1993)
Frieze, A.: On the length of the longest monotone subsequence in a random permutation. Ann. Appl. Probab. 1, 301–305 (1991)
Hammersley, J.M.: A few seedlings of research. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, pp. 345–394. University of California Press, Berkeley, CA (1972)
Kim, J.H.: On increasing subsequences of random permutations. J. Comb. Theory, Ser. A 76, 148–155 (1996)
Logan, B.F., Shepp, L.A.: A variational problem for random Young tableaux. Adv. Math. 26, 206–222 (1977)
Ulam, S.M.: Monte Carlo Calculations in Problems of Mathematical Physics. Modern Mathematics for the Engineer: Second series, pp. 261–281. McGraw-Hill, New York (1961)
Vershik, A.M., Kerov, S.V.: Asymptotic behavior of the Plancherel measure of the symmetric group and the limit form of Young tableaux (Russian). Dokl. Akad. Nauk SSSR 233, 1024–1027 (1977)
Winkler, P.: Random orders. Order 1, 317–335 (1985)
Winkler, P.: Connectedness and diameter for random orders of fixed dimension. Order 2, 165–171 (1985)
Author information
Authors and Affiliations
Corresponding author
Additional information
P. Balister was partially supported by NSF Grant CCF-0728928.
B. Patkós was supported by NSF Grant CCF-0728928.
Rights and permissions
About this article
Cite this article
Balister, P., Patkós, B. Random Partial Orders Defined by Angular Domains. Order 28, 341–355 (2011). https://doi.org/10.1007/s11083-010-9172-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-010-9172-2