Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/171888 
Authors: 
Year of Publication: 
2016
Citation: 
[Journal:] Econometrics [ISSN:] 2225-1146 [Volume:] 4 [Issue:] 3 [Publisher:] MDPI [Place:] Basel [Year:] 2016 [Pages:] 1-11
Publisher: 
MDPI, Basel
Abstract: 
In this paper, we suggest an approach to recovering behavior-related, preference-choice network information from observational data. We model the process as a self-organized behavior based random exponential network-graph system. To address the unknown nature of the sampling model in recovering behavior related network information, we use the Cressie-Read (CR) family of divergence measures and the corresponding information theoretic entropy basis, for estimation, inference, model evaluation, and prediction. Examples are included to clarify how entropy based information theoretic methods are directly applicable to recovering the behavioral network probabilities in this fundamentally underdetermined ill posed inverse recovery problem.
Subjects: 
random exponential networks
binary and weighed networks
inverse problem
adjacency matrix
Cressie-Read family of divergence measures
conditional moment conditions
self organized behavior systems
JEL: 
C1
C10
C24
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size
778.67 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.