ملخص
A set of vertices is shattered in a hypergraph if any of its subsets is obtained as the intersection of an edge with the set. The VC dimension is the size of the largest shattered subset. Under the binomial model of k-uniform random hypergraphs, the threshold function for the VC dimension to be larger than a given integer is obtained. The same is done for the testing dimension, which is the largest integer d such that all sets of cardinality d are shattered.
اللغة الأصلية | الإنجليزيّة |
---|---|
الصفحات (من إلى) | 564-572 |
عدد الصفحات | 9 |
دورية | Random Structures and Algorithms |
مستوى الصوت | 30 |
رقم الإصدار | 4 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - يوليو 2007 |
منشور خارجيًا | نعم |