scientific article; zbMATH DE number 3789647
From MaRDI portal
Publication:3966899
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Discrete mathematics in relation to computer science (68R99)
Cited in
(9)- A conversation with Jim Pitman
- Barak-Erdős graphs and the infinite-bin model
- Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
- The Hilbert-Galton board
- Coupling any number of balls in the infinite-bin model
- Low order polynomial bounds on the expected performance of local improvement algorithms
- Estimation of the last passage percolation constant in a charged complete directed acyclic graph via perfect simulation
- Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models
- Freezing in the infinite-bin model
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 Q3966899)