Abstract

http://ssrn.com/abstract=2295723
 


 



Maximum Entropy Bootstrap Simulations for Variance Estimation


Hrishikesh D. Vinod


Fordham University - Department of Economics

July 18, 2013


Abstract:     
We report a simulation study where we want to consider a fairly simple data generating process (DGP) used in Nordman and Lahiri (JASA, 2012) with a single fixed regressor and regression errors produced by simple AR(1) processes. We focus on the estimation of standard errors of regression coefficients, not the coefficients themselves. We compare confidence intervals by three inference procedures: the usual Chi-square distribution (Chi-sq), the moving blocks bootstrap (MBB) and a newer maximum entropy bootstrap (meboot). Since simulations have a known true standard error, we can assess the coverage and consistency of the meboot. The traditional Chi-sq confidence intervals have very poor coverage, suggesting that they should not be used in the presence of auto-correlated errors. We also consider the advisability of symmetrizing transformation of the ME density by repeating the experiments. We find that symmetrizing offers a slight advantage. Since the meboot appears to be generally superior to others, it can be recommended.

Number of Pages in PDF File: 18

Keywords: auto-correlated errors, symmetrizing transform, moving block bootstrap, simulation, maximum entropy, variance estimation

JEL Classification: C22, C23, C15

working papers series


Download This Paper

Date posted: July 19, 2013  

Suggested Citation

Vinod, Hrishikesh D., Maximum Entropy Bootstrap Simulations for Variance Estimation (July 18, 2013). Available at SSRN: http://ssrn.com/abstract=2295723 or http://dx.doi.org/10.2139/ssrn.2295723

Contact Information

Hrishikesh D. Vinod (Contact Author)
Fordham University - Department of Economics ( email )
Dealy Hall
Bronx, NY 10458
United States
718-817-4065 (Phone)
718-817-3518 (Fax)
Feedback to SSRN


Paper statistics
Abstract Views: 276
Downloads: 71
Download Rank: 187,417

© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollo6 in 0.469 seconds