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

DOI10.33048/SEMI.2018.15.129MaRDI QIDQ2633393zbMATH OpenOpenAlexFDO

Authors Pavel Tesemnikov

Publication date 8 May 2019

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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

zbMATH Keywords

Barak-Erdős directed graphboundary pointsfirst-passage percolationgraph connectivityminimal distancerandom graph

Mathematics Subject Classification ID

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

Recommendations

• On the length of the shortest path in a sparse Barak-Erdős graph
• First passage percolation on random graphs with finite mean degrees
• Barak-Erdős graphs and the infinite-bin model
• Extremal paths in inhomogenous random graphs
• Weak disorder in the stochastic mean-field model of distance. II

Cites work

• 50 Years of First-Passage Percolation
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 2051870 (Why is no real title available?)
• Limit theorems for a random directed slab graph
• Long-range last-passage percolation on the line
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• Speed of parallel processing for random task graphs

Cited in

(3)

• 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
• Two-sided infinite-bin models and analyticity for Barak-Erdős graphs

This page was built for publication: On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633393)