arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0809.4610physics.soc-phcond-mat.stat-mech
收藏

用极大似然法搜索复杂网络上的加权子图

Search of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods

Mitrovic Marija, Bosiljka Tadic

摘要:

真实数据网络通常表现出很强的模块性,或网络的网络结构,其中出现各种大小和一致性的子图。找到相应的子图结构非常重要,特别是对于理解这些网络上的动态。本文用广义极大似然方法研究模块网络。我们首先演示了如何在计算机生成的网络与控制连接强度和聚类的子图的方法。然后,我们实现了算法,这是基于权重的链接,并显示其有效性在寻找加权子图上的全连通图和酵母的真实数据网络。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑