Let $G _ { 0 } = \left( S _ { 0 } , A _ { 0 } \right)$ be a particular fixed graph with $s _ { 0 } = s _ { G _ { 0 } }$, $a _ { 0 } = a _ { G _ { 0 } }$, $s_0 \geq 2$, $a_0 \geq 1$. Let $X _ { n } ^ { 0 }$ be the discrete real random variable counting the number of copies of $G_0$ contained in $G \in \Omega_n$, and let $$\omega _ { 0 } = \min _ { \substack { H \subset G _ { 0 } \\ a _ { H } \geq 1 } } \frac { s _ { H } } { a _ { H } }$$ Deduce that if $p _ { n } = \mathrm { o } \left( n ^ { - \omega _ { 0 } } \right)$, then $\lim _ { n \rightarrow + \infty } \mathbf { P } \left( X _ { n } ^ { 0 } > 0 \right) = 0$. Hint: one may introduce $H _ { 0 } \subset G _ { 0 }$ achieving the minimum giving $\omega _ { 0 }$.
Let $G _ { 0 } = \left( S _ { 0 } , A _ { 0 } \right)$ be a particular fixed graph with $s _ { 0 } = s _ { G _ { 0 } }$, $a _ { 0 } = a _ { G _ { 0 } }$, $s_0 \geq 2$, $a_0 \geq 1$. Let $X _ { n } ^ { 0 }$ be the discrete real random variable counting the number of copies of $G_0$ contained in $G \in \Omega_n$, and let
$$\omega _ { 0 } = \min _ { \substack { H \subset G _ { 0 } \\ a _ { H } \geq 1 } } \frac { s _ { H } } { a _ { H } }$$
Deduce that if $p _ { n } = \mathrm { o } \left( n ^ { - \omega _ { 0 } } \right)$, then $\lim _ { n \rightarrow + \infty } \mathbf { P } \left( X _ { n } ^ { 0 } > 0 \right) = 0$.\\
Hint: one may introduce $H _ { 0 } \subset G _ { 0 }$ achieving the minimum giving $\omega _ { 0 }$.