ZHANG Guo-chun,WANG Liang,CHEN Ya-ting. Generating Function with the Random Walk Model[J]. Journal of Hebei University (Natural Science Edition), 2009, 29(6): 570-573,590.
[1] 杨振生. 组合数学及其算法 [M]. 合肥:中国科学技术大学出版社 1997. [2] 卢开澄. 组合数学 [M]. 北京:清华大学出版社 1991. [3] FERGUSON T S. Who solved the secretary problem [J]. Statistical Science 1989. [4] Akyildiz I.F., Yi-Bing Lin, Wei-Ru Lai, Rong-Jaye Chen. A new random walk model for PCS networks [J]. IEEE Journal on Selected Areas in Communications 2000, 7(7). [5] KAUSIK CHAUDHURI, WU Yangru. Random walk versus breaking trend in stock prices:Evidence from emerging markets [J]. Journal of Banking and Finance 2003, 27(04). [6] GANDJBAKHCHE A M, NOSSAL R, BONNER R F. Scaling relationships for theories of anisotropic random walks applied to tissue optics [J]. Applied Optics 1993, 32. [7] ALM S E. Upper bounds for the connective constant of self-avoiding walks [J]. Combin Probab Comput 1993. [8] FERGUSON T S. Who solved the secretary problem [J]. Statistical Science 1989. [9] KAUSIK CHAUDHURI, WU Yangru. Random walk versus breaking trend in stock prices:evidence from emerging markets [J]. Journal of Banking and Finance 2003, 27(04). [10] Katzenbeisser W., Panny W.. SIMPLE RANDOM WALK STATISTICS.1. DISCRETE TIME RESULTS [J]. Journal of Applied Probability 1996, 2(2). [11] ABBOTT H L, HANSON D. A lattice path problem [J]. Australasian Journal of Combinatorics 1978.
