Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs (Q2431088)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5876937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs |
scientific article; zbMATH DE number 5876937 |
Statements
Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs (English)
0 references
8 April 2011
0 references
On a finite ground set of size \(N\), a random subset is selected that independently includes each element with the same probability \(p=p(N)\). Tail probabilities are estimated for the number of members of a given family of subsets that are included in the random subset. Close bounds are given for upper tail probabilities of edge counts in random hypergraphs. Applications to partition properties of random subsets of integers are considered. Rooted subgraphs of random graphs are investigated.
0 references
Random hypergraph
0 references
set system
0 references
arithmetic progression
0 references
Schur triple
0 references
rooted subgraph
0 references
0 references
0.8445948958396912
0 references
0.8229177594184875
0 references
0.8225272297859192
0 references
0.8186421394348145
0 references
0.7955940365791321
0 references
