.png){kind=icon}
.png){kind=icon}
Return
Kernel density estimation for undirected dyadic data
.png){kind=icon}
OA
AI
DOI：10.1016/j.jeconom.2022.06.011.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study nonparametric estimation of density functions for undirected dyadic random def equivalent to ( N variables (i.e., random variables defined for all n ) unordered pairs of agents/nodes 2 in a weighted network of order N ). These random variables satisfy a local dependence property: any random variables in the network that share one or two indices may be dependent, while those sharing no indices in common are independent. In this setting, we show that density functions may be estimated by an application of the kernel estimation method of Rosenblatt (1956) and Parzen (1962). We suggest an estimate of their asymptotic variances inspired by a combination of (i) Newey's (1994) method of variance estimation for kernel estimators in the monadicsetting and (ii) a variance estimator for the (estimated) density of a simple network first suggested by Holland and Leinhardt (1976). More unusual are the rates of convergence and asymptotic (normal) distributions of our dyadic density estimates. Specifically, we show that they converge at the same rate as the (unconditional) dyadic sample mean: the square root of the number, N , of nodes. This differs from the results for nonparametric estimation of densities and regression functions for monadic data, which generally have a slower rate of convergence than their corresponding sample mean. (c) 2022 Published by Elsevier B.V.
Keywords:
Networks
Dyads
Kernel density estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
5.2K
Citations:
3.0W
