Tight upper tail bounds for cliques (Q3145838): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980423003 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1111.6687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of subgraphs of prescribed type of graphs with a given number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The missing log in large deviations for triangle counts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper tails for triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of copies of one hypergraph in another / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for large deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper tails for subgraph counts in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infamous upper tail / rank
 
Normal rank
Property / cites work
 
Property / cites work: The deletion method for upper tail estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of multivariate polynomials and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and conquer martingales and the number of triangles in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concentration of multivariate polynomials with small expectation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Choice Number of Random Hypergraphs / rank
 
Normal rank

Latest revision as of 00:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Tight upper tail bounds for cliques
scientific article

    Statements

    Tight upper tail bounds for cliques (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2012
    0 references
    0 references
    upper tails
    0 references
    large deviations
    0 references
    random graphs
    0 references
    subgraph counts
    0 references
    0 references
    0 references