Repository: Freie Universität Berlin, Math Department

Modularity of Directed Networks: Cycle Decomposition Approach

Djurdjevac, N. and Banisch, Ralf and Schütte, Ch. (2015) Modularity of Directed Networks: Cycle Decomposition Approach. Journal of Computational Dynamics, 2 (1). pp. 1-24. ISSN 2158-2491

Full text not available from this repository.

Official URL:


The problem of decomposing networks into modules (or clusters) has gained much attention in recent years, as it can account for a coarse-grained description of complex systems, often revealing functional subunits of these systems. A variety of module detection algorithms have been proposed, mostly oriented towards finding hard partitionings of undirected networks. Despite the increasing number of fuzzy clustering methods for directed networks, many of these approaches tend to neglect important directional information. In this paper, we present a novel random walk based approach for finding fuzzy partitions of directed, weighted networks, where edge directions play a crucial role in defining how well nodes in a module are interconnected. We will show that cycle decomposition of a random walk process connects the notion of network modules and information transport in a network, leading to a new, symmetric measure of node communication. Finally, we will use this measure to introduce a communication graph, for which we will show that although being undirected it inherits important directional information of modular structures from the original network.

Item Type:Article
Subjects:Mathematical and Computer Sciences
Divisions:Department of Mathematics and Computer Science > Institute of Mathematics
Department of Mathematics and Computer Science > Institute of Mathematics > BioComputing Group
ID Code:1511
Deposited By: Admin Administrator
Deposited On:24 Feb 2015 21:27
Last Modified:12 Nov 2015 09:45

Repository Staff Only: item control page