Show simple item record

dc.contributor.authorLiu, Tian
dc.contributor.authorLin, Xiaxiang
dc.contributor.authorWang, Chaoyi
dc.contributor.authorSu, Kaile
dc.contributor.authorXu, Ke
dc.contributor.editorToby Walsh
dc.description.abstractConsider random hypergraphs on n vertices, where each k-element subset of vertices is selected with probability p independently and randomly as a hyperedge. By sparse we mean that the total number of hyperedges is O(n) or O(n ln n). When k = 2, these are exactly the classical Erd诳-R䥮yi random graphs G(n, p). We prove that with high probability, hinge width on these sparse random hypergraphs can grow linearly with the expected number of hyperedges. Some random constraint satisfaction problems such as Model RB and Model RD have satisfiability thresholds on these sparse constraint hypergraphs, thus the large hinge width results provide some theoretical evidence for random instances around satisfiability thresholds to be hard for a standard hinge-decomposition based algorithm. We also conduct experiments on these and other kinds of random graphs with several hundreds vertices, including regular random graphs and power law random graphs. The experimental results also show that hinge width can grow linearly with the number of edges on these different random
dc.publisherAAAI Press
dc.publisher.placeUnited Staters
dc.relation.ispartofconferencenameIJCAI 2011
dc.relation.ispartofconferencetitleIJCAI 2011
dc.relation.ispartoflocationBarcelona, Catalonia, Spain
dc.subject.fieldofresearchApplied Discrete Mathematics
dc.titleLarge Hinge Width on Sparse Random Hypergraphs
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.hasfulltextNo Full Text
gro.griffith.authorSu, Kaile

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record