On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph

DOI10.33048/semi.2018.15.129zbMath1411.05236OpenAlexW3015822616MaRDI QIDQ2633393

Pavel Tesemnikov

Publication date: 8 May 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2018.15.129

zbMATH Keywords

random graphgraph connectivityfirst-passage percolationminimal distanceboundary pointsBarak-Erdős directed graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges ⋮ On the length of the shortest path in a sparse Barak-Erdős graph

Cites Work

• Unnamed Item
• Unnamed Item
• Limit theorems for a random directed slab graph
• Long-range last-passage percolation on the line
• 50 Years of First-Passage Percolation
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• Speed of parallel processing for random task graphs