Djurdjevac, N. and Bruckner, S. and Conrad, T. O. F. and Schütte, Ch.
(2012)
*Random Walks on Complex Modular Networks.*
Journal of Numerical Analysis, Industrial and Applied Mathematics, 6
(1-2).
pp. 29-50.
ISSN 1790–8140

Full text not available from this repository.

## Abstract

Complex modular networks appear frequently, notably in the biological or social sciences. We focus on two current challenges regarding network modularity: the ability to identify (i) the modules of a given network, and (ii) the hub states as nodes with highest importance in terms of the communication between modules. Our approach towards these goals uses random walks as a mean to global analysis of the topology and communication structure of the network. We show how to adapt recent research regarding coarse graining of random walks. The resulting algorithms are based on spectral analysis of random walks and allow (A) an optimal identification of fuzzy assignments of nodes to modules, (B) computation of the fraction of the overall communication between modules supported by certain nodes, and (C) determination of the hubs as the nodes with the highest communication load.

Item Type: | Article |
---|---|

Subjects: | Mathematical and Computer Sciences > Mathematics > Numerical Analysis |

Divisions: | Department of Mathematics and Computer Science > Institute of Mathematics > Comp. Proteomics Group Department of Mathematics and Computer Science > Institute of Mathematics Department of Mathematics and Computer Science > Institute of Mathematics > BioComputing Group |

ID Code: | 1090 |

Deposited By: | Admin Administrator |

Deposited On: | 08 Sep 2011 12:33 |

Last Modified: | 29 Jan 2013 14:19 |

Repository Staff Only: item control page