The VC dimension of k-uniform random hypergraphs

B. Ycart; J. Ratsaby

doi:10.1002/rsa.20142

The VC dimension of k-uniform random hypergraphs

B. Ycart, J. Ratsaby

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	564-572
Number of pages	9
Journal	Random Structures and Algorithms
Volume	30
Issue number	4
DOIs	https://doi.org/10.1002/rsa.20142
State	Published - Jul 2007
Externally published	Yes

Keywords

Random hypergraph
Testing dimension
Threshold
Vapnik-Chervonenkis

Access to Document

10.1002/rsa.20142

Cite this

@article{c59843a81cd64abeaaf31dac9ba484f0,

title = "The VC dimension of k-uniform random hypergraphs",

abstract = "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.",

keywords = "Random hypergraph, Testing dimension, Threshold, Vapnik-Chervonenkis",

author = "B. Ycart and J. Ratsaby",

year = "2007",

month = jul,

doi = "10.1002/rsa.20142",

language = "אנגלית",

volume = "30",

pages = "564--572",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "4",

}

TY - JOUR

T1 - The VC dimension of k-uniform random hypergraphs

AU - Ycart, B.

AU - Ratsaby, J.

PY - 2007/7

Y1 - 2007/7

N2 - 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.

AB - 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.

KW - Random hypergraph

KW - Testing dimension

KW - Threshold

KW - Vapnik-Chervonenkis

UR - http://www.scopus.com/inward/record.url?scp=34547340998&partnerID=8YFLogxK

U2 - 10.1002/rsa.20142

DO - 10.1002/rsa.20142

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:34547340998

SN - 1042-9832

VL - 30

SP - 564

EP - 572

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 4

ER -

The VC dimension of k-uniform random hypergraphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this