Pages that link to "Item:Q3415892"
From MaRDI portal
The following pages link to Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains (Q3415892):
Displayed 13 items.
- On rotations in fringe-balanced binary trees (Q293176) (← links)
- The limiting behaviour of a stochastic patch occupancy model (Q365685) (← links)
- Random sprouts as internet models, and Pólya processes (Q707453) (← links)
- On the expected height of fringe-blanced trees (Q1323353) (← links)
- Occupancy urn models in the analysis of algorithms (Q1347968) (← links)
- Variance in randomized play-the-winner clinical trials (Q1373967) (← links)
- Analytic urns (Q1781182) (← links)
- Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. (Q1874394) (← links)
- Functional limit theorems for multitype branching processes and generalized Pólya urns. (Q2574638) (← links)
- Analysis of a stochastic approximation algorithm for computing quasi-stationary distributions (Q2830881) (← links)
- Limit Theorems for Random Triangular URN Schemes (Q3182434) (← links)
- Universal Limit Laws for Depths in Random Trees (Q4210155) (← links)
- An almost sure result for path lengths in binary search trees (Q4449502) (← links)