Luis E. Candelaria
Luis E. Candelaria has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Takuya Ura
University of California
1 shared publication - Yichong Zhang
Singapore Management University
1 shared publication
Latest Publications
- Open Access
Robust Inference in Locally Misspecified Bipartite Networks
This paper introduces a methodology to conduct robust inference in bipartite networks under local misspecification. We focus on a class of dyadic network models with misspecified conditional moment restrictions. The framework of misspecification is local, as the effect of misspecification varies with the sample size. We utilize this local asymptotic approach to construct a robust estimator that is minimax optimal for the mean square error within a neighborhood of misspecification. Additionally, we introduce bias-aware confidence intervals that account for the effect of the local misspecification. These confidence intervals have the correct asymptotic coverage for the true parameter of interest under sparse network asymptotics. Monte Carlo experiments demonstrate that the robust estimator performs well in finite samples and sparse networks. As an empirical illustration, we study the formation of a scientific collaboration network among economists.
Open AccessRobust Inference in Locally Misspecified Bipartite Networks
This paper introduces a methodology to conduct robust inference in bipartite networks under local misspecification. We focus on a class of dyadic network models with misspecified conditional moment restrictions. The framework of misspecification is local, as the effect of misspecification varies with the sample size. We utilize this local asymptotic approach to construct a robust estimator that is minimax optimal for the mean square error within a neighborhood of misspecification. Additionally, we introduce bias-aware confidence intervals that account for the effect of the local misspecification. These confidence intervals have the correct asymptotic coverage for the true parameter of interest under sparse network asymptotics. Monte Carlo experiments demonstrate that the robust estimator performs well in finite samples and sparse networks. As an empirical illustration, we study the formation of a scientific collaboration network among economists.
- Open Access
Identification and Inference of Network Formation Games with Misclassified Links
This paper considers a network formation model when links are potentially misclassified. We focus on a game-theoretical model of strategic network formation with incomplete information, in which the linking decisions depend on agents' exogenous attributes and endogenous network characteristics. In the presence of link misclassification, we derive moment conditions that characterize the identified set for the preference parameters associated with homophily and network externalities. Based on the moment equality conditions, we provide an inference method that is asymptotically valid when a single network of many agents is observed. Finally, we apply our misclassification-robust method to study the preference parameters of a lending network in rural villages in southern India.
Open AccessIdentification and Inference of Network Formation Games with Misclassified Links
This paper considers a network formation model when links are potentially misclassified. We focus on a game-theoretical model of strategic network formation with incomplete information, in which the linking decisions depend on agents' exogenous attributes and endogenous network characteristics. In the presence of link misclassification, we derive moment conditions that characterize the identified set for the preference parameters associated with homophily and network externalities. Based on the moment equality conditions, we provide an inference method that is asymptotically valid when a single network of many agents is observed. Finally, we apply our misclassification-robust method to study the preference parameters of a lending network in rural villages in southern India.