Pages that link to "Item:Q6101707"
From MaRDI portal
The following pages link to Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph (Q6101707):
Displaying 6 items.
- A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph (Q1948698) (← links)
- A large deviation result on the number of small subgraphs of a random graph (Q2722658) (← links)
- Tight upper tail bounds for cliques (Q3145838) (← links)
- Strict inequalities for critical probabilities of a regular graph and a subgraph of it (Q3475273) (← links)
- (Q3819092) (← links)
- A Bernstein inequality for exponentially growing graphs (Q5031699) (← links)