Convergence in Distribution for Subset Counts Between Random Sets

15 years 2 months ago

Download www.combinatorics.org

Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at least one subset is contained in another. R

Dudley Stark

Real-time Traffic

COMBINATORICS 2004 | Infinity | Probability Distribution | Random Subsets |

claim paper

» Functional Analysis Evaluation of Response Intensities Tailoring ANOVA for Lists of Expre...

» ByzantineResilient Convergence in Oblivious Robot Networks

» Set Covering with our Eyes Closed

» A distributed machine learning framework

» Pairwise Optimal Discrete Coverage Control for Gossiping Robots

» Unsupervised reduction of random noise in complex data by a rowspecific sorted principal c...

» Joint Random Access and Power Selection for Maximal Throughput in Wireless Networks

» ClusterSwap A Distributed Kmedian Algorithm for Sensor Networks

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMBINATORICS
Authors	Dudley Stark

Comments (0)

Sciweavers

Convergence in Distribution for Subset Counts Between Random Sets

COMBINATORICS 2004 | Infinity | Probability Distribution | Random Subsets |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers