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

Bar-Ilan University

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

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

Keywords

Analysis of algorithms
Isomorphism
Random hypergraph

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2020.106039

Cite this

@article{8145caae5d894a2084ebbcdcbe908a90,

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 - http://www.scopus.com/inward/record.url?scp=85093658354&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2020.106039

DO - 10.1016/j.ipl.2020.106039

M3 - مقالة

SN - 0020-0190

VL - 166

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106039

ER -

Isomorphism for random k-uniform hypergraphs

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this