完整後設資料紀錄
DC 欄位語言
dc.contributor.authorFuchs, Michaelen_US
dc.contributor.authorHwang, Hsien-Kueien_US
dc.contributor.authorItoh, Yoshiakien_US
dc.contributor.authorMahmoud, Hosam H.en_US
dc.date.accessioned2015-07-21T08:28:47Z-
dc.date.available2015-07-21T08:28:47Z-
dc.date.issued2014-12-01en_US
dc.identifier.issn0021-9002en_US
dc.identifier.urihttp://hdl.handle.net/11536/124867-
dc.description.abstractThis 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.en_US
dc.language.isoen_USen_US
dc.subjectBinomial distributionen_US
dc.subjectparking problemen_US
dc.subjectperiodic fluctuationen_US
dc.subjectasymptotic approximationen_US
dc.subjectdigital treeen_US
dc.subjectde-Poissonizationen_US
dc.titleA BINOMIAL SPLITTING PROCESS IN CONNECTION WITH CORNER PARKING PROBLEMSen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF APPLIED PROBABILITYen_US
dc.citation.volume51en_US
dc.citation.spage971en_US
dc.citation.epage989en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000355027500009en_US
dc.citation.woscount0en_US
顯示於類別:期刊論文