### web-wiki-ch-internal (Web Graphs)

#### Download network data

This network is in the collection of Web Graphs

Visualize web-wiki-ch-internal's link structure and discover valuable insights using our interactive graph visualization platform. Compare with hundreds of other networks across many different collections and types.

### Metadata

Category | Sparse Networks |

Collection | Web Graphs |

Tags | |

Short | Web graph of Chinese Wikipedia Articles |

Vertex type | Article |

Edge type | Hyperlinks |

Format | Directed |

Edge weights | Multigraph, unweighted |

Description | Directed network of hyperlinks between the articles of Wikipedia in Chinese. |

#### Citing the repository in published materials

If you find Network Repository useful for your research, please consider citing the following paper:

Note that if you transform/preprocess this data for your own research, we ask that you please share the data by uploading it along with details on the transformation and reference to any published materials.

`@inproceedings{nr,`

title={The Network Data Repository with Interactive Graph Analytics and Visualization},

author={Ryan A. Rossi and Nesreen K. Ahmed},

booktitle={Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence},

url={http://networkrepository.com},

year={2015}

}

`@incollection{niu2011zhishi,`

title={{Zhishi.me} -- Weaving Chinese linking open data},

author={Niu, Xing and Sun, Xinruo and Wang, Haofen and Rong, Shu and Qi, Guilin and Yu, Yong},

booktitle={ISWC},

pages={205--220},

year={2011},

publisher={Springer}}

### Network Statistics

Nodes | 1.9M |

Edges | 9.4M |

Density | 5.02101e-06 |

Maximum degree | 29.5K |

Minimum degree | 1 |

Average degree | 9 |

Assortativity | -0.0466194 |

Number of triangles | 70M |

Average number of triangles | 36 |

Maximum number of triangles | 600.1K |

Average clustering coefficient | 0.111251 |

Fraction of closed triangles | 0.00927161 |

Maximum k-core | 128 |

Lower bound of Maximum Clique | 13 |

### Data Preview

### Interactive visualization of web-wiki-ch-internal's graph structure

#### Interactively explore the networks graph structure!

- Use mouse wheel to zoom in/out
- Mouseover nodes to see their degree
- Drag network to see more details

### Interactive Visualization of Node-level Properties and Statistics

#### Tools for Interactive Exploration of Node-level Statistics

**Visualize and interactively explore web-wiki-ch-internal and its important node-level statistics!**

- Each point represents a node (vertex) in the graph.
- A subset of interesting nodes may be selected and their properties may be visualized across all node-level statistics. To select a subset of nodes,
*hold down the left mouse button while dragging the mouse in any direction*until the nodes of interest are highlighted.This feature allows users to explore and analyze various subsets of nodes and their important interesting statistics and properties to gain insights into the graph data - Zoom in/out on the visualization you created at any point by using the buttons below on the left.
- Once a subset of interesting nodes are selected, the user may further analyze by selecting and drilling down on any of the interesting properties using the left menu below.
- We also have tools for
*interactively visualizing*,*comparing*, and*exploring*the graph-level properties and statistics.

**Note: You are not logged in!**

Please login or join the community to leverage the many other tools and features available in our interactive graph analytics platform.

### Interactive Visualization of Node-level Feature Distributions

#### Node-level Feature Distributions

### Discuss and Share

#### Collaborate and contribute to the *first interactive and community-oriented data repository*!

Share key insights, awesome visualizations, or simply discuss advantages of data, any observed or known properties, challenges, problems, corrections, and any other helpful comments! Post and discuss recent published works that utilize this dataset (including your own). Any and all feedback is welcome and encouraged.