betaFeedback

WorksEconomics, Econometrics and Finance

Testing Conditional Moment Restrictions in Networks

Abstract

Parametric models of network formation, such as dyadic logit models, are increasingly popular, but few tools exist to test their specification. This paper develops a specification test for conditionally independent dyad (CID) models based on the probabilities that these models assign to subgraphs, the patterns of links among small groups of agents. Given the agents' characteristics, a parametric CID model determines not only the probability of each link but also the probability that a group of agents forms a triangle, a star, or any other subgraph. Under correct specification, the expected frequency of each subgraph among agents with given characteristics equals its model-implied probability. This forms the basis of the testable conditional moment restrictions. The test statistic is the weighted integrated squared distance between a nonparametric kernel estimate of these probabilities and the probabilities implied by the estimated parametric model. I derive its asymptotic distribution under the null hypothesis.

Introduction

Social and economic networks, such as risk-sharing ties among households [26, 25] and job referral networks [66], shape economic outcomes [49]. A large literature models how they form; see Graham (2020) and de Paula et al. [20] for overviews. Conditionally independent dyad (CID) models, in which links form independently across pairs of agents given the agents’ observed and unobserved characteristics, are a large class of network formation models. This class is motivated by the Aldous–Hoover representation of exchangeable random graphs [1, 45] and includes stochastic block models, latent space models, and models with degree heterogeneity [5] [42, 32, 54]. In parametric CID models, the probability that two agents link is a known function, such as a logit, of their observed characteristics and a finite-dimensional parameter; some models add agent-specific unobserved heterogeneity [32, 51, 23] (Graham 2024). These models are used to measure homophily and degree heterogeneity, to simulate counterfactual networks, and to serve as building blocks of peer-effects models with endogenous networks [52, 47]. Their conclusions rest on the parametric specification, yet few tools exist to test it.

This paper develops a specification test for parametric CID models. The test uses subgraphs: the patterns of links among small groups of agents, such as triangles and stars. Under correct specification, the expected frequency of any subgraph among agents with given characteristics must equal its model-implied probability. Specifically, for a graph SS on pp vertices, let P(S,x)P(S,x) be the probability that the links among pp agents with continuously distributed characteristics x=(x1,…,xp)x = (x_1,\ldots,x_p) form SS. Under the parametric model, links are independent given observed characteristics, and two agents with characteristics xix_i and xjx_j link with probability e(xi,xj;θ)e(x_i,x_j;\theta). Hence P(S,x)P(S,x) is a known function of these link probabilities, which I denote by P(S,x;eθ)P(S,x;e_\theta), where eθ:=e(⋅,⋅;θ)e_\theta:= e(\cdot,\cdot;\theta). For instance, three agents with characteristics (x1,x2,x3)(x_1,x_2,x_3) form a triangle with probability e(x1,x2;θ)e(x1,x3;θ)e(x2,x3;θ)e(x_1,x_2;\theta)e(x_1,x_3;\theta)e(x_2,x_3;\theta). The null hypothesis is that P(S,x)=P(S,x;eθ)P(S,x)=P(S,x;e_\theta) for some θ\theta and almost all xx. I estimate P(S,x)P(S,x) nonparametrically by the kernel-weighted frequency of SS among tuples of agents whose characteristics are close to xx [22]. I estimate θ\theta by the pseudo composite likelihood estimator of Graham (2024), which yields the model-implied estimate P(S,x;eθ^)P(S,x;e_{\hat{\theta}}). As in kernel-based specification tests (e.g., [39]), the test statistic is the weighted integrated squared difference between the two estimates,

TN,S=NhNdX/2∫{P^N(S,x)−Kh,NP(S,⋅;eθ^)(x)}2π(x) dx,T_{N,S}=Nh_N^{d_X/2}\int\left\{\widehat{P}_N(S,x)-K_{h,N}P(S,\cdot;e_{\widehat{\theta}})(x)\right\}^2\pi(x)\,dx,

where NN is the number of agents, hNh_N is the bandwidth, dXd_X is the dimension of each agent’s characteristics, P^N(S,x)\widehat{P}_N(S,x) is the nonparametric kernel estimate, and π\pi is a weight function. The operator Kh,NK_{h,N} smooths the parametric estimate with the same kernel weights, which removes a linear term from the asymptotic expansion of the statistic. The test applies to any subgraph. Test statistics for several subgraphs can be combined by taking their maximum or a weighted average; wheels, subgraphs with one central agent and several arms, are a natural family as their moments identify stochastic block models [6]. The asymptotic theory in this paper is for a single subgraph.

The main technical challenge is network dependence. The observations are the subgraphs induced by pp-tuples of agents. Two such subgraphs are independent when their tuples are disjoint but dependent when they share an agent. I first show that the parametric pseudo composite likelihood estimator is consistent and asymptotically normal at the N\sqrt{N} rate under this dependence, provided the model is correctly specified. By the results of Ding [22], the kernel estimate is uniformly consistent. I then write the test statistic as a kernel-weighted generalized U-statistic of order 2p2p, derive its Hoeffding decomposition, and isolate its leading term, a quadratic form. Applying the central limit theorem for generalized quadratic forms of de Jong [18], I derive the asymptotic null distribution of the test statistic when its agent-level projection, the first-order Hoeffding projection onto individual agents, is nondegenerate. As with the rate of the kernel estimator in Ding [22], the normalization NhNdX/2Nh_N^{d_X/2} depends only on the dimension dXd_X of a single agent’s characteristics, not on the dimension pdXp d_X of all characteristics in the subgraph; this alleviates the curse of dimensionality.

Related literature. To the best of my knowledge, this paper provides the first test of parametric network formation models against nonparametric alternatives that uses subgraph probabilities conditional on the agents’ characteristics. It contributes to three literatures.

First, it extends specification testing to network data. Specification testing has a long tradition in econometrics ([65, 40, 72, 62]), and consistent tests of conditional moment restrictions against nonparametric alternatives originate with Bierens [8, 9]. The test here builds on kernel-based comparisons of parametric and nonparametric fits ([39, 31, 73, 27, 28]); related tests use series estimators and adaptive procedures ([44, 46, 11]), integrated conditional moments and empirical processes ([71, 2, 68, 15, 24]), or empirical likelihood ([70]). These tests were developed for independent or weakly dependent observations ([19]), and recent work extends them to spatial autoregressive models ([55]) and to regressors whose distributions have singular components ([53]). I extend the approach to observations that are overlapping tuples of agents in a single network.

Second, it contributes to the econometrics of network formation. Parametric CID models are studied by Graham [32], Jochmans [51], and Dzemski [23], who allow for degree heterogeneity, and by Graham [34], who studies logistic regression under sparse network asymptotics and possible misspecification. Kitamura and Laage [54] estimate stochastic block models with covariates, and Gao et al. [30] and Bonhomme and Dano [10] derive restrictions on model parameters that are robust to the form of unobserved heterogeneity. Models with strategic interaction in link formation, which are not CID models, are studied by Mele [59], de Paula et al. [21], Sheng [67], and Menzel [61], among others. Existing tests in this literature address specific questions: Pelican and Graham [64] and Graham and Pelican [37] test for strategic interaction, Dzemski [23] compares observed and predicted transitivity, and Auerbach [3] tests whether two networks are drawn from the same random graph model. The test proposed here instead checks the parametric specification of link probabilities against nonparametric alternatives.

Third, it builds on the statistical literature on exchangeable random graphs and graph limits ([1, 45, 5, 58]). Subgraph counts have long been used to describe network structure ([43]), and Chandrasekhar and Jackson [13] model network formation directly in terms of subgraphs rather than links. Bickel et al. [6] use subgraph counts to estimate graphon models by the method of moments, and Bhattacharyya and Bickel [4], Green and Shalizi [38], and Lin et al. [57] develop resampling methods for them. Goodness-of-fit procedures include simulation-based diagnostics for exponential random graph models [48], tests for the number of communities in stochastic block models [7, 56], and tests based on small subgraph probabilities [29]. These procedures use unconditional subgraph counts or target particular model classes. The test here instead conditions on the agents’ characteristics, so it allows for covariates and a parametric null. The analysis uses the Hoeffding decomposition of generalized U-statistics, whose asymptotic distributions in random graphs are studied by Janson and Nowicki [50]. It also relates to work on dyadic data [36, 35, 12] and on exchangeable arrays and multiway clustering [69, 17, 60, 16]. That work mostly concerns statistics indexed by pairs of agents, whereas the statistic here involves tuples of pp agents; for these, the analysis builds on the uniform convergence results of Ding [22] for the kernel estimator.

Outline. Section 2 introduces the CID model. Section 3 derives the subgraph probabilities and their conditional moment restrictions, including explicit expressions for wheels. Section 4 states the null hypothesis, defines the test statistic, establishes the properties of the parametric estimator, and states those of the nonparametric estimator. Section 5 derives the asymptotic null distribution of the test statistic. Section 6 concludes.

Model

I first introduce some graph notation commonly used in studies of networks. Let GN=(V(GN),E(GN))G_N = (\mathcal{V}(G_N),\mathcal{E}(G_N)) be an undirected network (graph) without self-loops on NN vertices, or agents. The vertex set V(GN)={1,…,N}\mathcal{V}(G_N) = \{1,\ldots,N\} denotes the set of all agents in the network. The edge list E(GN)={{i,j},{k,l},…}\mathcal{E}(G_N) = \{\{i,j\},\{k,l\},\ldots\} records the unordered pairs of agents that are linked. I represent GNG_N by its N×NN \times N adjacency matrix D=[Dij]i,j∈V(GN)D = [D_{ij}]_{i,j \in\mathcal{V}(G_N)}, whose (i,j)(i,j) element is 1 if {i,j}∈E(GN)\{i,j\} \in\mathcal{E}(G_N) and 0 otherwise. See Graham (2020) for details.

Let Xi∈RdXX_i \in\mathbb{R}^{d_X} be the observed characteristics with support X\mathcal{X} and Ui∈RU_i \in\mathbb{R} the unobserved characteristics of agent ii. Assume that the pairs {(Xi,Ui)}i=1N\{(X_i,U_i)\}_{i=1}^{N} are independent and identically distributed across agents. Assume also that UiU_i is independent of XiX_i and has a continuous distribution with density fUf_U, and that XiX_i has a continuous distribution. Define X(GN)=(X1,X2,…,XN)′∈RNdXX(G_N) = (X_1,X_2,\ldots,X_N)^\prime\in\mathbb{R}^{Nd_X} and U(GN)=(U1,U2,…,UN)′∈RNU(G_N) = (U_1,U_2,\ldots,U_N)^\prime\in\mathbb{R}^N. I consider the conditionally independent dyad (CID) model with covariates and unobserved heterogeneity, in which

Dij∣Xi,Xj,Ui,Uj∼Bernoulli⁡(h(Xi,Xj,Ui,Uj))D_{ij} \mid X_i, X_j, U_i, U_j \sim\operatorname{Bernoulli}\bigl(h(X_i,X_j,U_i,U_j)\bigr)

independently for every dyad {i,j}\{i,j\} with i<ji < j, where h(Xi,Xj,Ui,Uj)h(X_i,X_j,U_i,U_j) is the probability that $i and jj form a link. This function hh is called the graphon; it is measurable, takes values in [0,1][0,1], and satisfies h(x,y,u,v)=h(y,x,v,u)h(x,y,u,v)=h(y,x,v,u) for undirected networks. CID models induce a particular dependence structure across the rows and columns of the adjacency matrix: dyads that share an agent are dependent. The model is restrictive in some respects (for example, it rules out strategic interaction among agents), but it is general enough to cover many popular network models, such as stochastic block models, latent space models, and models with degree heterogeneity.

The CID model is a nonparametric model for large networks. It is motivated by the Aldous–Hoover representation theorem for exchangeable random graphs [1, 45], under which links in the limiting network form independently conditional on agent-specific variables, here the observed characteristics XX and the latent variables UU. Chatterjee and Diaconis [14] show that dense exponential random graph models are asymptotically of this form.

Under the model, the probability of observing a network dd conditional on X=xX=x and U=uU=u is

Pr⁡(D=d∣X=x,U=u)=∏i<jh(xi,xj,ui,uj)dij(1−h(xi,xj,ui,uj))1−dij.\Pr(D=d\mid X=x,U=u)=\prod_{i<j}h(x_i,x_j,u_i,u_j)^{d_{ij}}\left(1-h(x_i,x_j,u_i,u_j)\right)^{1-d_{ij}}.

Integrating out the unobserved heterogeneity, whose distribution FF has density fUf_U, gives the probability of observing dd conditional on X=xX=x:

Pr⁡(D=d∣X=x)=∫⋯∫∏i<jh(xi,xj,ui,uj)dij(1−h(xi,xj,ui,uj))1−dij∏i=1NfU(ui) dui.\Pr(D=d\mid X=x)=\int\cdots\int\prod_{i<j}h(x_i,x_j,u_i,u_j)^{d_{ij}}\left(1-h(x_i,x_j,u_i,u_j)\right)^{1-d_{ij}}\prod_{i=1}^{N}f_U(u_i)\,du_i.

Without loss of generality, I apply the probability integral transform to normalize FF to the uniform distribution on [0,1][0,1], so that

References

  1. [1]Aldous, David J. (1981). Representations for partially exchangeable arrays of random variables. Journal of Multivariate Analysis, 11(4), 581–598.DOI
  2. [2]Andrews, Donald W. K. (1997). A conditional Kolmogorov test. Econometrica, 65(5), 1097–1128.
  3. [3]Auerbach, Eric (2022). Testing for differences in stochastic network structure. Econometrica, 90(3), 1205–1223.arxiv.org/abs/1903.11117
  4. [4]Bhattacharyya, Sharmodeep, and Peter J. Bickel (2015). Subsampling bootstrap of count features of networks. The Annals of Statistics, 43(6), 2384–2411.DOI
  5. [5]Bickel, Peter J., and Aiyou Chen (2009). A nonparametric view of network models and Newman–Girvan and other modularities. Proceedings of the National Academy of Sciences, 106(50), 21068–21073.DOI
  6. [6]Bickel, Peter J., Aiyou Chen, and Elizaveta Levina (2011). The method of moments and degree distributions for network models. The Annals of Statistics, 39(5), 2280–2301.
  7. [7]Bickel, Peter J., and Purnamrita Sarkar (2016). Hypothesis testing for automated community detection in networks. Journal of the Royal Statistical Society. Series B (Statistical Methodology), 78(1), 253–273.arxiv.org/abs/1311.2694
  8. [8]Bierens, Herman J. (1982). Consistent model specification tests. Journal of Econometrics, 20(1), 105–134.DOI
  9. [9]Bierens, Herman J. (1990). A consistent conditional moment test of functional form. Econometrica, 58(6), 1443–1458.
  10. [10]Bonhomme, Stéphane, and Kevin Dano (2024). Functional differencing in networks. Revue économique, 75(1), 147–175.
  11. [11]Breunig, Christoph, and Xiaohong Chen (2024). Adaptive, rate-optimal hypothesis testing in non-parametric IV models. Econometrica, 92(6), 2027–2067.
  12. [12]Cattaneo, Matias D., Yingjie Feng, and William G. Underwood (2024). Uniform inference for kernel density estimators with dyadic data. Journal of the American Statistical Association, 119(548), 2695–2708.arxiv.org/abs/2201.05967
  13. [13]Chandrasekhar, Arun G., and Matthew O. Jackson (2025). A network formation model based on subgraphs. The Review of Economic Studies, forthcoming.
  14. [14]Chatterjee, Sourav, and Persi Diaconis (2013). Estimating and understanding exponential random graph models. The Annals of Statistics, 41(5), 2428–2461.DOI
  15. [15]Chen, Xiaohong, and Yanqin Fan (1999). Consistent hypothesis testing in semiparametric and nonparametric models for econometric time series. Journal of Econometrics, 91(2), 373–401.DOI
  16. [16]Chiang, Harold D., Kengo Kato, and Yuya Sasaki (2023). Inference for high-dimensional exchangeable arrays. Journal of the American Statistical Association, 118, 1595–1605.
  17. [17]Davezies, Laurent, Xavier D’Haultfoeuille, and Yannick Guyonvarch (2021). Empirical process results for exchangeable arrays. The Annals of Statistics, 49(2), 845–862.DOI
  18. [18]de Jong, Peter (1987). A central limit theorem for generalized quadratic forms. Probability Theory and Related Fields, 75(2), 261–277.DOI
  19. [19]de Jong, Robert M. (1996). The Bierens test under data dependence. Journal of Econometrics, 72(1), 1–32.DOI
  20. [20]de Paula, Áureo, Elie Tamer, and Marcel-Cristian Voia (Eds.) (2020). The Econometrics of Networks, Volume 42 of Advances in Econometrics. Emerald Publishing.
  21. [21]de Paula, Áureo, Seth Richards-Shubik, and Elie Tamer (2018). Identifying preferences in networks with bounded degree. Econometrica, 86(1), 263–288.
  22. [22]Ding, Olivia (2026). Nonparametric subgraph regression. Working paper, Yale University, version of November 4, 2026. https://doi.org/10.48550/arXiv.2611.07240.
  23. [23]Dzemski, Andreas (2019). An empirical model of dyadic link formation in a network with unobserved heterogeneity. The Review of Economics and Statistics, 101(5), 763–776.DOI
  24. [24]Escanciano, J. Carlos (2006). A consistent diagnostic test for regression models using projections. Econometric Theory, 22(6), 1030–1051.DOI
  25. [25]Fafchamps, Marcel, and Flore Gubert (2007). Risk sharing and network formation. American Economic Review, 97(2), 75–79.
  26. [26]Fafchamps, Marcel, and Susan Lund (2003). Risk-sharing networks in rural Philippines. Journal of Development Economics, 71(2), 261–287.
  27. [27]Fan, Yanqin, and Qi Li (1996). Consistent model specification tests: Omitted variables and semi-parametric functional forms. Econometrica, 64(4), 865–890.DOI
  28. [28]Fan, Yanqin, and Qi Li (2000). Consistent model specification tests: Kernel-based tests versus Bierens’ ICM tests. Econometric Theory, 16(6), 1016–1041.DOI
  29. [29]Gao, Chao, and John Lafferty (2017). Testing network structure using relations between small subgraph probabilities. arXiv preprint arXiv:1704.06742.arxiv.org/abs/1704.06742
  30. [30]Gao, Wayne Yuan, Ming Li, and Sheng Xu (2023). Logical differencing in dyadic network formation models with nontransferable utilities. Journal of Econometrics, 235(1), 302–324.
  31. [31]Gozalo, Pedro L. (1993). A consistent model specification test for nonparametric estimation of regression function models. Econometric Theory, 9(3), 451–477.DOI
  32. [32]Graham, Bryan S. (2017). An econometric model of network formation with degree heterogeneity. Econometrica, 85(4), 1033–1063.
  33. [34]Graham, Bryan S. (2024). Sparse network asymptotics for logistic regression under possible misspecification. Econometrica, 92(6), 1837–1868.
  34. [35]Graham, Bryan S., Fengshi Niu, and James L. Powell (2021). Minimax risk and uniform convergence rates for nonparametric dyadic regression. NBER Working Paper 28548.
  35. [36]Graham, Bryan S., Fengshi Niu, and James L. Powell (2024). Kernel density estimation for undirected dyadic data. Journal of Econometrics, 240(2).
  36. [37]Graham, Bryan S., and Andrin Pelican (2020). Testing for externalities in network formation using simulation. In Bryan S. Graham and Áureo de Paula (Eds.), The Econometric Analysis of Network Data. Academic Press.arxiv.org/abs/1908.00099
  37. [38]Green, Alden, and Cosma Rohilla Shalizi (2022). Bootstrapping exchangeable random graphs. Electronic Journal of Statistics, 16(1), 1058–1095.DOI
  38. [39]Härdle, Wolfgang, and Enno Mammen (1993). Comparing nonparametric versus parametric regression fits. The Annals of Statistics, 21(4), 1926–1947.DOI
  39. [40]Hausman, Jerry A. (1978). Specification tests in econometrics. Econometrica, 46(6), 1251–1271.DOI
  40. [41]Hoeffding, Wassily (1961). The strong law of large numbers for U-statistics. Mimeo Series No. 302, Institute of Statistics, University of North Carolina, Chapel Hill, NC.
  41. [42]Hoff, Peter D., Adrian E. Raftery, and Mark S. Handcock (2002). Latent space approaches to social network analysis. Journal of the American Statistical Association, 97(460), 1090–1098.
  42. [43]Holland, Paul W., and Samuel Leinhardt (1976). Local structure in social networks. Sociological Methodology, 7, 1–45.DOI
  43. [44]Hong, Yongmiao, and Halbert White (1995). Consistent specification testing via nonparametric series regression. Econometrica, 63(5), 1133–1159.
  44. [45]Hoover, Douglas N. (1979). Relations on probability spaces and arrays of random variables. Preprint, Institute for Advanced Study, Princeton, NJ.
  45. [46]Horowitz, Joel L., and Vladimir G. Spokoiny (2001). An adaptive, rate-optimal test of a parametric mean-regression model against a nonparametric alternative. Econometrica, 69(3), 599–631.DOI
  46. [47]Hsieh, Chih-Sheng, Lung-Fei Lee, and Vincent Boucher (2020). Specification and estimation of network formation and network interaction models with the exponential probability distribution. Quantitative Economics, 11(4), 1349–1390.
  47. [48]Hunter, David R., Steven M. Goodreau, and Mark S. Handcock (2008). Goodness of fit of social network models. Journal of the American Statistical Association, 103(481), 248–258.DOI
  48. [49]Jackson, Matthew O., Brian W. Rogers, and Yves Zenou (2017). The economic consequences of social-network structure. Journal of Economic Literature, 55(1), 49–95.
  49. [50]Janson, Svante, and Krzysztof Nowicki (1991). The asymptotic distributions of generalized U-statistics with applications to random graphs. Probability Theory and Related Fields, 90(3), 341–375.DOI
  50. [51]Jochmans, Koen (2018). Semiparametric analysis of network formation. Journal of Business & Economic Statistics, 36(4), 705–713.
  51. [52]Johnsson, Ida, and Hyungsik Roger Moon (2021). Estimation of peer effects in endogenous social networks: Control function approach. The Review of Economics and Statistics, 103(2), 328–345.
  52. [53]Kankanala, Sid, and Victoria Zinde-Walsh (2024). Kernel-weighted specification testing under general distributions. Bernoulli, 30(3), 1921–1944.arxiv.org/abs/2204.01683
  53. [54]Kitamura, Yuichi, and Louise Laage (2024). Estimating stochastic block models in the presence of covariates. arXiv preprint arXiv:2402.16322.arxiv.org/abs/2402.16322
  54. [55]Lee, Jungyoon, Peter C. B. Phillips, and Francesca Rossi (2020). Consistent misspecification testing in spatial autoregressive models. Cowles Foundation Discussion Paper 2256.DOI
  55. [56]Lei, Jing (2016). A goodness-of-fit test for stochastic block models. The Annals of Statistics, 44(1), 401–424.DOI
  56. [57]Lin, Qiaohui, Robert Lunde, and Purnamrita Sarkar (2020). Higher-order correct multiplier bootstraps for count functionals of networks. arXiv preprint arXiv:2009.06170.
  57. [58]Lovász, László (2012). Large Networks and Graph Limits, Volume 60 of Colloquium Publications. American Mathematical Society.DOI
  58. [59]Mele, Angelo (2017). A structural model of dense network formation. Econometrica, 85(3), 825–850.DOI
  59. [60]Menzel, Konrad (2021). Bootstrap with cluster-dependence in two or more dimensions. Econometrica, 89(5), 2143–2188.DOI
  60. [61]Menzel, Konrad (2022). Strategic network formation with many agents. Working paper, New York University.
  61. [62]Newey, Whitney K. (1985). Generalized method of moments specification testing. Journal of Econometrics, 29(3), 229–256.
  62. [63]Newey, Whitney K., and Daniel McFadden (1994). Large sample estimation and hypothesis testing. In Robert F. Engle and Daniel L. McFadden (Eds.), Handbook of Econometrics, Volume 4, pp. 2111–2245. Elsevier.
  63. [64]Pelican, Andrin, and Bryan S. Graham (2020). An optimal test for strategic interaction in social and economic network formation between heterogeneous agents. NBER Working Paper 27793.
  64. [65]Ramsey, James B. (1969). Tests for specification errors in classical linear least-squares regression analysis. Journal of the Royal Statistical Society. Series B (Methodological), 31(2), 350–371.DOI
  65. [66]Schmutte, Ian M. (2015). Job referral networks and the determination of earnings in local labor markets. Journal of Labor Economics, 33(1), 1–32.DOI
  66. [67]Sheng, Shuyang (2020). A structural econometric analysis of network formation games through subnetworks. Econometrica, 88(5), 1829–1858.DOI
  67. [68]Stinchcombe, Maxwell B., and Halbert White (1998). Consistent specification testing with nuisance parameters present only under the alternative. Econometric Theory, 14(3), 295–325.DOI
  68. [69]Tabord-Meehan, Max (2019). Inference with dyadic data: Asymptotic behavior of the dyadic-robust t-statistic. Journal of Business & Economic Statistics, 37(4), 671–680.
  69. [70]Tripathi, Gautam, and Yuichi Kitamura (2003). Testing conditional moment restrictions. The Annals of Statistics, 31(6), 2059–2095.DOI
  70. [71]Whang, Yoon-Jae, and Donald W. K. Andrews (1993). Tests of specification for parametric and semiparametric models. Journal of Econometrics, 57(1), 277–318.DOI
  71. [72]White, Halbert (1981). Consequences and detection of misspecified nonlinear regression models. Journal of the American Statistical Association, 76(374), 419–433.
  72. [73]Zheng, John Xu (1996). A consistent test of functional form via nonparametric estimation techniques. Journal of Econometrics, 75(2), 263–289.

Paper details

vlnc:W_teek7fnk
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Economics, Econometrics and Finance

Not recorded for this paper

View statement
Looking for related papers…
Contents