Polynomial Time Relatively Computable Triangular Arrays in a Multinomial\n Setting

2016/03/18 by Vladimir Dobrić, Dobric, Vladimir, Patricia Garmirian +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #60F15 #68Q17 #68Q25 #Cellular Automata and Applications #Computability, Logic, AI Algorithms #DNA and Biological Computing #FOS: Mathematics #Primary: 60G50 #Probability (math.PR) #Secondary: 68Q15

paper · pdf · doi:10.48550/arxiv.1603.06006

openalex publication_date 2016/03/18 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

We extend the methods and results of [arXiv 1603.04896] to the setting of\nmultinomial distributions satisfying certain properties. These include all the\nmultinomial distributions arising from the direct proof of the Central Limit\nTheorem given in [arXiv: 1507.00357], which, by results of that paper,\nconstitutes essentially full generality for the situations in which the Central\nLimit Theorem holds.\n

Related

• Central limit theorem for triangular arrays of Non-Homogeneous Markov chains
• Superconvergence in free probability limit theorems for arbitrary triangular arrays
• A central limit theorem for m-dependent variables
• Matrix multinomial distribution
• The Mahonian probability distribution on words is asymptotically normal