login

Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods

Lecture notes in computer sciencePublished 1 January 2008Open access
Marija Mitrović Dankulov, Bosiljka Tadić
Citations13
SJR quartileQ2
SJR score0.35
SNIP0.55
View PDF

TL;DR

This work studies modular networks using generalized method of maximum likelihood, which is based on weights of links and shows it's efficiency in finding weighted subgraphs on fully connected graph and on real-data network of yeast.

Abstract

Real-data networks often appear to have strong modularity, or network-of-networks structure, in which subgraphs of various size and consistency occur. Finding the respective subgraph structure is of great importance, in particular for understanding the dynamics on these networks. Here we study modular networks using generalized method of maximum likelihood. We first demonstrate how the method works on computer-generated networks with the subgraphs of controlled connection strengths and clustering. We then implement the algorithm which is based on weights of links and show it's efficiency in finding weighted subgraphs on fully connected graph and on real-data network of yeast.

Keywords

Computer SciencePhysics and Astronomy