## Solving crimes with maths: Busting criminal networks

Submitted by Marianne on November 22, 2021Maths is often used in finding key criminals in organised crimes which involve many people, such as in terrorist attacks.
This uses an area of maths called network theory, also known as *graph theory*. A network, or graph, is a structure used to model relations between objects. It consists of a set of nodes and a set of edges.

A network (or graph) with five nodes and five edges.

We can model the network of terrorists with the nodes representing terrorists and the edges representing connections between the terrorists. Investigators analyse social networks using the notion of *centrality*, aiming to identify the key players in the network.

Centrality is used to detect the relative importance of each criminal in the network. There are various measures of centrality that are commonly used to detect key players. Depending on the measure of centrality used, we may find different results when looking for the key criminal.

### Degree centrality

*Degree centrality* measures how important a node is by counting the number of connections it has with other nodes in the graph. This is used to find popular players in the network.

A network representing 7 criminals who have connections with each other.

We can apply this equation to the network above to calculate the degree centrality of criminal Criminal is connected to 3 other criminals, criminals and There are a total of 7 nodes in this network. So, the degree centrality of criminal is

You can check for yourself that has the same value for degree centrality and that this happens to be the largest degree centrality in this network.

### Betweenness centrality

Betweenness centrality measures how important nodes are to the flow of information in the network. It measures the flow of information through a criminal along the shortest path between two other criminals in a network.

In the table below we take every pair of criminals in our example network shown above, making sure we do not repeat any pairs. Information flowing from criminal to is the same as from to because we are looking at connections which have no direction.

We then work out the shortest path between each pair of nodes (in a small network we can do this by inspection, but in a large one we can use Dijkstra's algorithm). The shortest path is the one with the smallest number of edges. Given a shortest path between two criminals, we then identify all the nodes that lie along it: these nodes will equally share a total score of 1 between them.

Here are some examples:

- Looking at the pair and we see that only criminal is on the shortest path between them, so is given a score of 1. No other criminals are on the shortest path from to , so all others get get scores of 0 for this pair.
If we look at the pair from and we see that no criminals are on the shortest paths, so all criminals get a score of 0 for this pair.

Looking at the pair and we see that we go through three other criminals on the shortest path between them. Since and are passed once and there are three criminals on the shortest path from to the scores for and for this pair are all 1/3.

The betweenness centrality of a node is defined as the sum of all its scores. In our example, the betweenness centrality of criminal is , which happens to be the largest betweenness centrality score of all the criminals of the network.

(Strictly speaking, working out the betweenness centrality of each node also requires us to divide the result we get for a node from the procedure just described by

However, this normalisation doesn’t change the order of criminals by their scores.)

### Closeness centrality

Closeness centrality measures how easily nodes are reached in the networks. It detects criminals that are easily able to send information through a network.

To calculate the closeness centrality of a node , first write for the number of nodes that are one edge away from , for the number of nodes that are two edges away from , etc, up to for the number of nodes edges away from where is the longest chain of edges you can find starting at . The closeness centrality of is defined as:

Our example network, modified to illustrate distance away from node *C* in terms of the number of edges.

As an example, suppose we want to find the closeness centrality of criminal in our example network. Criminals and are all 1 edge away from C and are illustrated with square shaped nodes. Node is 2 edges away from and shown as a triangle shaped node. Nodes and are 3 edges away from and are shown as pentagon shaped nodes. There are 3 nodes 1 edge away, 1 node 2 edges away, and 2 nodes 3 edges away from node Substituting these values into our equation, the closeness centrality of criminal is:

The way we define who is the most important criminal in the network matters. By using different measures of centrality to define the most important criminal, we may get different results. It may not necessarily be the person with the greatest number of connections who would be the key criminal in the network as we might initially think!

The maths you see in school or that you may study in the future is used in many areas of crime investigations which just goes to show how relevant maths is in the real world. There are many other exciting uses of maths in crime investigations, such as geographic profiling using Rossmo's formula and reconstructing accidents from skid marks which I encourage you to explore!

*You may also want to read Solving crimes with maths: Bloodstain pattern analysis by Marcia Gomez.*

### About the author

Marcia Gomez is a recent Maths and Economics graduate from the University of Bath, who is particularly interested in statistics and how maths is used in the real world. She is currently applying her knowledge in the world of finance.