Standard

Exponential inequalities for the number of subgraphs in the Erdös–Rényi random graph. / Bystrov, Alexander A.; Volodko, Nadezhda V.

в: Statistics and Probability Letters, Том 195, 109763, 04.2023.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Bystrov, AA & Volodko, NV 2023, 'Exponential inequalities for the number of subgraphs in the Erdös–Rényi random graph', Statistics and Probability Letters, Том. 195, 109763. https://doi.org/10.1016/j.spl.2022.109763

APA

Bystrov, A. A., & Volodko, N. V. (2023). Exponential inequalities for the number of subgraphs in the Erdös–Rényi random graph. Statistics and Probability Letters, 195, [109763]. https://doi.org/10.1016/j.spl.2022.109763

Vancouver

Bystrov AA, Volodko NV. Exponential inequalities for the number of subgraphs in the Erdös–Rényi random graph. Statistics and Probability Letters. 2023 апр.;195:109763. doi: 10.1016/j.spl.2022.109763

Author

Bystrov, Alexander A. ; Volodko, Nadezhda V. / Exponential inequalities for the number of subgraphs in the Erdös–Rényi random graph. в: Statistics and Probability Letters. 2023 ; Том 195.

BibTeX

@article{35693ed7337647469ac612d56af5cf17,
title = "Exponential inequalities for the number of subgraphs in the Erd{\"o}s–R{\'e}nyi random graph",
abstract = "Let Rn be the centered and normalized number of copies of a fixed graph G contained in the Erd{\"o}s–R{\'e}nyi graph with n vertices. We obtain upper exponential inequalities for the tail probabilities of Rn, which are uniform in n.",
keywords = "Erd{\"o}s–R{\'e}nyi graph, Hoeffding-type exponential inequalities, Number of subgraphs",
author = "Bystrov, {Alexander A.} and Volodko, {Nadezhda V.}",
note = "This work was partially supported by the program of basic research of SB RAS, Russia (pr. No. FWNF-2022-0010 ).",
year = "2023",
month = apr,
doi = "10.1016/j.spl.2022.109763",
language = "English",
volume = "195",
journal = "Statistics and Probability Letters",
issn = "0167-7152",
publisher = "Elsevier Science B.V.",

}

RIS

TY - JOUR

T1 - Exponential inequalities for the number of subgraphs in the Erdös–Rényi random graph

AU - Bystrov, Alexander A.

AU - Volodko, Nadezhda V.

N1 - This work was partially supported by the program of basic research of SB RAS, Russia (pr. No. FWNF-2022-0010 ).

PY - 2023/4

Y1 - 2023/4

N2 - Let Rn be the centered and normalized number of copies of a fixed graph G contained in the Erdös–Rényi graph with n vertices. We obtain upper exponential inequalities for the tail probabilities of Rn, which are uniform in n.

AB - Let Rn be the centered and normalized number of copies of a fixed graph G contained in the Erdös–Rényi graph with n vertices. We obtain upper exponential inequalities for the tail probabilities of Rn, which are uniform in n.

KW - Erdös–Rényi graph

KW - Hoeffding-type exponential inequalities

KW - Number of subgraphs

UR - https://www.scopus.com/inward/record.url?eid=2-s2.0-85146005393&partnerID=40&md5=975f6111e110d63f0441828f77d9722d

UR - https://www.mendeley.com/catalogue/adb6bdea-fab7-382e-9156-beafbda1c269/

U2 - 10.1016/j.spl.2022.109763

DO - 10.1016/j.spl.2022.109763

M3 - Article

VL - 195

JO - Statistics and Probability Letters

JF - Statistics and Probability Letters

SN - 0167-7152

M1 - 109763

ER -

ID: 49216529