I study a regression model in which one covariate is an unknown function of a latent driver of link formation in a network. Rather than specify and fit a parametric network formation model, I introduce a new method based on matching pairs of agents with similar columns of the squared adjacency matrix, the ij th entry of which contains the number of other agents linked to both agents i and j . The intuition behind this approach is that for a large class of network formation models the columns of the squared adjacency matrix characterize all of the identifiable information about individual linking behavior. In this paper, I describe the model, formalize this intuition, and provide consistent estimators for the parameters of the regression model.

How can one determine whether a treatment, such as the introduction of a social program or trade shock, alters agents' incentives to form links in a network? This paper proposes analogs of a two‐sample Kolmogorov–Smirnov test, widely used in the literature to test the null hypothesis of no treatment effects, for network data. It first specifies a testing problem in which the null hypothesis is that two networks are drawn from the same random graph model. It then describes two randomization tests based on the magnitude of the difference between the networks' adjacency matrices as measured by the 2 → 2 and ∞ → 1 operator norms. Power properties of the tests are examined analytically, in simulation, and through two real‐world applications. A key finding is that the test based on the ∞ → 1 norm can be much more powerful for the kinds of sparse and degree‐heterogeneous networks common in economics.