Contagion in Graphons

58 Pages Posted:

See all articles by Selman Erol

Selman Erol

Carnegie Mellon University - David A. Tepper School of Business

Francesca Parise

Cornell University - Department of Electrical and Computer Engineering

Alexander Teytelboym

University of Oxford

Date Written: August 16, 2020

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.

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

Suggested Citation

Erol, Selman and Parise, Francesca and Teytelboym, Alexander, Contagion in Graphons (August 16, 2020). Available at SSRN: https://ssrn.com/abstract=

Selman Erol (Contact Author)

Carnegie Mellon University - David A. Tepper School of Business ( email )

5000 Forbes Avenue
Pittsburgh, PA 15213-3890
United States

Francesca Parise

Cornell University - Department of Electrical and Computer Engineering

Ithaca, NY 14853
United States

Alexander Teytelboym

University of Oxford ( email )

Mansfield Road
Oxford, Oxfordshire OX1 4AU
United Kingdom

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
43
Abstract Views
98
PlumX Metrics