Kernel density estimation for undirected dyadic data

We study nonparametric estimation of density functions for undirected dyadic random variables (i.e., random variables defined for all n\overset{def}{\equiv}\tbinom{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.

[1]  James Roberts,et al.  Network structure of production , 2011, Proceedings of the National Academy of Sciences.

[2]  J. Powell,et al.  Semiparametric estimation of censored selection models with a nonparametric selection mechanism , 1993 .

[3]  Matias D. Cattaneo,et al.  FEDERAL RESERVE BANK OF NEW YORK , 2010 .

[4]  P. Bickel,et al.  The method of moments and degree distributions for network models , 2011, 1202.5101.

[5]  P. Holland,et al.  Local Structure in Social Networks , 1976 .

[6]  H. White Asymptotic theory for econometricians , 1985 .

[7]  Krzysztof Nowicki,et al.  Asymptotic distributions in random graphs with applications to social networks , 1991 .

[8]  Yves Zenou,et al.  R&D Networks: Theory, Empirics, and Policy Implications , 2014, Review of Economics and Statistics.

[9]  P. Hall,et al.  Martingale Limit Theory and Its Application , 1980 .

[10]  S. Janson,et al.  Graph limits and exchangeable random graphs , 2007, 0712.2749.

[11]  Douglas L. Miller,et al.  Robust Inference for Dyadic Data , 2015 .

[12]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

[13]  D. Aldous Representations for partially exchangeable arrays of random variables , 1981 .

[14]  B. Graham An Econometric Model of Network Formation With Degree Heterogeneity , 2017 .

[15]  Peter M. Aronow,et al.  Cluster–Robust Variance Estimation for Dyadic Data , 2013, Political Analysis.

[16]  J. Tinbergen Shaping the World Economy: Suggestions for an International Economic Policy , 1964 .

[17]  Marcel Fafchamps,et al.  The formation of risk sharing networks , 2007 .