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

DOI10.1016/J.SPL.2022.109634zbMath1504.05265arXiv2112.14932OpenAlexW4287448525MaRDI QIDQ2081759

Bastien Mallein, Pavel Tesemnikov

Publication date: 30 September 2022

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.14932

zbMATH Keywords

food chainparallel processingChen-Stein methodrandom directed graphchain lengthdirected Erdős-Rényi graph

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits of dense graph sequences
• Poisson approximation for dependent trials
• Limiting properties of random graph models with vertex and edge weights
• Barak-Erdős graphs and the infinite-bin model
• Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
• On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• Chain Lengths in Certain Random Directed Graphs
• Coupling any number of balls in the infinite-bin model

This page was built for publication: On the length of the shortest path in a sparse Barak-Erdős graph