A reconstruction of Ewens' sampling formula via lists of coins

DOI10.1007/978-3-031-15629-8_18zbMath1524.68137OpenAlexW4297922682MaRDI QIDQ6108901

No author found.

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15629-8_18

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems
• The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
• The ubiquitous Ewens sampling formula
• A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
• The sampling theory of selectively neutral alleles
• A Bayesian analysis of some nonparametric problems
• How many clusters?
• The Representation of Partition Structures
• A testing scenario for probabilistic processes
• Random partitions in population genetics
• Partition structures and sufficient statistics
• Random discrete distributions invariant under size-biased permutation
• CONCUR 2003 - Concurrency Theory

This page was built for publication: A reconstruction of Ewens' sampling formula via lists of coins