Markov Processes Involving q-Stirling Numbers
暂无分享,去创建一个
[1] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[2] Klaus Simon,et al. An Improved Algorithm for Transitive Closure on Acyclic Digraphs , 1986, Theor. Comput. Sci..
[3] Philippe Flajolet,et al. Approximate counting: A detailed analysis , 1985, BIT.
[4] B. Gnedenko,et al. Lehrbüch der Wahrscheinlichkeitsrechnung , 1978 .
[5] Robert H. Morris,et al. Counting large numbers of events in small registers , 1978, CACM.
[6] Klaus Simon,et al. On the Distribution of the Transitive Closure in a Random Acyclic Digraph , 1993, ESA.
[7] H. Gould. The $q$-Stirling numbers of first and second kinds , 1961 .
[8] Davide Crippa,et al. q{Distributions in Random Graphs: Transitive Closure and Reduction , 1995 .