Occupancy problems and random algebras

✍ Scribed by Michael H. Albert; Alan M. Frieze

• Publisher: Elsevier Science
• Year: 1991
• Tongue: English
• Weight: 388 KB
• Volume: 87
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(91)90065-a

✦ Synopsis

For k randomly chosen subsets of [n] = (1, 2, . , n} we consider the probability that the Boolean algebra, distributive lattice, and meet semilattice which they generate are respectively free, or all of 2t"'. In each case we describe a threshold function for the occurrence of these events. The threshold functions for freeness are close to their theoretical maximum values.