This paper provides a framework for identifying preferences in a large network where links are pairwise stable. Network formation models present difficulties for identi fication, especially when links can be interdependent: e.g., when indirect connections matter. We show how one can use the...

This paper provides a framework for identifying preferences in a large network under the assumption of pairwise stability of network links. Network data present difficulties for identification, especially when links between nodes in a network can be interdependent: e.g., where indirect...

This paper provides a framework for identifying preferences in a large network where links are pairwise stable. Network formation models present difficulties for identifi cation, especially when links can be interdependent: e.g., when indirect connections matter. We show how one can use the...

In complicated/nonlinear parametric models, it is generally hard to know whether the model parameters are point identified. We provide computationally attractive procedures to construct confidence sets (CSs) for identified sets of full parameters and of subvectors in models defined through a...