Continuum cascade model of directed random graphs: traveling wave analysis
From MaRDI portal
Abstract: We study a class of directed random graphs. In these graphs, the interval [0,x] is the vertex set, and from each yin [0,x], directed links are drawn to points in the interval (y,x] which are chosen uniformly with density one. We analyze the length of the longest directed path starting from the origin. In the large x limit, we employ traveling wave techniques to extract the asymptotic behavior of this quantity. We also study the size of a cascade tree composed of vertices which can be reached via directed paths starting at the origin.
Recommendations
Cited in
(7)- Limiting properties of random graph models with vertex and edge weights
- On the length of the shortest path in a sparse Barak-Erdős graph
- Impulsive processes on the weighted directed graphs
- Convergence to the Tracy-Widom distribution for longest paths in a directed random graph
- Convergence of directed random graphs to the Poisson-weighted infinite tree
- Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph
- Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models
This page was built for publication: Continuum cascade model of directed random graphs: traveling wave analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920329)