Occupancy problems and random algebras
Let \([n]=\{1,2,...,n\}\). Consider \({\mathcal P}_ n=2^{[n]}\) as a probability space in which each subset of [n] has the same probability \(2^{-n}\). Now select \(A_ 1,A_ 2,...,A_ k\) independently and randomly from \({\mathcal P}_ n\) (with replacement). The authors determine the asymptotic probability that the Boolean subalgebra (or the distributive sublattice, or the meet sub-semi-lattice) of \({\mathcal P}_ n\) generated by \(A_ 1,A_ 2,...,A_ k\) is \(\alpha\)) freely generated by \(A_ 1,A_ 2,...,A_ k\), or \(\beta\)) the whole of \({\mathcal P}_ n\). For example, in the case of the Boolean subalgebra, if \(\epsilon >0\) is fixed and \(K=\log_ 2n-\log_ 2\log_ en+\log_ 2\log_ e2\) then lim p(\(\alpha\))\(=1\) for \(k\leq K-\epsilon\) and \(\lim_{n\to \infty}p(\alpha)=0\) for \(k\geq K+\epsilon\).
This page was built for publication: Occupancy problems and random algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276987)
