Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems

1968/12/01 by Krishna B. Athreya, Samuel Karlin · 19 citations
Mathematics · #Stochastic processes and statistical mechanics

paper · pdf · doi:10.1214/aoms/1177698013

Cited by

• Degrees in random m-ary hooking networks
• Smoothing equations for large Pólya urns
• Functional law of large numbers and central limit theorem for Crump-Mode-Jagers branching processes
• Estimation of First Returning Speed in Null Recurrent Continuous-Time Markov Chains
• A theory of maximum likelihood for weighted infection graphs
• Bit flipping and time to recover
• Congruence properties of depths in some random trees
• Degree centrality and root finding in growing random networks
• Permutations in competing growth processes and balls-in-bins
• Normalized matching property for competing urn models
• Distributions in the Ehrenfest process
• Multi-drawing Pólya urns via labelled random DAGs
• High-dimensional bootstrap processes in evolving simplicial complexes
• Self-similar real trees defined as fixed-points and their geometric properties
• Distributions in the constant-differentials Pólya process
• Fluctuation Theorems for Synchronization of Interacting Polya's urns
• Periodic P 'olya Urns, the Density Method, and Asymptotics of Young\n Tableaux
• Non-Selective Evolution of Growing Populations. [europepmc]
• Ages, sizes and (trees within) trees of taxa and of urns, from Yule to today. [europepmc]