rt-retweet-crawl (Retweet Networks)
Download network data
This network is in the collection of Retweet Networks
Visualize rt-retweet-crawl'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 Network |
| Collection | Retweet network |
| Tags | |
| Short | Twitter retweet network |
| Vertex type | User |
| Edge type | Retweet |
| Edge weights | Unweighted |
| Description | Nodes are twitter users and edges are retweets. These were collected from various social and political hashtags. |
Please cite the following if you use the data:
Note that if you transform/preprocess the data, please consider sharing the data by uploading it along with the details on the transformation and reference to any published materials using it.
@inproceedings{nr,
title={The Network Data Repository with Interactive Graph Analytics and Visualization},
author={Ryan A. Rossi and Nesreen K. Ahmed},
booktitle={AAAI},
url={https://networkrepository.com},
year={2015}
}
@article{rossi2012fastclique,
title={What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks},
author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and Mostofa A. Patwary},
journal={arXiv preprint arXiv:1210.5802},
pages={1--11},
year={2012}
}
@inproceedings{rossi2014pmc-www,
title={Fast Maximum Clique Algorithms for Large Graphs},
author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and Mostofa A. Patwary},
booktitle={Proceedings of the 23rd International Conference on World Wide Web (WWW)},
year={2014}
}
Network Statistics
| Nodes | 1.1M |
| Edges | 2.3M |
| Density | 3.68119e-06 |
| Maximum degree | 5.1K |
| Minimum degree | 1 |
| Average degree | 4 |
| Assortativity | -0.0181615 |
| Number of triangles | 525.9K |
| Average number of triangles | 0 |
| Maximum number of triangles | 1.6K |
| Average clustering coefficient | 0.0186996 |
| Fraction of closed triangles | 0.00336442 |
| Maximum k-core | 19 |
| Lower bound of Maximum Clique | 13 |
Data Preview
Interactive visualization of rt-retweet-crawl'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 rt-retweet-crawl 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.
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.