Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods

Authors:
Marija Mitrović;Bosiljka Tadić
Affiliations:
Institute of Physics, Belgrade, Serbia;Jožef Stefan Institute, Ljubljana, Slovenia
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
Year:
2008

Citing 3
Cited 0

Introduction to Algorithms

Introduction to Algorithms
Self-Organization and Identification of Web Communities

Computer
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Quantified Score

Hi-index	0.00

Visualization

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.