markovTreePathCount

Versione 1.0.0.0 (874 Byte) da Lionel Tailhardat
Compute the number of path at the Nth rank of a bivalent tree
0.0
(0)
25 download
Aggiornato 15 ago 2017

Visualizza la licenza

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
plot(P)

Cita come

Lionel Tailhardat (2025). markovTreePathCount (https://it.mathworks.com/matlabcentral/fileexchange/64139-markovtreepathcount), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2017a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Tag Aggiungi tag

Community Treasure Hunt

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

Start Hunting!

Versione Pubblicato Note della release
1.0.0.0