Kernel density estimation for undirected dyadic data

DOI10.1016/J.JECONOM.2022.06.011MaRDI QIDQ6199653zbMATH OpenOpenAlexFDO

Authors Bryan S. Graham, Fengshi Niu, James L. Powell

Publication date 21 March 2024

Published in Journal of Econometrics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.13630

zbMATH Keywords

dyadskernel density estimationnetworks

Mathematics Subject Classification ID

Statistics (62-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

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.

Cites work

• A survey of statistical network models
• An econometric model of network formation with degree heterogeneity
• Asymptotic distributions in random graphs with applications to social networks
• Asymptotic Statistics
• Graph limits and exchangeable random graphs
• scientific article; zbMATH DE number 3723610 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• scientific article; zbMATH DE number 3222478 (Why is no real title available?)
• Kernel density estimation for random fields. (Density estimation for random fields)
• Large networks and graph limits
• On Estimation of a Probability Density Function and Mode
• Remarks on Some Nonparametric Estimates of a Density Function
• Representations for partially exchangeable arrays of random variables
• Semiparametric estimation of censored selection models with a nonparametric selection mechanism
• Semiparametric Estimation of Index Coefficients
• SMALL BANDWIDTH ASYMPTOTICS FOR DENSITY-WEIGHTED AVERAGE DERIVATIVES
• The method of moments and degree distributions for network models

Cited in

(4)

• Higher-order refinements of small bandwidth asymptotics for density-weighted average derivative estimators
• A note on kernel density estimation for undirected dyadic data
• Inference on linear quantile regression with dyadic data
• Sparse network asymptotics for logistic regression under possible misspecification

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)