Lateral diffusion is the process whereby information can be spread from one node in a social network to another, often in a selective way, and can rapidly traverse an entire population, but preferentially to those nodes likely to be interested, or needing to know. This is similar to how rumours, gossip and jokes rapidly spread. But note that each sender can be selective: a sender wouldn't necessarily tell a superior a joke he might not approve of.
| Property | Value |
|---|
| dbpprop:abstract
|
- Lateral diffusion is the process whereby information can be spread from one node in a social network to another, often in a selective way, and can rapidly traverse an entire population, but preferentially to those nodes likely to be interested, or needing to know. This is similar to how rumours, gossip and jokes rapidly spread. But note that each sender can be selective: a sender wouldn't necessarily tell a superior a joke he might not approve of. Senders also tend to pass on information to those who they know from personal experience would be interested or need to know. In this way it has been shown that typically no more than 6 intermediaries are likely to link the most extreme chain of lateral diffusion - see six degrees of separation even worldwide.
|
| dbpprop:hasPhotoCollection
| |
| dbpprop:reference
| |
| rdf:type
| |
| rdfs:comment
|
- Lateral diffusion is the process whereby information can be spread from one node in a social network to another, often in a selective way, and can rapidly traverse an entire population, but preferentially to those nodes likely to be interested, or needing to know. This is similar to how rumours, gossip and jokes rapidly spread. But note that each sender can be selective: a sender wouldn't necessarily tell a superior a joke he might not approve of.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is owl:sameAs
of | |
![[RDF Data]](/statics/sw-cube.png)
