CREST-ENSAE Mini-course Microeconometrics of Modeling Labor Markets Using Linked Employer-Employee Data John M. Abowd portions of today’s lecture are the.

Slides:



Advertisements
Similar presentations
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Advertisements

Social network partition Presenter: Xiaofei Cao Partick Berg.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
15 THEORY OF GAMES CHAPTER.
Chapter 8 Counting Principles: Further Probability Topics Section 8.5 Probability Distributions; Expected Value.
Modularity and community structure in networks
Distributed Breadth-First Search with 2-D Partitioning Edmond Chow, Keith Henderson, Andy Yoo Lawrence Livermore National Laboratory LLNL Technical report.
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
Structural Inference of Hierarchies in Networks BY Yu Shuzhi 27, Mar 2014.
10/11/2001Random walks and spectral segmentation1 CSE 291 Fall 2001 Marina Meila and Jianbo Shi: Learning Segmentation by Random Walks/A Random Walks View.
Mining and Searching Massive Graphs (Networks)
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Lecture 21: Spectral Clustering
CS 584. Review n Systems of equations and finite element methods are related.
Centrality and Prestige HCC Spring 2005 Wednesday, April 13, 2005 Aliseya Wright.
DATA ANALYSIS Module Code: CA660 Lecture Block 2.
Representing Graphs Wade Trappe. Lecture Overview Introduction Some Terminology –Paths Adjacency Matrix.
Lecture 9 Hidden Markov Models BioE 480 Sept 21, 2004.
Link Analysis, PageRank and Search Engines on the Web
MAE 552 – Heuristic Optimization Lecture 26 April 1, 2002 Topic:Branch and Bound.
A scalable multilevel algorithm for community structure detection
© John M. Abowd 2005, all rights reserved Statistical Tools for Data Integration John M. Abowd April 2005.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
Chapter 26: Comparing Counts. To analyze categorical data, we construct two-way tables and examine the counts of percents of the explanatory and response.
Department of Geography and Urban Studies, Temple University GUS 0265/0465 Applications in GIS/Geographic Data Analysis Lecture 3: Network Data Models.
Computer Science 1 Web as a graph Anna Karpovsky.
HCC class lecture 14 comments John Canny 3/9/05. Administrivia.
Graphs, relations and matrices
Random Graph Models of Social Networks Paper Authors: M.E. Newman, D.J. Watts, S.H. Strogatz Presentation presented by Jessie Riposo.
Information Networks Power Laws and Network Models Lecture 3.
Graph Algorithms Ch. 5 Lin and Dyer. Graphs Are everywhere Manifest in the flow of s Connections on social network Bus or flight routes Social graphs:
C&O 355 Mathematical Programming Fall 2010 Lecture 17 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
CREST-ENSAE Mini-course Microeconometrics of Modeling Labor Markets Using Linked Employer-Employee Data John M. Abowd portions of today’s lecture are.
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
Lecture 5.2: Special Graphs and Matrix Representation CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Zeph Grunschlag.
DATA MINING LECTURE 13 Pagerank, Absorbing Random Walks Coverage Problems.
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Spectral Analysis based on the Adjacency Matrix of Network Data Leting Wu Fall 2009.
CS774. Markov Random Field : Theory and Application Lecture 02
© John M. Abowd 2007, all rights reserved General Methods for Missing Data John M. Abowd March 2007.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Introduction to Graph Theory
Graphs and 2-Way Bounding Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 /File:7_bridgesID.png.
Sampling and estimation Petter Mostad
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Graphs Basic properties.
Paper_topic: Parallel Matrix Multiplication using Vertical Data.
geometric representations of graphs
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Network Theory: Community Detection Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.
Lecture 3 Appendix 1 Computation of the conditional entropy.
Presented by Alon Levin
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
C&O 355 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
CREST-ENSAE Mini-course Microeconometrics of Modeling Labor Markets Using Linked Employer-Employee Data John M. Abowd portions of today’s lecture are joint.
Lecture 5 Graph Theory prepped by Lecturer ahmed AL tememe 1.
Virtual University of Pakistan Lecture No. 35 of the course on Statistics and Probability by Miss Saleha Naghmi Habibullah.
INFO 7470 Statistical Tools: Hierarchical Models and Network Analysis John M. Abowd and Lars Vilhuber May 2, 2016.
Random Walk for Similarity Testing in Complex Networks
Graph Theory and Algorithm 02
Dissertation for the degree of Philosophiae Doctor (PhD)
Approximating the Community Structure of the Long Tail
geometric representations of graphs
Noémi Gaskó, Rodica Ioana Lung, Mihai Alexandru Suciu
3.3 Network-Centric Community Detection
Discrete Mathematics Lecture 12: Graph Theory
Some graphs you may have met under different circumstances.
CSE 6408 Advanced Algorithms.
Text Book: Introduction to algorithms By C L R S
Presentation transcript:

CREST-ENSAE Mini-course Microeconometrics of Modeling Labor Markets Using Linked Employer-Employee Data John M. Abowd portions of today’s lecture are the work of Kevin McKinney (U.S. Census Bureau) and Ian Schmutte (University of Georgia) June 6, 2013

Topics May 30: Basics of analyzing complex linked data June 3: Basics of graph theory with applications to labor markets June 6: Matching and sorting models June 10: Endogenous mobility models Online course materials 6 June 2013© John M. Abowd and others, 20132

Lecture 3 More results on graph sampling More results on using modularity to find communities Matching and sorting models 6 June 2013© John M. Abowd and others, 20133

MORE APPLICATIONS OF SAMPLING GRAPHS (WORK OF MCKINNEY) 6 June 2013© John M. Abowd and others, 20134

Generating Connected Samples Let B be the upper right-hand corner of the adjacency matrix of the realized mobility network, as defined in lecture 2 B has I rows (one for each worker) B has J columns (one for each employer) Elements of B are the counts of the number of periods that worker i was employed by employer j 6 June 2013© John M. Abowd and others, 20135

Projection onto the Employer Nodes The projection of the bipartite graph of the realized mobility network onto employer nodes is accomplished by computing a new adjacency matrix P F = B T B Let S F be the column sums of B (employer degree distribution Then the adjacency matrix of the employer projection is AF = 1(P F - diag(S F )>0), where 1() is the element-wise indicator function 6 June 2013© John M. Abowd and others, 20136

Generating Connected Samples Accomplished by taking a sample of nodes from the employer projection where each node has a constant steady state selection probability of 1/(I – J) rather than the usual random walk procedure where each node would have selection probability of degree(node j )/(2|P F |) where |P F | is the number of edges in the employer projection 6 June 2013© John M. Abowd and others, 20137

6 June 2013© John M. Abowd and others, 20138

6 June 2013© John M. Abowd and others, 20139

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

MORE APPLICATIONS OF MODULARITY MODELING (WORK OF SCHMUTTE) 6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

Modularity Determined Communities in Brazilian Linked EE Data RAIS graphs display the projection of the RMN in RAIS data ( ) onto plants. After the projection, take a 5 percent random sample of plants along with their associated edges. The graph shows the structure after eliminating small degree nodes (degree <= 10). This shows about 25 percent of edges. Colors in the graph correspond to the maximum modularity partition of nodes into 15 communities at modularity of 0.65, which is very strong 6 June 2013© John M. Abowd and others,

PSID Communities (Industry x Occupation Pseudo-employers) 6 June 2013© John M. Abowd and others,

Raw Graph of Brazilian Data 6 June 2013© John M. Abowd and others,

Maximum Modularity Communities in Brazilian EE Data 6 June 2013© John M. Abowd and others,

Other Applications of Coloring Different definitions of communities (minimum cuts, maximum likelihood clustering) Showing conditional independence – Conditional independence can be used to massively increase the parallelization of a particular computation – This permits much faster estimation 6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

SORTING AND MATCHING MODELS 6 June 2013© John M. Abowd and others,

How to Fit Matching Models Setting up equilibrium matching models Example using the Shimer (2005) model – Lecture based on Abowd, Kramarz, Perez-Duarte, and Schmutte (2012)Abowd, Kramarz, Perez-Duarte, and Schmutte (2012) Some critiques of these approaches 6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

6 June 2013© John M. Abowd and others,

The Critique of Eeckhout and Kircher See Eeckhout and Kircher (2011)Eeckhout and Kircher (2011) Without frictions, their proposition 1 states that for any production function that can induce positive sorting there exists a production function that can induce negative sorting with the same equilibrium wage function 6 June 2013© John M. Abowd and others,

The Critique of Eeckhout and Kircher See Eeckhout and Kircher (2011)Eeckhout and Kircher (2011) With search frictions, for every supermodular production function (production complements) that induces positive sorting, there exists a submodular production function (production substitutes) that induces the same wage distribution once the firm types are relabeled (reversing their order) 6 June 2013© John M. Abowd and others,

What to Do? First, these points were made in the Abowd and Kramarz handbook paper (1999) regarding interpretations of the AKM decomposition as structural1999 Eeckhout and Kircher are much more general Must use additional outcomes – Actual vacancy data – Actual production data 6 June 2013© John M. Abowd and others,

Summary Sampling matters for estimation of decomposition regardless of interpretation Maximum modularity methods produce interesting measures of the mobility communities in linked EE data Structural models of matching and sorting are feasible but the interpretation of the results may not be general 6 June 2013© John M. Abowd and others,