This work has been done to study the behavior of a markov random walk in regard to its rank, and its connection to a normal distribution.
%% Tree calculus
N = 1000;
V = markovTreePathCount(N);
max_path = 2^N;
P = V / max_path
Lionel Tailhardat (2021). markovTreePathCount (https://www.mathworks.com/matlabcentral/fileexchange/64139-markovtreepathcount), MATLAB Central File Exchange. Retrieved .
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!