The scaling limit of a critical random directed graph
From MaRDI portal
Publication:6104019
DOI10.1214/22-aap1859zbMath1511.60019arXiv1905.05397OpenAlexW2945721769MaRDI QIDQ6104019
Robin Stephenson, Christina Goldschmidt
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/1905.05397
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path-based depth-first search for strong and biconnected components
- Critical random graphs: limiting constructions and distributional properties
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Random trees and applications
- Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Local limits of Markov branching trees and their volume growth
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- The continuum limit of critical random graphs
- The critical behavior of random digraphs
- The transitive closure of a random digraph
- The phase transition in the evolution of random digraphs
- Tessellations of random maps of arbitrary genus
- The distribution of the maximum Brownian excursion
- Markov Chains
- Depth-First Search and Linear Graph Algorithms
- The critical window in random digraphs
This page was built for publication: The scaling limit of a critical random directed graph