Show simple item record

dc.contributor.advisorChintan Vaishnav and John Tsitsiklis.en_US
dc.contributor.authorSeby, Jean-Baptiste.en_US
dc.contributor.otherMassachusetts Institute of Technology. Institute for Data, Systems, and Society.en_US
dc.contributor.otherTechnology and Policy Program.en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2021-01-06T17:38:47Z
dc.date.available2021-01-06T17:38:47Z
dc.date.copyright2020en_US
dc.date.issued2020en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/129081
dc.descriptionThesis: S.M. in Technology and Policy, Massachusetts Institute of Technology, School of Engineering, Institute for Data, Systems, and Society, Technology and Policy Program, September, 2020en_US
dc.descriptionThesis: S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020en_US
dc.descriptionCataloged from student-submitted PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 231-243).en_US
dc.description.abstractThis thesis is composed of two independent parts. In Part I, we study higher-order interactions in both graphical models and networks, i.e., interactions between more than two nodes. In the graphical model setting, we do not assume that interactions are known and our goal is to recover the structure of the graph. Our main contribution is an algebraic criterion that enables us to determine whether a set of observed variables have a single cause or multiple causes. We also prove that this criterion holds in the presence of confounders, i.e., when the causes are hidden. In the network setting, we assume that the structure of the graph is known. Our objective is then to identify what kind of information about data can be learned from the analysis of higher-order interactions. More precisely, using the generalization of the normalized Laplacian and random walks on graphs to simplicial complexes, we study a simplicial notion of PageRank centrality as defined in [Schaub et al., 2018].en_US
dc.description.abstractConducting numerical experiments on both synthetic and true data, we find evidence that the so-called edge PageRank is related to the concepts of local and global bridges in networks. In Part II, we analyze the determinants of yield gaps in Semi-Arid Tropics (SAT) regions in India. Analyzing a panel data of households within 30 villages over 6 years in India, we apply a fixed effects estimation method and a quantile regression with fixed effects to identify the most significant explanatory variables of yield gaps for 5 different crops. Using a correlated random effects estimator for unbalanced panel data, we can also estimate coefficients for time-invariant variables. We find that yield gaps determinants are crop specific. In addition to that, soil characteristics show the most significant effects on output rate. When statistically significant, correlations with the type of soil are negative. This result might suggest that the choice of cropping pattern is not necessarily appropriate.en_US
dc.description.abstractFinally, results suggest that unobservable heterogeneity of households is critical in explaining farm productivity. Time-invariant variables hardly explain this heterogeneity for which more research is needed.en_US
dc.description.statementofresponsibilityby Jean-Baptiste Seby.en_US
dc.format.extent243 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectInstitute for Data, Systems, and Society.en_US
dc.subjectTechnology and Policy Program.en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleNetworked interactions, graphical models and econometrics perspectives in data analysisen_US
dc.typeThesisen_US
dc.description.degreeS.M. in Technology and Policyen_US
dc.description.degreeS.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Institute for Data, Systems, and Societyen_US
dc.contributor.departmentTechnology and Policy Programen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Engineering Systems Division
dc.identifier.oclc1227221368en_US
dc.description.collectionS.M.inTechnologyandPolicy Massachusetts Institute of Technology, School of Engineering, Institute for Data, Systems, and Society, Technology and Policy Programen_US
dc.description.collectionS.M.MassachusettsInstituteofTechnology,DepartmentofElectricalEngineeringandComputerScienceen_US
dspace.imported2021-01-06T17:38:46Zen_US
mit.thesis.degreeMasteren_US
mit.thesis.departmentTPPen_US
mit.thesis.departmentESDen_US
mit.thesis.departmentIDSSen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record