Guardado en:
Detalles Bibliográficos
Autor principal: Takahashi, Hayato
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:https://arxiv.org/abs/2302.14356
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915679594086400
author Takahashi, Hayato
author_facet Takahashi, Hayato
contents We present explicit formulae for parameterized families of probabilities of the number of nonoverlapping words and increasing nonoverlapping words in independent and identically distributed (i.i.d.) finite valued random variables, respectively. Then we provide an explicit formula for a parameterized family of probabilities of the number of runs, which generalizes \(μ\)-overlapping probabilities for \(μ\geq 0\) in i.i.d.~binary valued random variables. We also demonstrate exact probabilities of the number of runs whose size are exactly given numbers (Mood 1940). The number of arithmetic operations required to compute our formula for generalized probabilities of runs is linear order of sample size for fixed number of parameters and range. To analyse these number of arithmetic operations for unbounded number of parameters, we show an asymptotic formula for the number of integer partitions that are less than or equal to given number as a special case of Meinardus's theorem.
format Preprint
id arxiv_https___arxiv_org_abs_2302_14356
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Universal parameterized family of distributions of runs
Takahashi, Hayato
Probability
Statistics Theory
05A15, 62E15, 11P82
We present explicit formulae for parameterized families of probabilities of the number of nonoverlapping words and increasing nonoverlapping words in independent and identically distributed (i.i.d.) finite valued random variables, respectively. Then we provide an explicit formula for a parameterized family of probabilities of the number of runs, which generalizes \(μ\)-overlapping probabilities for \(μ\geq 0\) in i.i.d.~binary valued random variables. We also demonstrate exact probabilities of the number of runs whose size are exactly given numbers (Mood 1940). The number of arithmetic operations required to compute our formula for generalized probabilities of runs is linear order of sample size for fixed number of parameters and range. To analyse these number of arithmetic operations for unbounded number of parameters, we show an asymptotic formula for the number of integer partitions that are less than or equal to given number as a special case of Meinardus's theorem.
title Universal parameterized family of distributions of runs
topic Probability
Statistics Theory
05A15, 62E15, 11P82
url https://arxiv.org/abs/2302.14356