Random sprouts as internet models, and Pólya processes
From MaRDI portal
Publication:707453
DOI10.1007/S00236-004-0146-YzbMath1057.68080OpenAlexW1999740065MaRDI QIDQ707453
Publication date: 9 February 2005
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-004-0146-y
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
First-passage properties of the Pólya urn process ⋮ Distributions in the Ehrenfest process ⋮ Exact and limiting distributions in diagonal Pólya processes ⋮ Unbalanced multi-drawing urn with random addition matrix
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rotations in fringe-balanced binary trees
- Probabilistic analysis of bucket recursive trees
- Martingale functional central limit theorems for a generalized Pólya urn
- A time-dependent version of Pólya's urn
- On the distribution of leaves in rooted subtrees of recursive trees
- A martingale approach to strong convergence in a generalized Pólya- Eggenberger urn model
- Central limit theorems for urn models
- The size of random bucket trees via urn models
- Birth and death processes on certain random trees: classification and stationary laws
- On generalized Pólya urn models
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
- Limit laws for local counters in random binary search trees
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
- Random recursive forests
- Strong convergence of proportions in a multicolor Pólya urn
- On the covariance of the level sizes in random recursive trees
- On the structure of random plane‐oriented recursive trees and their branches
- POLYA URN MODELS UNDER GENERAL REPLACEMENT SCHEMES
- Bernard Friedman's Urn
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- A simple urn model
This page was built for publication: Random sprouts as internet models, and Pólya processes
