Sciact
  • EN
  • RU

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

Journal Statistics and Probability Letters
ISSN: 0167-7152
Output data Year: 2023, Volume: 195, Article number : 109763, Pages count : DOI: 10.1016/j.spl.2022.109763
Tags Erdös–Rényi graph, Number of subgraphs, Hoeffding-type exponential inequalities
Authors Bystrov А.А. 1,2 , Volodko N.V. 1,2
Affiliations
1 Novosibirsk State University, 1, Pirogova str., 630090 Novosibirsk, Russia
2 Sobolev Institute of Mathematics of RAS, 4 Acad. Koptyug avenue, 630090 Novosibirsk, Russia

Funding (1)

1 Sobolev Institute of Mathematics FWNF-2022-0010

Abstract: 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.
Cite: Bystrov А.А. , Volodko N.V.
Exponential inequalities for the number of subgraphs in the Erdös–Rényi random graph
Statistics and Probability Letters. 2023. V.195. 109763 . DOI: 10.1016/j.spl.2022.109763 WOS Scopus РИНЦ OpenAlex
Dates:
Submitted: Jan 20, 2021
Accepted: Dec 21, 2022
Published online: Dec 28, 2022
Published print: Apr 20, 2023
Identifiers:
Web of science: WOS:000916216500001
Scopus: 2-s2.0-85146005393
Elibrary: 60486440
OpenAlex: W4313418949
Citing:
DB Citing
Scopus 2
Web of science 1
OpenAlex 1
Altmetrics: