Isomorphism for random k-uniform hypergraphs

Debsoumya Chakraborti; Alan Frieze; Simi Haber; Mihir Hasabnis

doi:10.1016/j.ipl.2020.106039

Isomorphism for random k-uniform hypergraphs

Debsoumya Chakraborti
, Alan Frieze
, Simi Haber
, Mihir Hasabnis

Department of Mathematics

Carnegie Mellon University

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

1 Scopus citations

Abstract

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph H_n,p;k, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs H_n,r;k,r=O(1).

Original language	English
Article number	106039
Journal	Information Processing Letters
Volume	166
DOIs	https://doi.org/10.1016/j.ipl.2020.106039
State	Published - Feb 2021

Bibliographical note

Publisher Copyright:
© 2020 The Author(s)

Funding

Research supported in part by NSF grant DMS1661063.This research was partially supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Directorate in the Prime Minister's office.

Funders
National Science Foundation

Keywords

Analysis of algorithms
Isomorphism
Random hypergraph

Access to Document

10.1016/j.ipl.2020.106039

Cite this

@article{f583ef9b7d454fd89d604d3f2beb62cd,

title = "Isomorphism for random k-uniform hypergraphs",

abstract = "We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph Hn,p;k, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs Hn,r;k,r=O(1).",

keywords = "Analysis of algorithms, Isomorphism, Random hypergraph",

author = "Debsoumya Chakraborti and Alan Frieze and Simi Haber and Mihir Hasabnis",

note = "Publisher Copyright: {\textcopyright} 2020 The Author(s)",

year = "2021",

month = feb,

doi = "10.1016/j.ipl.2020.106039",

language = "אנגלית",

volume = "166",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Isomorphism for random k-uniform hypergraphs

AU - Chakraborti, Debsoumya

AU - Frieze, Alan

AU - Haber, Simi

AU - Hasabnis, Mihir

PY - 2021/2

Y1 - 2021/2

N2 - We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph Hn,p;k, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs Hn,r;k,r=O(1).

AB - We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph Hn,p;k, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs Hn,r;k,r=O(1).

KW - Analysis of algorithms

KW - Isomorphism

KW - Random hypergraph

UR - https://www.scopus.com/pages/publications/85093658354

U2 - 10.1016/j.ipl.2020.106039

DO - 10.1016/j.ipl.2020.106039

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

AN - SCOPUS:85093658354

SN - 0020-0190

VL - 166

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106039

ER -

Isomorphism for random k-uniform hypergraphs

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this