… So, the theory of random walks on a graph does not differ significantly from the theory of Markov chains. Conversely, every Markov chain can be represented as a random walk on a …
CITATION STYLE
Kartashev, K., Doikin, A., Campean, F., Uglanov, A., Abdullatif, A., Zhang, Q., & Angiolini, E. (2022). Driver Behaviour Clustering Using Discrete PDFs and Modified Markov Algorithm (pp. 557–568). https://doi.org/10.1007/978-3-030-87094-2_49
Mendeley helps you to discover research relevant for your work.