File Download

There are no files associated with this item.

Supplementary

Conference Paper: Identification Problems in Linear Social Interaction Models: A General Analysis Based on Matrix Spectral Decompositions

TitleIdentification Problems in Linear Social Interaction Models: A General Analysis Based on Matrix Spectral Decompositions
Authors
Issue Date2014
PublisherThe Econometric Society.
Citation
The 2nd China Meeting of the Econometric Society (CMES), Xiamen, China, 25-27 June 2014 How to Cite?
AbstractThis paper develops a framework for analyzing the identification problems in linear social interaction models with exogenous networks. Manski's (1993) reflection problem, models with group-level unobservables (fixed effects), differencing methods, and Graham's (2008) variance contrast method can be analyzed under the proposed framework. The analysis reveals that parameters are identified if and only if the number of distinct eigenvalues of the adjacency matrix is larger than or equal to the number of parameters, and that network diameter is a key network property related to identification.
DescriptionSession CP29: Applied Econometrics
Persistent Identifierhttp://hdl.handle.net/10722/205082

 

DC FieldValueLanguage
dc.contributor.authorKwok, HHen_US
dc.date.accessioned2014-09-20T01:24:38Z-
dc.date.available2014-09-20T01:24:38Z-
dc.date.issued2014en_US
dc.identifier.citationThe 2nd China Meeting of the Econometric Society (CMES), Xiamen, China, 25-27 June 2014en_US
dc.identifier.urihttp://hdl.handle.net/10722/205082-
dc.descriptionSession CP29: Applied Econometrics-
dc.description.abstractThis paper develops a framework for analyzing the identification problems in linear social interaction models with exogenous networks. Manski's (1993) reflection problem, models with group-level unobservables (fixed effects), differencing methods, and Graham's (2008) variance contrast method can be analyzed under the proposed framework. The analysis reveals that parameters are identified if and only if the number of distinct eigenvalues of the adjacency matrix is larger than or equal to the number of parameters, and that network diameter is a key network property related to identification.en_US
dc.languageengen_US
dc.publisherThe Econometric Society.-
dc.relation.ispartofChina Meeting of the Econometric Society (CMES)en_US
dc.titleIdentification Problems in Linear Social Interaction Models: A General Analysis Based on Matrix Spectral Decompositionsen_US
dc.typeConference_Paperen_US
dc.identifier.emailKwok, HH: kwokhh@hku.hken_US
dc.identifier.authorityKwok, HH=rp01632en_US
dc.identifier.hkuros235210en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats