Last passage percolation on the complete graph

DOI10.1016/j.spl.2020.108798zbMath1455.60133OpenAlexW3022992941MaRDI QIDQ2006747

Rui Zhu, Feng Wang, Xian Yuan Wu

Publication date: 12 October 2020

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

Full work available at URL: https://doi.org/10.1016/j.spl.2020.108798

zbMATH Keywords

random graphtime constantlast passage percolationlaw of large numberdeviation probabilityDepth-First-Search algorithm

Mathematics Subject Classification ID

Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

Submodular functions and rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short paths for first passage percolation on the complete graph
• The size Ramsey number of a directed path
• Heavy tails in last-passage percolation
• An improved subadditive ergodic theorem
• The longest path in a random graph
• Departures from many queues in series
• Limiting shape for directed percolation models
• Optimal tail estimates for directed last passage site percolation with geometric random variables
• Shape fluctuations and random matrices
• A universality property for last-passage percolation paths close to the axis
• Paths in graphs