RUS  ENG
Full version
JOURNALS // Matematicheskie Trudy // Archive

Mat. Tr., 2023 Volume 26, Number 2, Pages 30–43 (Mi mt678)

This article is cited in 1 paper

Exponential inequalities for the tail probabilities of the number of cycles in generalized random graphs

A. A. Bystrova, N. V. Volod'kob

a Novosibirsk State University, Novosibirsk, 630090, Russia
b Sobolev Institute of Mathematics, Novosibirsk, 630090, Russia

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.

UDC: 519.175.4

Received: 21.06.2023
Revised: 23.07.2023
Accepted: 05.10.2023

DOI: 10.33048/mattrudy.2023.26.202


 English version:
Siberian Advances in Mathematics, 2023, 33:3, 181–189


© Steklov Math. Inst. of RAS, 2026