🤖 AI Summary
研究解决动态网络形成中同质性和传递性问题，通过构建模型分析参数可识别性，并提出一种模拟估计方法。
📝 Abstract
In social and economic networks linked agents often share connections in common. There are two competing explanations for this phenomenon. First, agents may have a structural taste for transitive links - the returns to linking may be higher if two agents share a common connection. Second, agents may assortatively match on unobserved attributes, a process called homophily. We study parameter identifiability in a simple model of dynamic network formation with both effects. Agents form, maintain, and dissolve links over time to maximize utility. The return to linking may be higher if agents share connections in common. A pair-specific utility component allows for arbitrary homophily on time-invariant agent attributes. We derive conditions under which it is possible to detect the presence of a taste for transitivity in the presence of assortative matching on unobservables. We leave the joint distribution of the initial network and the pair-specific utility component, both high dimensional nuisance parameters, unrestricted. Our identification result is constructive, suggesting an analog estimator, whose finite and (single) large network properties we characterize. We show, via examples, the delicacy of information accumulation in the single (large) network setting.