scientific article; zbMATH DE number 7799661
From MaRDI portal
Publication:6146302
arXiv2110.01559MaRDI QIDQ6146302
Sanjay Ramassamy, Sergeĭ Georgievich Foss, Takis Konstantopoulos, Bastien Mallein
Publication date: 5 February 2024
Full work available at URL: https://arxiv.org/abs/2110.01559
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov processstationarityrandom graphperfect simulationlast passage percolationcoupling (from the past)
Random graphs (graph-theoretic aspects) (05C80) Stationary stochastic processes (60G10) Markov renewal processes, semi-Markov processes (60K15) Monte Carlo methods applied to problems in statistical mechanics (82M31)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limit theorems for a random directed slab graph
- Subadditive ergodic theory
- Limiting properties of random graph models with vertex and edge weights
- Processes with long memory: Regenerative construction and perfect simulation
- Stochastically recursive sequences and their generalizations
- Barak-Erdős graphs and the infinite-bin model
- On the length of the shortest path in a sparse Barak-Erdős graph
- RSK in last passage percolation: a unified approach
- Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
- Long-range last-passage percolation on the line
- Convergence to the Tracy-Widom distribution for longest paths in a directed random graph
- 50 Years of First-Passage Percolation
- 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
- Perfect simulation and backward coupling∗
- Coupling any number of balls in the infinite-bin model
- Exact sampling with coupled Markov chains and applications to statistical mechanics
This page was built for publication:
