A BINOMIAL SPLITTING PROCESS IN CONNECTION WITH CORNER PARKING PROBLEMS
檔案
本條目沒有附加檔案。
日期
2014-12-01
類型
系所
期刊名稱
JOURNAL OF APPLIED PROBABILITY
卷期與頁次
第 51 卷,頁 971–989
ISSN
0021-9002
語言
英文
摘要
This paper studies a special type of binomial splitting process. Such a process can be used to model a high dimensional corner parking problem as well as determining the depth of random PATRICIA (practical algorithm to retrieve information coded in alphanumeric) tries, which are a special class of digital tree data structures. The latter also has natural interpretations in terms of distinct values in independent and identically distributed geometric random variables and the occupancy problem in urn models. The corresponding distribution is marked by a logarithmic mean and a bounded variance, which is oscillating, if the binomial parameter p is not equal to 1/2, and asymptotic to one in the unbiased case. Also, the limiting distribution does not exist as a result of the periodic fluctuations.
關鍵詞
Binomial distributionparking problemperiodic fluctuationasymptotic approximationdigital treede-Poissonization所屬典藏
期刊論文引用此條目
Fuchs, M., Hwang, H.-K., Itoh, Y., & Mahmoud, H. H. (2014). A BINOMIAL SPLITTING PROCESS IN CONNECTION WITH CORNER PARKING PROBLEMS. JOURNAL OF APPLIED PROBABILITY, 51, 971–989. https://ir.lib.nycu.edu.tw/handle/11536/124867
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/124867