Pages that link to "Item:Q2431087"
From MaRDI portal
The following pages link to Long and short paths in uniform random recursive dags (Q2431087):
Displaying 11 items.
- The degree profile in some classes of random graphs that generalize recursive trees (Q479165) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- Approximating the longest path length of a stochastic DAG by a normal distribution in linear time (Q1044026) (← links)
- On the length of the shortest path in a sparse Barak-Erdős graph (Q2081759) (← links)
- Depth properties of scaled attachment random recursive trees (Q2909243) (← links)
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
- Longest Path Distance in Random Circuits (Q3168445) (← links)
- On martingale tail sums in affine two-color urn models with multiple drawings (Q4684841) (← links)
- Shape Measures of Random Increasing <i>k</i>-trees (Q5366914) (← links)
- The number of descendants in a random directed acyclic graph (Q6201041) (← links)
- Archaeology of random recursive dags and Cooper-Frieze random networks (Q6632782) (← links)
