Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods

Details Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods

2008-09-26

arxiv.org/abs/0809.4610v1

Physics

Physics and Society

Scientific paper

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 its efficiency in finding weighted subgraphs on fully connected graph and on real-data network of yeast.

Affiliated with

Also associated with

No associations

Rating

Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-712840