Log In Sign Up

Sharp detection boundaries on testing dense subhypergraph

by   Mingao Yuan, et al.

We study the problem of testing the existence of a dense subhypergraph. The null hypothesis is an Erdos-Renyi uniform random hypergraph and the alternative hypothesis is a uniform random hypergraph that contains a dense subhypergraph. We establish sharp detection boundaries in both scenarios: (1) the edge probabilities are known; (2) the edge probabilities are unknown. In both scenarios, sharp detectable boundaries are characterized by the appropriate model parameters. Asymptotically powerful tests are provided when the model parameters fall in the detectable regions. Our results indicate that the detectable regions for general hypergraph models are dramatically different from their graph counterparts.


page 4

page 5

page 6

page 8


Heterogeneous Dense Subhypergraph Detection

We study the problem of testing the existence of a heterogeneous dense s...

Configuration Models of Random Hypergraphs and their Applications

Networks of dyadic relationships between entities have emerged as a domi...

Sharp Signal Detection Under Ferromagnetic Ising Models

In this paper we study the effect of dependence on detecting a class of ...

Community Detection in Sparse Random Networks

We consider the problem of detecting a tight community in a sparse rando...

Information Limits for Detecting a Subhypergraph

We consider the problem of recovering a subhypergraph based on an observ...

An asymptotic resolution of a conjecture of Szemerédi and Petruska

Consider a 3-uniform hypergraph of order n with clique number k such tha...

Hypergraph regularity and random sampling

Suppose a k-uniform hypergraph H that satisfies a certain regularity ins...