On the length of the shortest path in a sparse Barak–Erdős graph

Bastien Mallein and Pavel Tesemnikov

Statistics & Probability Letters, 2022, vol. 190, issue C

Abstract: We consider an inhomogeneous version of the Barak–Erdős graph, i.e. a directed Erdős–Rényi random graph on {1,…,n} with no loop. Given f a Riemann-integrable non-negative function on [0,1]2 and γ>0, we define G(n,f,γ) as the random graph with vertex set {1,…,n} such that for each iKeywords: Chain length; Directed Erdos–Renyi graph; Food chain; Parallel processing; Random directed graph; Chen–Stein method (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715222001651
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:190:y:2022:i:c:s0167715222001651

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.109634

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 ().