Test dense subgraphs in sparse uniform hypergraph
From MaRDI portal
Publication:5079097
DOI10.1080/03610926.2020.1723637OpenAlexW3005357841MaRDI QIDQ5079097FDOQ5079097
Authors: 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
Recommendations
- Testing for dense subsets in a graph via the partition function
- Testing subgraphs in large graphs
- Testing subgraphs in directed graphs
- Testing subgraphs in directed graphs
- scientific article; zbMATH DE number 2086691
- Sharp detection boundaries on testing dense subhypergraph
- Testing first-order properties for subclasses of sparse graphs
- Finding dense subgraphs of sparse graphs
- Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
- Algorithmic aspects of property testing in the dense graphs model
Cites Work
- A survey of statistical network models
- Community detection and stochastic block models: recent developments
- Community detection in dense random networks
- Title not available (Why is that?)
- Recovering a hidden community beyond the Kesten-Stigum threshold in \(O(| E|\log^\ast| V|)\) time
- Community detection in sparse random networks
- Title not available (Why is that?)
- On Finding Dense Subgraphs
- The Ramsey number of generalized loose paths in hypergraphs
- The densest \(k\)-subhypergraph problem
- Finding Dense Subgraphs with Size Bounds
- Consistency of spectral hypergraph partitioning under planted partition model
Cited In (2)
Uses Software
This page was built for publication: Test dense subgraphs in sparse uniform hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079097)
