𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting subsets of the random partition and the ‘Brownian Bridge’ process

✍ Scribed by J.M. DeLaurentis; B.G. Pittel

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
522 KB
Volume
15
Category
Article
ISSN
0304-4149

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The length of random subsets of Boolean
The length of random subsets of Boolean lattices
✍ Y. Kohayakawa; B. Kreuter; D. Osthus 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 3 views

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 g

Exponentially small bounds on the expect
Exponentially small bounds on the expected optimum of the partition and subset sum problems
✍ George S. Lueker 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

In the partition problem we seek to partition a list of numbers into two sublists to minimize the difference between the sums of the two sublists. For this and the related subset sum problem, under suitable assumptions on the probability distributions of the input, it is known that the median of the