Abstract | ||
---|---|---|
Let P (n) denote the power set of [n], ordered by inclusion, and let P(n, p) denote the random poset obtained from. (n) by retaining each element from P(n) independently at random with probability p and discarding it otherwise. Given any fixed poset F we determine the threshold for the property that P(n, p) contains F as an induced subposet. We also asymptotically determine the number of copies of a fixed poset F in. P(n). Finally, we obtain a number of results on the Ramsey properties of the random poset. P(n, p). |
Year | DOI | Venue |
---|---|---|
2020 | 10.1002/rsa.20952 | RANDOM STRUCTURES & ALGORITHMS |
Keywords | DocType | Volume |
boolean lattice,existence thresholds,Ramsey properties,random posets | Journal | 57.0 |
Issue | ISSN | Citations |
SP4.0 | 1042-9832 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Victor Falgas-Ravry | 1 | 28 | 7.46 |
Markström Klas | 2 | 0 | 0.68 |
Andrew Treglown | 3 | 99 | 15.16 |
Zhao Yi | 4 | 0 | 0.34 |