Uncovering and testing the fuzzy clusters based on lumped Markov chain in complex network.

ABSTRACT: Identifying clusters, namely groups of nodes with comparatively strong internal connectivity, is a fundamental task for deeply understanding the structure and function of a network. By means of a lumped Markov chain model of a random walker, we propose two novel ways of inferring the lumped markov transition matrix. Furthermore, some useful results are proposed based on the analysis of the properties of the lumped Markov process. To find the best partition of complex networks, a novel framework including two algorithms for network partition based on the optimal lumped Markovian dynamics is derived to solve this problem. The algorithms are constructed to minimize the objective function under this framework. It is demonstrated by the simulation experiments that our algorithms can efficiently

SUBMITTER: Jing F 

PROVIDER: S-EPMC3877001 | biostudies-literature | 2013

REPOSITORIES: biostudies-literature