DOI: 10.4018/978-1-5225-7528-3.ch011

Chapter Preview

TopIf the Social Web is about how people relate to each other through a range of electronic means, it is also about relationships between inanimate shared digital objects like words, like folksonomic tags, like crowd-sourced articles, and other byproducts of intense sharing. Article-article networks on Wikipedia are pages related to each other through the power of http outlinking from a target article. These are a form of link networks based on co-related http links. Such direct pagelink networks of articles (normal pages on Wikipedia) are conceptualized as indicating “that there is a topical relation between articles, since completely unrelated articles would not refer to each other” (Suchecki, Salah, Gao, & Scharnhorst, 2012, p. 12), or topically-related “document networks”. Figure 1 shows the “Wikipedia” article (

Table 1 shows some of the graph metrics for Figure 1. This one-degree network captured 571 vertices or nodes, and there were 570 unique edges. The network graph was drawn using the Fruchterman-Reingold force-directed layout algorithm, with the target node in the middle. It is possible to acquire a gist of the linkages with a light perusal. There is only one group or one large connected component in this network. The maximum geodesic distance of this network (the graph diameter) is two, to move from one end of the network graph to the other (and this is to be expected with one-degree network graphs).

Graph metrics for the Wikipedia article network on Wikipedia (1 deg.)

Graph Metric | Value |

Graph Type | Directed |

Vertices | 571 |

Unique Edges | 570 |

Edges With Duplicates | 0 |

Total Edges | 570 |

Self-Loops | 0 |

Reciprocated Vertex Pair Ratio | 0 |

Reciprocated Edge Ratio | 0 |

Connected Components | 1 |

Single-Vertex Connected Components | 0 |

Maximum Vertices in a Connected Component | 571 |

Maximum Edges in a Connected Component | 570 |

Maximum Geodesic Distance (Diameter) | 2 |

Average Geodesic Distance | 1.993001 |

Graph Density | 0.001751313 |

Modularity | Not Applicable |

NodeXL Version | 1.0.1.336 |

Article-Article Network: Articles connected or related by embedded outgoing http links from a target article.

Directed graph: A network diagram with edges with arrows on one or both line ends to indicate relationship direction.

Ego Neighborhood: A direct network with a target node and alters connected to that central node by one degree.

Wiki: A collaboratively edited website with a fast-edit understucture enabling various functionalities.

Link Network: An interconnected group of co-related http links.

Undirected graph: A network diagram with edges without arrows on the ends (indicating relationship but not the direction of relation).

Search this Book:

Reset

Copyright © 1988-2019, IGI Global - All Rights Reserved