Network reconstruction by the stationary distribution of random walk process

It is known that the stationary distribution of the random walk process is dependent on the structure of the network. This could provide us a solution of the network reconstruction. However, the stationary distribution of the random walk process can only reflect the relative size of node degrees dir...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-03
Main Authors: He, Zhe, Li, Ming, Rui-Jie Xu, Bing-Hong, Wang
Format: Article
Language:English
Subjects:
Markov analysis
Queuing theory
Random walk
Random walk theory
Reconstruction
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is known that the stationary distribution of the random walk process is dependent on the structure of the network. This could provide us a solution of the network reconstruction. However, the stationary distribution of the random walk process can only reflect the relative size of node degrees directly, how to infer the real connection is still a problem. In this paper, we will propose a method to reconstruct network by the random walk process, which can reconstruct the total number of links, degree sequence and links sequentially. In our method, only the stationary distribution is used, and no data of the evolution process is needed, such as the first passage time. We perform our method on some network models and real-world network, the results indicate our method can reconstruct networks accurately, even when we can not get the exact stationary distribution.
ISSN:2331-8422