2 resultados para Extremal graphs
em Duke University
Resumo:
Estimation of the skeleton of a directed acyclic graph (DAG) is of great importance for understanding the underlying DAG and causal effects can be assessed from the skeleton when the DAG is not identifiable. We propose a novel method named PenPC to estimate the skeleton of a high-dimensional DAG by a two-step approach. We first estimate the nonzero entries of a concentration matrix using penalized regression, and then fix the difference between the concentration matrix and the skeleton by evaluating a set of conditional independence hypotheses. For high-dimensional problems where the number of vertices p is in polynomial or exponential scale of sample size n, we study the asymptotic property of PenPC on two types of graphs: traditional random graphs where all the vertices have the same expected number of neighbors, and scale-free graphs where a few vertices may have a large number of neighbors. As illustrated by extensive simulations and applications on gene expression data of cancer patients, PenPC has higher sensitivity and specificity than the state-of-the-art method, the PC-stable algorithm.
Resumo:
Extremal quantile index is a concept that the quantile index will drift to zero (or one)
as the sample size increases. The three chapters of my dissertation consists of three
applications of this concept in three distinct econometric problems. In Chapter 2, I
use the concept of extremal quantile index to derive new asymptotic properties and
inference method for quantile treatment effect estimators when the quantile index
of interest is close to zero. In Chapter 3, I rely on the concept of extremal quantile
index to achieve identification at infinity of the sample selection models and propose
a new inference method. Last, in Chapter 4, I use the concept of extremal quantile
index to define an asymptotic trimming scheme which can be used to control the
convergence rate of the estimator of the intercept of binary response models.
