Bezoek de website voor leraren en scholieren →

Below a poster about Structure in social networks which was made for mathematics exhibition IMAGINARY. This poster was made by Clara Stegehuis, assistant professor at Twente University.

### Communities in social networks

Before you can start looking for the network communities, we first have to know what a community is. The poster suggests that a community has the following properties:

- There exist relatively many connections between nodes in the same community.

- There exist relatively few connections between nodes in different communities.

To find the network communities, we need a mathematical equation that describes when a division of the network into communities meets these two criteria. One of the first such equations, the so-called modularity equation, uses exactly these two community properties.

Suppose we divide a network into several groups. Then the modularity of this network division is an equation with two terms. The first term counts the number of connections within all groups. In short, this says that we would like to have as many connections as possible within the groups. Unfortunately, only maximizing this term will not help.

If we only maximize the number of connections within the groups, then the best division is to put all nodes of the network into one large community. In that case, all network connections are within the same community. To overcome this problem, the modularity equation subtracts a second term from the first term.

This second term describes the expected number of connections within each group if we would redraw the network with the same number of connections per point, but make the connections randomly. Then the division into only one community is not too good anymore. For only one community, we already expected that all connections are within that same community, so the modularity of the one single community is equal to zero. Modularity, therefore, measures how many more connections there are within the communities than we actually expected.

Feel free to print and use this poster for educational purposes. Since this material is protected under a Creative Commons licence we ask you to mention Anna Priante and the Network Pages when using it.

• Update

### Science Illustrations updated•

We have a special category with science illustations on various topics related to networks and algorithms. Many of these illustrations were developed specifically for the Network Pages. The four posters made for mathematics exhibition IMAGINARY have been added.
• Article

### Why packing your car can be so frustrating.•

Are you one of those people who always seems to pack just a bit too much for your car to handle when packing for a vacation? Then you should have a look at this article!
• Update

### Clara Stegehuis selected as one of the 'thirty talents under thirty'•

Dr. Clara Stegehuis, mathematician at Twente University, has been selected as one of the 'thirty talents under thirty' in Elsevier Weekblad.