polblogs — Political blogs network (2004)

Description

Directed network of hyperlinks among weblogs on U.S. politics, compiled by L. A. Adamic and N. Glance to study the political blogosphere around the 2004 U.S. presidential election. Nodes are blogs, identified from online blog directories, and a directed edge $(i,j)$ indicates that the front page of blog $i$ contained a hyperlink to blog $j$; the links were extracted automatically from a crawl of the blogs' front pages in February 2005. Each blog is labeled with its political leaning, taken from the blog directories or, for some blogs, assigned manually based on their incoming and outgoing links and posts around the time of the election. According to the authors, directory-derived labels are prone to error, and manual labels even more so. The network contains 266 isolated blogs, 3 self-loops, and 65 repeated links.

The network has the following properties:

label: the URL of the blog.
value: the political leaning of the blog, with 0 = left or liberal, 1 = right or conservative.
source: the blog directories from which the blog and its label were obtained (Blogarama, BlogCatalog, eTalkingHead, LeftyDirectory, CampaignLine, BlogPulse), or "LabeledManually", separated by commas.

Tags

Informational Web graph Unweighted Metadata

Citation

L. A. Adamic and N. Glance, "The political blogosphere and the 2004 U.S. election: divided they blog." Proc. 3rd Internat. Workshop on Link Discovery (LinkKDD), 36-43 (2005). 10.1145/1134271.1134277 Sci-Hub

Upstream URL OK

http://www-personal.umich.edu/~mejn/netdata

Networks

Tip: hover over a column header for a description.

Column legend

$\left<k\right>$: Mean degree
$\sigma_k$: Standard deviation of the degrees
$\lambda_h$: Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$: Random walk mixing time
$r$: Degree assortativity
$c$: Global clustering coefficient
$\oslash$: (Pseudo-) diameter
$S$: Relative size of the largest component
NPs: Node properties
EPs: Edge properties

Name	Nodes	Edges	$\left<k\right>$	$\sigma_k$	$\lambda_h$	$\tau$	$r$	$c$	$\oslash$	$S$	Kind	Mode	NPs	EPs	gt	GraphML	GML	csv
polblogs	1,490	19,090	12.81	42.93	72.56	14.66	-0.20	0.25	8	0.82	Directed	Unipartite	label source value		64 KiB	104 KiB	105 KiB	89 KiB

Ridiculograms^*

^* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.