Test dense subgraphs in sparse uniform hypergraph

DOI10.1080/03610926.2020.1723637OpenAlexW3005357841MaRDI QIDQ5079097

Mingao Yuan, Yehong Nan

Publication date: 25 May 2022

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2020.1723637

zbMATH Keywords

hypothesis testuniform hypergraphdense subgraphnetwork data analysis

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (2)

Sharp detection boundaries on testing dense subhypergraph ⋮ A practical two-sample test for weighted random graphs

Uses Software

• FRAUDAR

Cites Work

• Consistency of spectral hypergraph partitioning under planted partition model
• Community detection in sparse random networks
• The Ramsey number of generalized loose paths in hypergraphs
• Community detection in dense random networks
• The Densest $k$-Subhypergraph Problem
• Finding Dense Subgraphs with Size Bounds
• On Finding Dense Subgraphs
• Community Detection and Stochastic Block Models
• Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log^*|V|) time
• A Survey of Statistical Network Models
• Unnamed Item
• Unnamed Item

This page was built for publication: Test dense subgraphs in sparse uniform hypergraph