A Direct Proof of Significant Directed Random Walk

2nd International Conference on Automation, Control and Robotics Engineering

工业技术;计算机科学;无线电电子学

Seah, Choon Sen^1 ; Kasim, Shahreen^1 ; Fudzee, Mohd Farhan Md^1 ; Mohamad, Mohd Saberi^2

Soft Computing and Data Mining Centre, Faculty of Computer Sciences and Information Technology, Universiti Tun Hussein Onn Malaysia, Malaysia^1

Faculty of Computing, Universiti Teknologi Malaysia, Skudai, Malaysia^2

关键词: Adjacency matrices;    Directed random walk;    Random Walk;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/235/1/012004/pdf
DOI  :  10.1088/1757-899X/235/1/012004

来源: IOP

【 摘 要 】

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.