Limit Theorems for Network Dependent Random Variables
This paper is concerned with cross-sectional dependence arising because observations are interconnected through an observed network. Following Doukhan and Louhichi (1999), we measure the strength of dependence by covariances of nonlinearly transformed variables. We provide a law of large numbers and central limit theorem for network dependent variables. We also provide a method of calculating standard errors robust to general forms of network dependence. For that purpose, we rely on a network heteroskedasticity and autocorrelation consistent (HAC) variance estimator, and show its consistency. The results rely on conditions characterized by tradeoffs between the rate of decay of dependence across a network and network's denseness. Our approach can accommodate data generated by network formation models, random fields on graphs, conditional dependency graphs, and large functional-causal systems of equations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Limit theorems of Chatterjee's rank correlation
Establishing the limiting distribution of Chatterjee's rank correlation for a general, possibly non-independent, pair of random variables has been eagerly awaited by many. This paper shows that (a) Chatterjee's rank corr…
Normal Approximation for U-Statistics with Cross-Sectional Dependence
We establish normal approximation in the Wasserstein metric and central limit theorems for both non-degenerate and degenerate U-statistics with cross-sectionally dependent samples using Stein's method. For the non-degene…
Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer
Stochastic separation theorems play important role in high-dimensional data analysis and machine learning. It turns out that in high dimension any point of a random set of points can be separated from other points by a h…
Consistent Kernel Mean Estimation for Functions of Random Variables
We provide a theoretical foundation for non-parametric estimation of functions of random variables using kernel mean embeddings. We show that for any continuous function $f$, consistent estimators of the mean embedding o…
Probabilistic ProgrammingInference in Models of Discrete Choice with Social Interactions Using Network Data
This paper studies inference in models of discrete choice with social interactions when the data consists of a single large network. We provide theoretical justification for the use of spatial and network HAC variance es…