Depth-first search performance in a random digraph with geometric outdegree distribution
From MaRDI portal
Publication:6130352
DOI10.1007/s44007-024-00085-2arXiv2212.14865OpenAlexW4392363663MaRDI QIDQ6130352
No author found.
Publication date: 2 April 2024
Published in: La Matematica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.14865
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stopping times and tightness
- Dependent central limit theorems and invariance principles
- On the performance of the depth first search algorithm in supercritical random graphs
- Functional CLT for nonstationary strongly mixing processes
- The phase transition in random graphs: A simple proof
- Orthogonal decompositions and functional limit theorems for random graph statistics
- Limiting shape of the depth first search tree in an Erdős‐Rényi graph
- Martingale Central Limit Theorems
- Probability: A Graduate Course