2026-09-19T22:56:25Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1290812022-01-31T18:58:42Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Chintan Vaishnav and John Tsitsiklis. Seby, Jean-Baptiste. Massachusetts Institute of Technology. Institute for Data, Systems, and Society. Technology and Policy Program. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Institute for Data, Systems, and Society Technology and Policy Program Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Engineering Systems Division 2021-01-06T17:38:47Z 2021-01-06T17:38:47Z 2020 2020 https://hdl.handle.net/1721.1/129081 1227221368 Thesis: S.M. in Technology and Policy, Massachusetts Institute of Technology, School of Engineering, Institute for Data, Systems, and Society, Technology and Policy Program, September, 2020 Thesis: S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020 Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (pages 231-243). This 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]. Conducting 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. Finally, 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. by Jean-Baptiste Seby. S.M. in Technology and Policy S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science S.M.inTechnologyandPolicy Massachusetts Institute of Technology, School of Engineering, Institute for Data, Systems, and Society, Technology and Policy Program S.M.MassachusettsInstituteofTechnology,DepartmentofElectricalEngineeringandComputerScience 243 pages eng Massachusetts Institute of Technology MIT 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. http://dspace.mit.edu/handle/1721.1/7582 Institute for Data, Systems, and Society. Technology and Policy Program. Electrical Engineering and Computer Science. Networked interactions, graphical models and econometrics perspectives in data analysis Thesis application/pdf 2021-01-06T17:38:46Z Publication Master TPP ESD IDSS unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4f96f447-f09e-4252-8654-7f9c6bb8fc14"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Networked interactions, graphical models and econometrics perspectives in data analysis</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2020</PublicationDate> <Authors> <Author> <DisplayName>Seby, Jean-Baptiste.</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Institute for Data, Systems, and Society.</Keyword> <Keyword>Technology and Policy Program.</Keyword> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>This 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].</Abstract> <Abstract>Conducting 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.</Abstract> <Abstract>Finally, 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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>