Barak-Erdős graphs and the infinite-bin model
DOI10.1214/20-AIHP1141zbMath1483.05162arXiv1610.04043OpenAlexW3205970721MaRDI QIDQ2077352
Sanjay Ramassamy, Bastien Mallein
Publication date: 25 February 2022
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.04043
Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Applications of branching processes (60J85) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) The dynamics of infinite particle systems (70F45)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limit theorems for a random directed slab graph
- Branching random walk with selection at critical rate
- The longest path in a random graph
- Spatial growth of a branching process of particles living in \(R^ n\).
- Subadditive ergodic theory
- Brunet-Derrida behavior of branching-selection particle systems on the line
- Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
- Infinitely ramified point measures and branching Lévy processes
- 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
- Coupling any number of balls in the infinite-bin model
- $N$-Branching Random Walk with $\alpha$-Stable Spine
- Stochastic Sequences with a Regenerative Structure that May Depend Both on the Future and on the Past
This page was built for publication: Barak-Erdős graphs and the infinite-bin model
