Kernel density estimation for undirected dyadic data
From MaRDI portal
Publication:6199653
DOI10.1016/J.JECONOM.2022.06.011arXiv1907.13630OpenAlexW4288275776MaRDI QIDQ6199653FDOQ6199653
Authors: Bryan S. Graham, Fengshi Niu, James L. Powell
Publication date: 21 March 2024
Published in: Journal of Econometrics (Search for Journal in Brave)
Abstract: We study nonparametric estimation of density functions for undirected dyadic random variables (i.e., random variables defined for all noverset{def}{equiv} binom{N}{2} unordered pairs of agents/nodes 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 "monadic" setting 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.
Full work available at URL: https://arxiv.org/abs/1907.13630
Statistics (62-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)
Cites Work
- Title not available (Why is that?)
- Large networks and graph limits
- A survey of statistical network models
- Title not available (Why is that?)
- Semiparametric estimation of censored selection models with a nonparametric selection mechanism
- Remarks on Some Nonparametric Estimates of a Density Function
- Asymptotic Statistics
- Semiparametric Estimation of Index Coefficients
- On Estimation of a Probability Density Function and Mode
- The method of moments and degree distributions for network models
- Title not available (Why is that?)
- Representations for partially exchangeable arrays of random variables
- Graph limits and exchangeable random graphs
- Kernel density estimation for random fields. (Density estimation for random fields)
- SMALL BANDWIDTH ASYMPTOTICS FOR DENSITY-WEIGHTED AVERAGE DERIVATIVES
- Asymptotic distributions in random graphs with applications to social networks
- An econometric model of network formation with degree heterogeneity
This page was built for publication: Kernel density estimation for undirected dyadic data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199653)