The length of random subsets of Boolean lattices
Among various constructions of random posets, the random poset \(P(n,p)\) of all subsets of a (standard) \(n\)-set \((\{1,\dots, n\})\), each drawn with probability \(p\) and ordered by set-inclusion, for \(p= 1\) yields the \(n\)-cube (Boolean algebra, lattice etc.) and for \(p< 1\) a subposet of that structure. Being random, \(P(n,p)\) varies from draw-to-draw and hence numerical invariants (e.g., height or length and width) become random variables whose statistical behavior describing certain ``approximate properties is then of interest and for which asymptotic properties \((n\to\infty)\) are also meaningful. In discussing these asymptotic properties one may also vary \(p\) (e.g., by requiring \(p\geq e/n\)). Techniques used to develop results often depend on the model used and in this case the arguments are ``random-graphian in nature, unsurprisingly perhaps by these authors. As always required, the proofs are a delicate mix of tricky inequalities and good structural insight expertly put together to provide intriguing results, e.g., Corollary 3, Theorem 1, if \(c^n= o(p)\) for any \(0< c< 1\) and \(p= O(1/n)\), then a.s. length \[ P(n, p)= \Biggl(1+ O(1) {n\over \log(1/p)} \Biggl(\log n-\log\log{1\over p}\Biggr)\Biggr), \] and many others.
- Connectivity properties of random subgraphs of the cube
- Maximum antichains in random subsets of a finite set
- On the diameter and radius of randon subgraphs of the cube
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
- Small sublattices in random subsets of Boolean lattices
- Maximum antichains in random subsets of a finite set
- The width of random subsets of Boolean lattices
- Occupancy problems and random algebras
- Maximum-size antichains in random set-systems
- Existence thresholds and Ramsey properties of random posets
- A random version of Sperner's theorem
- Small sublattices in random subsets of Boolean lattices
- A sharp threshold for a random version of Sperner's theorem
- Hamiltonicity of random subgraphs of the hypercube
This page was built for publication: The length of random subsets of Boolean lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948020)
