Abstract:
Let $R_n$ be the centered and normalized number of cycles of fixed length contained in a generalized random graph with $n$ vertices. We obtain a Höffding-type exponential inequality for the tail probability of $R_n$.
Key words:random graph, number of subgraphs, cycle, Höffding's inequality.