In this article, random walk parameters are analyzed. Then the relations of eigenvalues are examined. Meanwhile, a limit is set for the main parameters. Then the application in electronic networks will be described. Also, applications in computer science are mentioned, especially in encryption management for computing network. Physical achievements are used to obtain results in random walks. At the end, the applied algorithms of random walk and random walk sampling will be described.
Shams, M. and Hesamian, G. (2023). Random walk on connected graphs and its application in electronic networks. Soft Computing Journal, (), -. doi: 10.22052/scj.2024.248446.1106
MLA
Shams, M. , and Hesamian, G. . "Random walk on connected graphs and its application in electronic networks", Soft Computing Journal, , , 2023, -. doi: 10.22052/scj.2024.248446.1106
HARVARD
Shams, M., Hesamian, G. (2023). 'Random walk on connected graphs and its application in electronic networks', Soft Computing Journal, (), pp. -. doi: 10.22052/scj.2024.248446.1106
CHICAGO
M. Shams and G. Hesamian, "Random walk on connected graphs and its application in electronic networks," Soft Computing Journal, (2023): -, doi: 10.22052/scj.2024.248446.1106
VANCOUVER
Shams, M., Hesamian, G. Random walk on connected graphs and its application in electronic networks. Soft Computing Journal, 2023; (): -. doi: 10.22052/scj.2024.248446.1106
)