• Graduate program
    • Why Tinbergen Institute?
    • Program Structure
    • Courses
    • Course Registration
    • Facilities
    • Admissions
    • Recent PhD Placements
  • Research
  • News
  • Events
    • Events Calendar
    • Tinbergen Institute Lectures
    • Annual Tinbergen Institute Conference
    • Summer School
      • Inequalities in Health and Healthcare
      • Research on Productivity, Trade, and Growth
      • Behavioral Macro and Complexity
      • Business Data Science Summer School Program
    • Events Archive
  • Summer School
    • Inequalities in Health and Healthcare
    • Research on Productivity, Trade, and Growth
    • Behavioral Macro and Complexity
  • Alumni
  • Times
Home | Events Archive | Contagion in Graphons
Seminar

Contagion in Graphons


  • Series
    Array
  • Speaker(s)
    Alexander Teytelboym (University of Oxford, United Kingdom)
  • Field
    Spatial Economics
  • Location
    Online
  • Date and time

    March 18, 2021
    14:00 - 15:00

If you are interested in joining the seminar, please send an email to Daniel Haerle or Sacha den Nijs.

Abstract:
We consider a threshold contagion process over networks sampled from a graphon, which we interpret as a stochastic network formation model. We investigate whether the contagion outcome in the sampled networks can be predicted by only exploiting information about the graphon. To do so, we formally define a threshold contagion process on a graphon. Our main result shows that contagion in large but finite sampled networks is well approximated by contagion in a graphon. We illustrate our results by providing analytical characterizations for the extent of contagion and for optimal seeding policies in graphons with finite and with infinite agent types. Joint with Selman Erol (Carnegie Mellon University, United States) and Francesca Parise (Cornell University, United States)

Keywords: Graphons, Networks, Contagion, Network Games, Optimal Seeding, Interventions

Link to paper.