A Weak Law for Moments of Pairwise-Stable Networks

Add to your list(s) Download to your calendar using vCal

• Michael Leung (Massachusetts Institute of Technology)
• Tuesday 12 July 2016, 15:00-15:30
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

SNAW01 - Graph limits and statistics

We develop asymptotic theory for strategic network-formation models under the assumption that the econometrician observes a single large pairwise-stable network. Drawing on techniques from the literature on random graphs, we derive primitive restrictions on the model that establish a weak law of large numbers for a useful class of network moments. Under these restrictions, we show that the model generates realistic networks that are sparse and may contain “giant” connected subnetworks, two well-known properties of real-world social networks. The restrictions also conveniently suggest a new method to simulate counterfactual networks that avoids a well-known curse of dimensionality. Additionally, we characterize the identified set of structural parameters based on a tractable class of dyad-level network moments and construct consistent set estimators.

Related Links

• http://web.mit.edu/mpleung/www – home page 

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.