preprint · arXiv (Cornell University) · 2009

Numerical Approach to Central Limit Theorem for Bifurcation Ratio of Random Binary Tree

Yamamoto, Ken, Yamazaki, Yoshihiro

Cited by 0Open access

Abstract

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the Horton-Strahler indices are calculated by using the sequence. By fitting the Gaussian distribution function to our numerical data, the values of variances are determined and written in simple forms.

Cite this paper

APA 7

Yamamoto, K., & Yamazaki, Y. (2009). Numerical Approach to Central Limit Theorem for Bifurcation Ratio of Random Binary Tree. arXiv (Cornell University). https://doi.org/10.48550/arxiv.0904.2043

MLA 9

Yamamoto, Ken, and Yoshihiro Yamazaki. “Numerical Approach to Central Limit Theorem for Bifurcation Ratio of Random Binary Tree.” arXiv (Cornell University), 2009, https://doi.org/10.48550/arxiv.0904.2043.

Chicago

Yamamoto, Ken, and Yoshihiro Yamazaki. 2009. “Numerical Approach to Central Limit Theorem for Bifurcation Ratio of Random Binary Tree.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.0904.2043.

Harvard

Yamamoto, K. and Yamazaki, Y. (2009) ‘Numerical Approach to Central Limit Theorem for Bifurcation Ratio of Random Binary Tree’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.0904.2043.

BibTeX

@misc{yamamoto2009numerical,
  title = {{Numerical Approach to Central Limit Theorem for Bifurcation Ratio of Random Binary Tree}},
  author = {Yamamoto, Ken and Yamazaki, Yoshihiro},
  journal = {arXiv (Cornell University)},
  year = {2009},
  doi = {10.48550/arxiv.0904.2043}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.