Several aspects of the analysis of two successive survival times are considered. All the analyses take into account the dependent censoring on the second time induced by the first. Three nonparametric methods are described, implemented and applied to the data coming from a multicentre clinical trial for HIV-infected patients. Visser's and Wang and Wells methods propose an estimator for the bivariate survival function while Gómez and Serrat's method presents a conditional approach for the second...
A partir de una muestra de datos de supervivencia que contiene valores no observados en las covariantes de interés, presentamos una metodología que permite extraer toda la información contenida en covariantes completamente observadas, que estén fuertemente correlacionadas con las citadas covariantes de interés. El enfoque utilizado es completamente paramétrico y se basa en el método de máxima verosimilitud. Mostramos las dificultades, tanto de índole práctica como filosófica, que aparecen en la...
Este artículo es una transcripción de las conferencias dictadas en la mesa organizada en el 4º Congreso Galego de Estatistica y Investigación de Operacions que tuvo lugar en Santiago de Compostela en noviembre de 1999. Los autores discuten sobre el posible uso o abuso de la estadística en artículos científicos, sobre lo que se necesitaría para alcanzar la interdisciplinariedad y lo que se entiende por éxito profesional. Se define la disciplina (bioestadística) y se identifica a sus profesionales...
We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A path (or a cycle) is called monochromatic if all of its arcs are colored alike. A cycle is called a quasi-monochromatic cycle if with at most one exception all of its arcs are colored alike. A subdigraph H in D is called rainbow if all its arcs have different colors. A set N ⊆ V(D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices...
We call a digraph D an m-colored digraph if the arcs of D are colored with m colors. A directed path (or a directed cycle) is called monochromatic if all of its arcs are colored alike. A subdigraph H in D is called rainbow if all of its arcs have different colors. A set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the two following conditions: for every pair of different vertices u, v ∈ N there is no monochromatic path in D between them, and for every vertex x ∈ V...
Download Results (CSV)