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

Alexander A. Bystrov and Nadezhda V. Volodko

Statistics & Probability Letters, 2023, vol. 195, issue C

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.

Keywords: Erdös–Rényi graph; Number of subgraphs; Hoeffding-type exponential inequalities (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715222002760
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:195:y:2023:i:c:s0167715222002760

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2022.109763

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().