# Hairball Graphs (data)

### From visone user support

## Dataset Description

A simple model generating random graphs with cohesive groups that are connected into a small world is the *planted partition model* (PPM).

Let be a partition of $V$ for a graph *G* = (*V*,*E*). Then is called a clustering of *G* with class for a vertex .
The probability of an edge (*u*,*v*) is *p*_{in} if *c*(*u*) = *c*(*v*) and *p*_{out} if .

We generated 50 graphs from a PPM with 500 vertices, *k* = 9, *p*_{in} = 0.3, and *p*_{out} = 0.01. On top of that, we ran a random noise model with *p*_{in} = *p*_{out} = 0.1 to obfuscate the underlying groups. The resulting graphs are very dense, have a low diameter, and are real hairballs without any visible structure when laid out using force-directed methods.

## Download

graphml format:
**Hairball-Graphs-PPM500.zip** (11 MB)