markovTreePathCount
バージョン 1.0.0.0 (874 Bytes) 作成者:
Lionel Tailhardat
Compute the number of path at the Nth rank of a bivalent tree
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)
引用
Lionel Tailhardat (2024). markovTreePathCount (https://www.mathworks.com/matlabcentral/fileexchange/64139-markovtreepathcount), MATLAB Central File Exchange. 取得済み .
MATLAB リリースの互換性
作成:
R2017a
すべてのリリースと互換性あり
プラットフォームの互換性
Windows macOS Linuxカテゴリ
- Computational Finance > Financial Instruments Toolbox > Price Instruments Using Functions > Interest-Rate Instruments > Price Using Tree Models > Tree Manipulation for Interest-Rate Instruments >
Help Center および MATLAB Answers で Tree Manipulation for Interest-Rate Instruments についてさらに検索
タグ
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!バージョン | 公開済み | リリース ノート | |
---|---|---|---|
1.0.0.0 |