In this article, we determine the probability of existence of small lattices in random subsets of a Boolean lattice. Furthermore, we address some Ramsey-and Turan-type questions. Analogous questions have been studied extensively for random graphs, but it turns out that the situation for Boolean lat
The length of random subsets of Boolean lattices
β Scribed by Y. Kohayakawa; B. Kreuter; D. Osthus
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 236 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
β¦ Synopsis
We form the random poset P P n, p by including each subset of n s 1, . . . , n with probability p and ordering the subsets by inclusion. We investigate the length of the Ε½ . longest chain contained in P P n, p . For p G ern we obtain the limit distribution of this random variable. For smaller p we give thresholds for the existence of chains which imply Ε½ . Ε½ . that almost surely the length of P P n, p is asymptotically n log n y log log 1rp rlog 1rp.
π SIMILAR VOLUMES
We introduce a family of probability distributions on the space of trees with I labeled vertices and possibly extra unlabeled vertices of degree 3, whose edges have positive real lengths. Formulas for distributions of quantities such as degree sequence, shape, and total length are derived. An interp
The size of ordered binary decision diagrams OBDDs strongly depends on the chosen variable ordering. It is an obvious heuristic to use symmetric variable orderings, i.e., variable orderings where symmetric variables are arranged adjacently. In order to evaluate this heuristic, methods for estimating
In a previous study we modified a double lattice model by introducing a new interaction parameter, which improved the mathematical approximation defect, and gave a new expression for the Helmholtz energy of mixing. In the model the universal constants C β€ and C β₯ in the primary lattice were determin