Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph
From MaRDI portal
Publication:6103986
DOI10.1214/22-aap1832zbMath1525.60112arXiv2006.01727OpenAlexW3033847703MaRDI QIDQ6103986
Takis Konstantopoulos, Sergeĭ Georgievich Foss, Artem V. Pyatkin
Publication date: 5 June 2023
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.01727
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Renewal theory (60K05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limit theorems for a random directed slab graph
- Linear extensions of a random partial order
- Nondifferentiability of the time constants of first-passage percolation
- Limiting properties of random graph models with vertex and edge weights
- Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
- A universality property for last-passage percolation paths close to the axis
- Long-range last-passage percolation on the line
- Convergence to the Tracy-Widom distribution for longest paths in a directed random graph
- On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
- Chain Lengths in Certain Random Directed Graphs
- Speed of parallel processing for random task graphs
- The Structure of Random Graph Orders
- Continuum cascade model of directed random graphs: traveling wave analysis
This page was built for publication: Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph