Exponential Inequalities for the Distribution Tails of the Number of Cycles in the Erdös-Rényi Random Graphs

A. A. Bystrov; N. V. Volodko

doi:10.1134/S105513442202002X

Exponential Inequalities for the Distribution Tails of the Number of Cycles in the Erdös-Rényi Random Graphs

Research output: Contribution to journal › Article › peer-review

Abstract

An exponential upper bound is obtained for the tail probability of the centered andnormalized number of cycles in an Erdös-Rényi random graph where every edgeoccurs with the same probability, independently of the others.

Original language	English
Pages (from-to)	87-93
Number of pages	7
Journal	Siberian Advances in Mathematics
Volume	32
Issue number	2
DOIs	https://doi.org/10.1134/S105513442202002X
Publication status	Published - May 2022

Keywords

cycle
Erdös-Rényi random graph
exponential inequality
number of subgraphs

OECD FOS+WOS

1.01 MATHEMATICS

Access to Document

10.1134/S105513442202002X

Cite this

@article{76b3006792a74231ac0b5769b5e730cd,

title = "Exponential Inequalities for the Distribution Tails of the Number of Cycles in the Erd{\"o}s-R{\'e}nyi Random Graphs",

abstract = "An exponential upper bound is obtained for the tail probability of the centered andnormalized number of cycles in an Erd{\"o}s-R{\'e}nyi random graph where every edgeoccurs with the same probability, independently of the others.",

keywords = "cycle, Erd{\"o}s-R{\'e}nyi random graph, exponential inequality, number of subgraphs",

author = "Bystrov, {A. A.} and Volodko, {N. V.}",

note = "Funding Information: The work was supported by the Russian Science Foundation (grant 22-21-00414). Publisher Copyright: {\textcopyright} 2022, Pleiades Publishing, Ltd.",

year = "2022",

month = may,

doi = "10.1134/S105513442202002X",

language = "English",

volume = "32",

pages = "87--93",

journal = "Siberian Advances in Mathematics",

issn = "1055-1344",

publisher = "PLEIADES PUBLISHING INC",

number = "2",

}

TY - JOUR

T1 - Exponential Inequalities for the Distribution Tails of the Number of Cycles in the Erdös-Rényi Random Graphs

AU - Bystrov, A. A.

AU - Volodko, N. V.

PY - 2022/5

Y1 - 2022/5

N2 - An exponential upper bound is obtained for the tail probability of the centered andnormalized number of cycles in an Erdös-Rényi random graph where every edgeoccurs with the same probability, independently of the others.

AB - An exponential upper bound is obtained for the tail probability of the centered andnormalized number of cycles in an Erdös-Rényi random graph where every edgeoccurs with the same probability, independently of the others.

KW - cycle

KW - Erdös-Rényi random graph

KW - exponential inequality

KW - number of subgraphs

UR - http://www.scopus.com/inward/record.url?scp=85132111685&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/41ef73fc-3e4a-3445-9c95-ccc883839278/

U2 - 10.1134/S105513442202002X

DO - 10.1134/S105513442202002X

M3 - Article

AN - SCOPUS:85132111685

VL - 32

SP - 87

EP - 93

JO - Siberian Advances in Mathematics

JF - Siberian Advances in Mathematics

SN - 1055-1344

IS - 2

ER -

Exponential Inequalities for the Distribution Tails of the Number of Cycles in the Erdös-Rényi Random Graphs

Abstract

Keywords

OECD FOS+WOS

Access to Document

Other files and links

Fingerprint

Cite this