论文信息 - A Direct Proof of Significant Directed Random Walk

A Direct Proof of Significant Directed Random Walk

This paper is presented to disclose the relationship between weight and connectivity of nodes. An equation is formed to enhance the connectivity of nodes in directed graph via weigh. With implementation of references data, the adjacency matrix is further enhances to increases the accessibility of nodes via vector. The evolution of random walk is disclosed in this paper as well. Significant directed random walk will be used to prove the importance of weight in this paper.

[1] W. V. van IJcken,et al. Gene Expression-Based Classification of Non-Small Cell Lung Carcinomas and Survival Prediction , 2010, PloS one.

[2] D. Ron,et al. Testing properties of directed graphs: acyclicity and connectivity , 2002 .

[3] Min-Hsueh Pan,et al. Investigations on the , 1993 .

[4] Fan Zhang,et al. Topologically inferring risk-active pathways toward precise cancer classification by directed random walk , 2013, Bioinform..

[5] R. Bapat,et al. On weighted directed graphs , 2012 .

[6] Mohd Saberi Mohamad,et al. Specific Tuning Parameter for Directed Random Walk Algorithm Cancer Classification , 2017 .

[7] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[8] Albert Einstein,et al. Investigations on the Theory of the Brownian Movement , 1928, The Mathematical Gazette.

[9] Michael K. Ng,et al. Feature weight estimation for gene selection: a local hyperlinear learning approach , 2014, BMC Bioinformatics.

[10] Edward A. Codling,et al. Random walk models in biology , 2008, Journal of The Royal Society Interface.

[11] KARL PEARSON,et al. The Problem of the Random Walk , 1905, Nature.