Pages that link to "Item:Q3119051"
From MaRDI portal
The following pages link to A concentration result with application to subgraph count (Q3119051):
Displaying 7 items.
- Hölder-type inequalities and their applications to concentration and correlation bounds (Q505059) (← links)
- Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs (Q1615893) (← links)
- Upper tails for arithmetic progressions in random subsets (Q1678647) (← links)
- Supersaturation for subgraph counts (Q2117531) (← links)
- On the missing log in upper tail estimates (Q2284727) (← links)
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs (Q2431088) (← links)
- The deletion method for upper tail estimates (Q2567402) (← links)