**Wikipedia (en)**

# Wikipedia (en)

## About this network

This is the bipartite network of excellent articles in the English Wikipedia, and the words they contain. The edge multiplicities represent the word count for each article–word pair.

## Network info

Code | EX |

Category | ⬤ Text |

Data source | http://en.wikipedia.org/wiki/Wikipedia:Featured_articles |

Vertex type | Article, word |

Edge type | Inclusion |

Format | Bipartite |

Edge weights | Multiple unweighted |

Size | 279,519 = 276,739 + 2,780 vertices (articles + words) |

Volume | 7,846,807 edges (inclusions) |

Unique volume | 2,941,902 edges (inclusions) |

Average degree (overall) | 56.709 edges / vertex |

Average article degree | 2822.6 edges / vertex |

Average word degree | 28.642 edges / vertex |

Fill | 0.0038628 edges / vertex^{2} |

Maximum degree | 3,410 edges |

Wedge count | 2,707,057,869 |

Claw count | 1,273,176,127,252 |

Square count | 113,573,615,622 |

4-tour count | 919,423,043,352 |

Power law exponent (estimated) with d_{min} | 1.5910 (d_{min} = 4) |

Gini coefficient | 95.5% |

Relative edge distribution entropy | 75.7% |

Assortativity | –0.11442 |

Diameter | 4 edges |

90-percentile effective diameter | 3.90 edges |

Mean shortest path length | 3.94 edges |

Spectral norm | 4788.8 |

Algebraic connectivity | 0.88228 |

## Downloads

TSV file: | gottron-excellent.tar.bz2 (9.69 MiB) |

## References

[1] | Wikipedia (en) network dataset -- KONECT, April 2017. [ http ] |

[2] | Wikimedia Foundation. Wikimedia downloads. http://dumps.wikimedia.org/, January 2010. |