Bayesian inference for multinomial probabilities from a stopping time sample information

M. R. Sillero Denamiel, P. Ramirez Cobo, B. Vidakovic

We undertake Bayesian inference of multinomial probabilities associated with a finite alphabet, under incomplete experimental information. Specifically, we observe the stopping time variable representing the number of letters needed to see a particular pattern for the first time. The procedure is extended to the case where for two fixed words, one appeared before the other. An application of the method to a reliability problem will be shown.

Palabras clave: Patterns, stopping times, incomplete experimental information, exact Bayesian inference

GT11.BAYES3 Sesión Invitada
9 de noviembre de 2023  16:50
HC4: Sala Sacristía

M. Kalli, J. Griffin

J. M. Camacho Rodriguez, R. Naveiro, D. Rios Insua

M. Martínez Pizarro, M. Parra Arévalo, E. López Sanjuán, J. Martín Jiménez