|
Three models of dynamic graphs |
|
The following table summarizes three different models of dynamic graphs that will be discussed in this chapter: | | Random graphs
| Clustering
| Centrality
| Real-world phenomenon explained by model
| Giant connected component forms quickly when |E| ≅ |V|.
| Clusters emerge, providing big picture "table of contents" view.
| 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
|
|
