File Exchange

image thumbnail


version (874 Bytes) by Lionel Tailhardat
Compute the number of path at the Nth rank of a bivalent tree


Updated 15 Aug 2017

View License

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.
e.g. :
%% Tree calculus
N = 1000;
V = markovTreePathCount(N);
max_path = 2^N;
P = V / max_path

Cite As

Lionel Tailhardat (2021). markovTreePathCount (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2017a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!