Supporting Information S1 - Finding and Testing Network Communities by Lumped Markov Chains
收藏NIAID Data Ecosystem2026-03-07 收录
下载链接：
https://figshare.com/articles/dataset/Finding_and_Testing_Network_Communities_by_Lumped_Markov_Chains/131718
下载链接
链接失效反馈官方服务：
资源简介：
Figure S1.1. The persistence probabilities' diagram of the Erdös-Rényi network. Figure S1.2. Zachary's karate club network. Above: The dendrogram obtained with . Below: The persistence probabilities' diagram. Figure S1.3. The persistence probabilities' diagrams of two LFR directed, weighted benchmark networks. Top: (the number of planted communities is 35). Bottom: (42 planted communities). See the text for the other parameters. Figure S1.4. LinkRank benchmark network. Figure S1.5. The persistence probabilities' diagram of the LinkRank benchmark network. Figure S1.6. The persistence probabilities' diagram of the neural network. Figure S1.7. Absolute and relative persistence probabilities' diagrams of a LFR benchmark network. The relative persistence probability compares the absolute one with the persistence probability of the same cluster in a null model.
(PDF)
创建时间：
2011-11-03
