Explore
For Enterprise
Join for Free
Log In

Arts et humanités
Business
Informatique
Science des données
Technologies de l'information
santé
Mathématiques et logique
Développement personnel
Sciences physiques et ingénierie
Sciences sociales
Apprentissage des langues
Diplômes
Certificats

Explorez l'intégralité de Coursera

Parcourir
Rechercher
For Enterprise
Connexion
Inscrivez-vous gratuitement

5.3: Diffusion on Random Networks

Loading...

Réseaux sociaux et économiques : modèles et analyse

Université de Stanford

4.8 (430 notes) | 32K étudiants inscrits

Learn how to model social and economic networks and their impact on human behavior. How do networks form, why do they exhibit certain patterns, and how does their structure impact diffusion, learning, and other behaviors? We will bring together models and techniques from economics, sociology, math, physics, statistics and computer science to answer these questions. The course begins with some empirical background on social and economic networks, and an overview of concepts used to describe and measure networks. Next, we will cover a set of models of how networks form, including random network models as well as strategic formation models, and some hybrids. We will then discuss a series of models of how networks impact behavior, including contagion, diffusion, learning, and peer influences. You can find a more detailed syllabus here: http://web.stanford.edu/~jacksonm/Networks-Online-Syllabus.pdf You can find a short introductory videao here: http://web.stanford.edu/~jacksonm/Intro_Networks.mp4

Visualiser le programme de cours

Compétences que vous apprendrez

Social Network, Game Theory, Network Analysis, Network Theory

Avis

4.8 (430 notes)

5 stars
360 ratings
4 stars
60 ratings
3 stars
8 ratings
1 star
2 ratings

MG

Apr 17, 2018

Great survey course for social network analysis. Dr. Jackson's lectures motivated me to buy the book, and I hope to come back to this course later to work more on the optional parts.

TC

Apr 30, 2017

An overview of concepts and models of how networks form. There are applicable with basic concepts from probability theory, statistics, and some light calculus astonishingly well.

À partir de la leçon

Diffusion on Networks

Empirical Background, The Bass Model, Random Network Models of Contagion, The SIS model, Fitting a Simulated Model to Data.

5.1: Diffusion12:57

5.2: Bass Model12:21

5.3: Diffusion on Random Networks 9:08

5.4: Giant Component Poisson Case 15:09

5.5: SIS Model17:50

5.6: Solving the SIS Model 9:17

5.7: Solving the SIS Model - Ordering (Optional/Advanced 24:16)24:16

5.8a: Fitting a Diffusion Model to Data (Optional/Advanced 22:47)22:45

5.8b: Application: Financial Contagions (Optional/Advanced 12:47)12:48

5.8c: Application: Financial Contagions - Simulations (Optional/Advanced 13:41)13:42

5.9: Diffusion Summary 3:45

5.10: Week 5 Wrap4:25

Enseigné par

Matthew O. Jackson
Professor

Transcription

Hi, folks. So we're back again, and

we're talking more about diffusion.

And so we've gone through some basic questions and looked at the Bass Model.

And now we're going to look at richer models that begin to bring in some network

structure, and trying to understand how network structure impacts diffusion.

And what we'll do is we'll start with very simple versions of this where we'll work

with [INAUDIBLE] style networks.

And then we can talk about other kinds of networks as well, and what we can

say about how things like the degree distribution affect diffusion processes.

Okay, so we're bringing in the interaction structure now.

And the basic idea here is going to be that there's

some process going on in the network.

And we'll be thinking, one thing that's going to be important is thinking

about what's the right network to define.

And often in a lot of what we've been looking at,

we've just been sort of taking networks and links as a given and

not explore too much which particular network we want to be looking at, and

exactly what should be defining the nodes and the links.

So in this kind of situation, ultimately what's really going to be important is

when we think about a relationship or a link between two individuals,

we should think of two people being related if one has a chance of

passing something to the other in whatever our diffusion process is.

So if we're thinking about the flu, then we would think about, okay,

I'd be connected to all the individuals who I might infect, and so

that might be a very broad range of individuals.

Whereas, if we're thinking about a political view or

some new technology that I might tell somebody about, it might be

a much narrower set of individuals who we might have that kind of interaction.

So, nodes are going to be linked if one would infect the other.

And one substantial simplification we're going to make to begin with is that

this is going to be sort of an independent and identical probability across links.

So, each person has an equal chance of infecting any one of their neighbors.

Whereas, that might not be true in reality where you might spend more time

interacting with some individuals than others, and have more of a chance

of a diffusion process proceeding across some links than others.

So, we'll define the links by

the interactions that are necessary for diffusion.

We'll think about questions about, when will an infection take hold?

How many nodes or how many people will it reach?

So, when do we get diffusion?

What's the extent of the diffusion?

How does it depend on the process and the network structure?

Who's likely to be infected earliest?

These are the kinds of questions that we can begin to answer now

with the network analysis.

So, an important part of this is going to be understanding

what the component structure is.

So the reach of the contagion is going to be determined by the component structure

where what we think of is in terms of links,

as links being put down probabilistically according to whether or

not two individuals would actually transmit from one to another.

So it's possible that some nodes or players are going to be immune.

Links might fail, so what we're going to look at is what other components look like

if only we consider the nodes that are susceptible and

links that are actually going to transmit.

Okay, so just to sort of remind you, this is a picture from Bear,

Moody, and Stovel's 2004 data as high school romances.

This would be something, if we were thinking about transmission of

mononucleosis or something, we could think about a network like this.

And what we end up with is the component structure will actually tell us a lot.

So if an initially infected individual ends up being in one of these nodes,

then if they end up being in the large component,

then things can spread quite extensively.

If they end up being in the small component,

then things can be quite limited.

And so, looking at the component structure will help us answer two questions.

First of all, what's the probability that we start a contagion?

And that's going to be the probability that we end up sort of hitting one of

these large components, the large component,

in this case the giant component, and then how extensive should it be.

And in this case, if we did hit somebody in the giant component,

then the reach of it could potentially be the size of the giant component.

So understanding what the component structure is will help us understand

both the probability of starting and the eventual reach conditional on that.

So, we'll think about getting nontrivial diffusion if somebody in

the giant component is infected adopts, so I'll use the word infected but

it could be adopting a new technology, and so forth.

And the size of the giant components can determine both likelihood and its extent.

And random network models are going to allow for giant component calculations.

And now, in terms of what we want to be thinking about in links now.

We could can say, okay, well, a lot of networks we actually look at in the real

world might be very well-connected and have links so that everyone can reach

everyone else in the world, and so the world is one giant component.

But the component structure we actually want to be thinking about are going to

have link probabilities that are associated with the likelihood that

one individual actually infects another.

So it might be that somebody just doesn't catch the flu because they

don't have interactions with people at the right times, and so forth.

So, the network again we're going to looking at is, our people going to

interact within a given time period when they're infected enough to transmit.

And that can actually have a much more fragmented network structure

than an overall long-term network that we would look at normally.

Okay, so what we can do is a simple example of such a calculation.

And we'll start by working at Erdos-Renyi style random network, and

then we'll also talk about other degree distributions.

And the main question we're going to be answering is just,

what can we say about how big the giant component is in such a network?

Okay, so how big is a giant component if there is one?

And let's think about, so let's think about GNP as our starting model.

And if we think about that in terms of the starting model,

then the size of the giant component's going to be interesting.

When p is in the range where the giant component isn't, so

small that it doesn't exist or so large that we have almost full connection.

So the interesting region is going to be when p is somewhere between 1/n and

log(n)/n.

And otherwise, we're going to have basically isolated small components or

a fully-connected network.

And if we remember from before, when p was smaller than 1,

sorry, expected degree is smaller than 1.

So that's what's in this range here with 50 nodes, p being .01,

each percentage has an expected range of half a neighbor.

Then we end up with not many people infecting each other, and so

we end up with lots of very tiny components.

Actually, only one that even has two links in it and lots of isolates.

So this kind of situation, if the interaction structure was so

limited we wouldn't see much of a contagion at all.

So, .02 is the point at which you have one unexpected neighbor above that,

you begin to get a giant component.

And here we would end up having about half the nodes,

a little more than half in the giant component.

And so it would be about half a probability of infecting, and

it would infect half of the population.

Once you get to about two and a half as an expected set of neighbors,

then we get almost the whole network, the whole population connected,

so we have a high probability of reaching everybody, and

a high number of people infected once one person is.

And then once we get here with 50 nodes, once we have an expected degree of 5,

we would pass the threshold for connection and we end up having a connected network.

And now, if the interaction structure resistance,

then you would expect a full contagion.

Okay, so what we're going to do is actually go through some calculations next

to give us more explicit numbers on some of these things, and

calculate the size, the expected size of the giant component

rather than just looking at these pictures.

So the pictures are based on these thresholds.

And indeed, when we go from the threshold below expected degree of one to a high

enough expected degree to have everybody connected,

we're going to hit the two extremes.

And the interesting part's going to be in-between, so

let's take a look at that next.

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.

Coursera propose un accès universel à la meilleure formation au monde, en partenariat avec des universités et des organisations du plus haut niveau, pour proposer des cours en ligne.

© 2019 Coursera Inc. Tous droits réservés.

Télécharger dans l'App Store

Disponible sur Google Play

Coursera
À propos
Direction
Carrières
Catalogue
Certificats
Certificats MasterTrack™
Diplômes
For Enterprise
For Government

Communauté
Learners
Partners
Developers
Beta Testers
Translators

Se connecter
Blog
Facebook
LinkedIn
Twitter
Instagram
YouTube
Blog Tech

Plus
Conditions
Confidentialité
Aide
Accessibilité
Presse
Contact
Répertoire
Filiales