scientific article; zbMATH DE number 2051870
From MaRDI portal
Publication:4453893
Recommendations
- scientific article; zbMATH DE number 1995543
- Limit theorems for generalized renewal processes
- A correction and some additional remarks on: Stationary solutions of stochastic recursions describing discrete event systems
- Non-linear Renewal Theory with Stationary Perturbations
- A non-linear renewal theorem with stationary and slowly changing perturbations
Cited in
(23)- Backward coalescence times for perfect simulation of chains with infinite memory
- On the strong stability of ergodic iterations
- Limit theorems for a random directed slab graph
- A generalized backward scheme for solving nonmonotonic stochastic recursions
- Limiting properties of random graph models with vertex and edge weights
- Estimation of the last passage percolation constant in a charged complete directed acyclic graph via perfect simulation
- Coupling any number of balls in the infinite-bin model
- Regularity of the time constant for last passage percolation on complete directed acyclic graphs
- On the asymptotics for the minimal distance between extreme vertices in a generalised Barak-Erdős graph
- Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models
- The Hilbert-Galton board
- Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges
- Long-range last-passage percolation on the line
- Doeblin trees
- Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph
- Convergence of directed random graphs to the Poisson-weighted infinite tree
- Stochastic Sequences with a Regenerative Structure that May Depend Both on the Future and on the Past
- Barak-Erdős graphs and the infinite-bin model
- On the length of the shortest path in a sparse Barak-Erdős graph
- Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
- Freezing in the infinite-bin model
- Transition of -mixing in random iterations with applications in queuing theory
- Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453893)
