Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
From MaRDI portal
Publication:2325381
DOI10.3150/18-BEJ1097zbMath1431.60124arXiv1712.09985OpenAlexW3105874619MaRDI QIDQ2325381
Sanjay Ramassamy, Bastien Mallein
Publication date: 25 September 2019
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.09985
random graphsinteracting particle systemslongest pathinfinite-bin modelBarak-Erdős graphstwo-sided Markov chains
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph ⋮ Unnamed Item ⋮ Barak-Erdős graphs and the infinite-bin model ⋮ On the length of the shortest path in a sparse Barak-Erdős graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limit theorems for a random directed slab graph
- Branching random walk with selection at critical rate
- Processes with long memory: Regenerative construction and perfect simulation
- Brunet-Derrida behavior of branching-selection particle systems on the line
- Barak-Erdős graphs and the infinite-bin model
- 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
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Stochastic Sequences with a Regenerative Structure that May Depend Both on the Future and on the Past
This page was built for publication: Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
