Standard

Exponential Inequalities for the Tail Probabilities of the Number of Cycles in Generalized Random Graphs. / Bystrov, A. A.; Volodko, N. V.

In: Siberian Advances in Mathematics, Vol. 33, No. 3, 08.2023, p. 181-189.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Bystrov AA, Volodko NV. Exponential Inequalities for the Tail Probabilities of the Number of Cycles in Generalized Random Graphs. Siberian Advances in Mathematics. 2023 Aug;33(3):181-189. doi: 10.1134/S1055134423030021

Author

BibTeX

@article{ad6afc71545f4149886c52ea5a474e4a,
title = "Exponential Inequalities for the Tail Probabilities of the Number of Cycles in Generalized Random Graphs",
abstract = "Let Rn be the centered and normalized number of cycles offixed length contained in a generalized random graph with n vertices. We obtain a H{\"o}ffding-typeexponential inequality for the tail probability of Rn.",
keywords = "H{\"o}ffding{\textquoteright}s inequality, cycle, number of subgraphs, random graph",
author = "Bystrov, {A. A.} and Volodko, {N. V.}",
note = "The work was supported by the Russian Science Foundation (project No. 22-21-00414). Публикация для корректировки.",
year = "2023",
month = aug,
doi = "10.1134/S1055134423030021",
language = "English",
volume = "33",
pages = "181--189",
journal = "Siberian Advances in Mathematics",
issn = "1055-1344",
publisher = "PLEIADES PUBLISHING INC",
number = "3",

}

RIS

TY - JOUR

T1 - Exponential Inequalities for the Tail Probabilities of the Number of Cycles in Generalized Random Graphs

AU - Bystrov, A. A.

AU - Volodko, N. V.

N1 - The work was supported by the Russian Science Foundation (project No. 22-21-00414). Публикация для корректировки.

PY - 2023/8

Y1 - 2023/8

N2 - Let Rn be the centered and normalized number of cycles offixed length contained in a generalized random graph with n vertices. We obtain a Höffding-typeexponential inequality for the tail probability of Rn.

AB - Let Rn be the centered and normalized number of cycles offixed length contained in a generalized random graph with n vertices. We obtain a Höffding-typeexponential inequality for the tail probability of Rn.

KW - Höffding’s inequality

KW - cycle

KW - number of subgraphs

KW - random graph

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85169695684&origin=inward&txGid=be74fa2a2406c987c497902b74f8d8ef

UR - https://www.mendeley.com/catalogue/d658d7f7-485f-3ba0-834b-879f28f1ab97/

U2 - 10.1134/S1055134423030021

DO - 10.1134/S1055134423030021

M3 - Article

VL - 33

SP - 181

EP - 189

JO - Siberian Advances in Mathematics

JF - Siberian Advances in Mathematics

SN - 1055-1344

IS - 3

ER -

ID: 59563493