Consider a bipartite network where N consumers choose to buy or not to buy M different products. This paper considers the properties of the logit ﬁt of the N ×M array of “i-buys-j” purchase decisions, Y = [Yij ]1≤i≤N,1≤j≤M , onto a vector of known functions of consumer and product attributes under asymptotic sequences where (i) both N and M grow large, (ii) the average number of products purchased per consumer is ﬁnite in the limit, (iii) there exists dependence across elements in the same row or same column of Y (i.e., dyadic dependence) and (iv) the true conditional probability of making a purchase may, or may not, take the assumed logit form. Condition (ii) implies that the limiting network of purchases is sparse: only a vanishing fraction of all possible purchases are actually made. Under sparse network asymptotics, I show that the parameter indexing the logit approximation solves a particular Kullback–Leibler Information Criterion (KLIC) minimization problem (deﬁned with respect to a certain Poisson population). This ﬁnding provides a simple characterization of the logit pseudo-true parameter under general misspeciﬁcation. With respect to sampling theory, sparseness implies that the ﬁrst and last terms in an extended Hoeffding-type variance decomposition of the score of the logit pseudo composite log-likelihood are of equal order. In contrast, under dense network asymptotics, the last term is asymptotically negligible. Asymptotic normality of the logistic regression coefficients is shown using a martingale central limit theorem (CLT) for triangular arrays. Unlike in the dense case, the normality result derived here also holds under degeneracy of the network graphon. Relatedly, when there “happens to be” no dyadic dependence in the dataset in hand, it specializes to recently derived results on the behavior of logistic regression with rare events and iid data. Simulation results suggest that sparse network asymptotics better approximate the ﬁnite network distribution of the logit estimator.