An evaluation of random-walk based clustering of multiplex networks

Sammanfattning: A network, or a graph, is a mathematical construct used for modeling relationships between different entities. An extension of an ordinary network is a multiplex network. A multiplex network enables one to model different kinds of relationships between the same entities, or even to model how relationships between entities change over time. A common network analysis task is to find groups of nodes that are unusually tightly connected. This is called community detection, and is a form of clustering. The multiplex extension complicates both the notion of what a community is, and the process of finding them.This project focuses on a random-walk based local method that can be used to find communities centered around supplied seed nodes. An implementation of the methodis made which is used to evaluate its ability to detect communities in different kinds of multiplex networks.