|
How randomness, homophily, and cumulative advantage shape the Web: Network Dynamics - Limitations of traditional graph theory
- Introduction to network dynamics
- Three models of dynamic graphs
- Random graphs
- Demonstration of random graph dynamics
- Random graph algorithm
- Clusters and homophily
- Triadic closure
- Triadic closure algorithm
- Hubs and cumulative advantage
- Preferential attachment algorithm
See also: All the above are summarized in the following table: | | Random graphs
| Clustering
| Centrality
| Real-world phenomenon explained by model
| Giant component forms quickly when |E| ≅ |V|.
| Clusters emerge, providing "table of contents" overview.
| Hubs emerge, indicating popularity and/or influence.
| Web sites
| N/A
| Clusty, iBoogie, Grokker
| Google et al
| Sociological force
| Chance
| Homophily
| Cumulative advantage
| Mathematical model
| Random graph algorithm
| Triadic closure algorithm
| Preferential attachment algorithm
|
|
