On random sampling in uniform hypergraphs
From MaRDI portal
Recommendations
- Hypergraph regularity and random sampling
- On the Complexity of Sampling Vertices Uniformly from a Graph
- Uniform sampling of k-hypertournaments
- Uniform sampling of digraphs with a fixed degree sequence
- Uniform random sampling of planar graphs in linear time
- Sampling hypergraphs with given degrees
- Uniform sampling of bipartite graphs with degrees in prescribed intervals
- Random contractions and sampling for hypergraph and hedge connectivity
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Uniform sampling of directed and undirected graphs conditional on vertex connectivity
Cites work
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- On graphs with small subgraphs of large chromatic number
- Random sampling and approximation of MAX-CSP problems
- Regular Partitions of Hypergraphs: Regularity Lemmas
- The Algorithmic Aspects of the Regularity Lemma
- The counting lemma for regular k‐uniform hypergraphs
- Uniform edge distribution in hypergraphs is hereditary
Cited in
(5)
This page was built for publication: On random sampling in uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5198663)